Pages that link to "Item:Q1074304"

The following pages link to Rank and null space calculations using matrix decomposition without column interchanges (Q1074304):

Displaying 16 items.

• Rang revealing QR factorizations (Q578845) (← links)
• Block elimination with one refinement solves bordered linear systems accurately (Q915359) (← links)
• The ERES method for computing the approximate GCD of several polynomials (Q969304) (← 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)
• Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
• Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
• Deviation maximization for rank-revealing QR factorizations (Q2084250) (← links)
• Dynamic block GMRES: An iterative method for block linear systems (Q2463394) (← links)
• Gram-Schmidt orthogonalization: 100 years and more (Q2931519) (← links)
• (Q5005143) (← links)
• Estimation of atmospheric PSF parameters for hyperspectral imaging (Q5739725) (← links)