#include <mindegree.hh>
|
| MinDegree (QR *, int) |
|
int | MinSearch (QR *, int, int, int *) |
|
void | Track (QR *, int, int, int) |
|
void | Untrack (QR *, int, int, int, int) |
|
| ~MinDegree () |
|
- Author
- Thomas H. Robey, 1996
- See also
- Homepage of SparseQR
Thomas H. Robey and Deborah L. Sulsky, Row Ordering for Sparse QR Decomposition, SIAM J. Matrix Anal. and Appl., Vol. 15, No. 4, pp. 1208-1225, October 1994.
Definition at line 38 of file mindegree.hh.
◆ MinDegree()
sparseqr::MinDegree::MinDegree |
( |
QR * |
, |
|
|
int |
|
|
) |
| |
◆ ~MinDegree()
sparseqr::MinDegree::~MinDegree |
( |
| ) |
|
|
inline |
◆ MinSearch()
int sparseqr::MinDegree::MinSearch |
( |
QR * |
, |
|
|
int |
, |
|
|
int |
, |
|
|
int * |
|
|
) |
| |
◆ Track()
void sparseqr::MinDegree::Track |
( |
QR * |
, |
|
|
int |
, |
|
|
int |
, |
|
|
int |
|
|
) |
| |
◆ Untrack()
void sparseqr::MinDegree::Untrack |
( |
QR * |
, |
|
|
int |
, |
|
|
int |
, |
|
|
int |
, |
|
|
int |
|
|
) |
| |
◆ degree
int* sparseqr::MinDegree::degree |
|
private |
◆ list
int * sparseqr::MinDegree::list |
|
private |
◆ work
int* sparseqr::MinDegree::work |
|
private |
The documentation for this class was generated from the following file: