Pages that link to "Item:Q3774826"
From MaRDI portal
The following pages link to Predicting fill for sparse orthogonal factorization (Q3774826):
Displaying 15 items.
- On the row merge tree for sparse LU factorization with partial pivoting (Q878210) (← links)
- A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- Predicting the structure of sparse orthogonal factors (Q1318224) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Matrix enlarging methods and their application (Q1371659) (← links)
- Patterns that preserve sparsity in orthogonal factorization (Q1375102) (← links)
- Accuracy of preconditioned CG-type methods for least squares problems. (Q1416375) (← links)
- Newton flows for elliptic functions. II: Structural stability: classification and representation (Q1682785) (← links)
- On the classification of plane graphs representing structurally stable rational Newton flows (Q2277490) (← links)
- Matrix stretching for sparse least squares problems (Q2760330) (← links)
- The Null Space Problem II. Algorithms (Q3783422) (← links)
- (Q4220434) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations (Q5270712) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
