Go to the documentation of this file.
85 void *
operator new(size_t,double,double,int,int,
J *);
119 void *
operator new(
size_t size,
int r,
int c,
double v,
Smatrix *rptr=NULL,
135 long int fillin,flops,ngivens;
167 int *qrprow=NULL,
int *qrpcol=NULL,
double qrztol=DBL_EPSILON,
181 #endif // sparseqr_hh
void Sort()
Sorts the entries of each row.
Smatrix * MarkEntry(Smatrix **sptr)
void RemoveEntry(int, int)
bool del_prow
Stores if delete[] of prow and pcol is allowed.
int givens(int, int, int)
Performs Given's rotations.
void init(unsigned cnt=0)
Initializes the dynamic storage.
Smatrix * RemoveEntry(int, int, Smatrix *, Smatrix *)
double * ApplyQ(double *)
QR(Packed *qrpmatrix, int qrnr, int qrnc, double *qrb=NULL, Qmatrix *qrq=NULL, int *qrprow=NULL, int *qrpcol=NULL, double qrztol=DBL_EPSILON, double qrrtol=0.0)
Constructor.
Packed(unsigned cnt=0)
Constructor.
int sparseqr()
Performs QR factorization.
Smatrix * MoveDown(Smatrix **)
double * value
Values of the entries.
int RemoveMarkedEntries(int)
unsigned size
Number of entries in the row.
int * col
Column indices of the entries.
std::ostream & operator<<(std::ostream &os, const Packed &p)
void BackSolve(int rank, double *x)
Performes backsolve.
Q matrix of the QR factorization.
Smatrix * MoveRight(Smatrix **)