Pages that link to "Item:Q1074304"
From MaRDI portal
The following pages link to Rank and null space calculations using matrix decomposition without column interchanges (Q1074304):
Displayed 12 items.
- Rang revealing QR factorizations (Q578845) (← links)
- Block elimination with one refinement solves bordered linear systems accurately (Q915359) (← links)
- On the computation of the rank of block bidiagonal Toeplitz matrices (Q1012505) (← links)
- Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations (Q1092611) (← links)
- A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- A block algorithm for computing rank-revealing QR factorizations (Q1200543) (← links)
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition (Q1208058) (← links)
- The behavior of the QR-factorization algorithm with column pivoting (Q1375836) (← links)
- Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
- Dynamic block GMRES: An iterative method for block linear systems (Q2463394) (← links)
- Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies (Q5961649) (← links)