|
| TSquareStructure () |
|
| ~TSquareStructure () |
|
| TSquareStructure (int n, int N_entries, int *col_ptr, int *row_ptr) |
|
| TSquareStructure (int n) |
|
int | GetActiveBound () const |
|
int | GetColOrder () const |
|
void | Sort () |
|
void | SetColOrder (int n) |
|
void | SortDiagFirst () |
|
| TStructure () |
|
| TStructure (int n, int N_entries, int *col_ptr, int *row_ptr) |
|
| TStructure (int nRows, int nCols, int N_entries, int *col_ptr, int *row_ptr) |
|
| TStructure (int nRows, int nCols) |
|
| ~TStructure () |
|
int | GetN_Rows () const |
|
int | GetN_Columns () const |
|
int | GetN_Entries () const |
|
int | GetHangingN_Entries () const |
|
int * | GetKCol () const |
|
int * | GetHangingKCol () const |
|
int * | GetRowPtr () const |
|
int * | GetHangingRowPtr () const |
|
void | setN_Rows (int n) |
| set member variables. Careful, this can produce inconsistencies!
|
|
void | setN_Columns (int n) |
|
void | setN_Entries (int n) |
|
void | setKCol (int *p) |
|
void | setRowPtr (int *p) |
|
void | SortRow (int *BeginPtr, int *AfterEndPtr) |
|
void | Sort () |
|
int | index_of_entry (const int i, const int j) const |
| find the index of a given entry More...
|
|
TStructure * | GetTransposed () |
|
|
void | IntSort (int *BeginPtr, int *AfterEndPtr) |
|
TSquareStructure::TSquareStructure |
( |
| ) |
|
generate the matrix structure, only one space needed
generate the matrix structure, both space are 2D
TSquareStructure::~TSquareStructure |
( |
| ) |
|
destructor: free all used arrays
TSquareStructure::TSquareStructure |
( |
int |
n, |
|
|
int |
N_entries, |
|
|
int * |
col_ptr, |
|
|
int * |
row_ptr |
|
) |
| |
generate the matrix structure, all arrays are already defined
TSquareStructure::TSquareStructure |
( |
int |
n | ) |
|
|
explicit |
Generates an empty n*n Structure for a Zero-Matrix
int TSquareStructure::GetActiveBound |
( |
| ) |
const |
|
inline |
int TSquareStructure::GetColOrder |
( |
| ) |
const |
|
inline |
return ordering of columns
void TSquareStructure::IntSort |
( |
int * |
BeginPtr, |
|
|
int * |
AfterEndPtr |
|
) |
| |
|
protected |
sort an integer array
sort an integer array [BeginPtr, AfterEndPtr)
void TSquareStructure::Sort |
( |
| ) |
|
sort column numbers in each row, increasing indices
sort column numbers: numbers are increasing this is the ordering used by umfpack
void TSquareStructure::SortDiagFirst |
( |
| ) |
|
sort column numbers: diag is first element, other numbers are
increasing
sort column numbers: diag is first element, other numbers are increasing
Comparision Operators.
sort column numbers in increasing in all rows including Dirichlet DOF row Comparision Operator
int TSquareStructure::ActiveBound |
|
protected |
int TSquareStructure::ColOrder |
|
protected |
ordering of the column entries 0 - no special ordering 1 - increasing ordering (like used for umfpack) 2 - diagonal entry first, then increasing ordering
The documentation for this class was generated from the following files: