Rank and null space calculations using matrix decomposition without column interchanges
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3526220 (Why is no real title available?)
- scientific article; zbMATH DE number 3546670 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 3254517 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- A comparison of solutions to the minimal design problem
- A direct method for the solution of sparse linear least squares problems
- A practical solution to the minimal design problem
- An Estimate for the Condition Number of a Matrix
- An Interval Analysis Approach to Rank Determination in Linear Least Squares Problems
- Condition Number Estimation for Sparse Matrices
- Estimating Matrix Condition Numbers
- Fast projection methods for minimal design problems in linear system theory
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Minimum and Basic Solutions to Singular Linear Systems
- Solution of sparse linear least squares problems using Givens rotations
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Some Modified Matrix Eigenvalue Problems
- The least squares problem and pseudo-inverses
- Updating the singular value decomposition
Cited in
(24)- Block elimination with one refinement solves bordered linear systems accurately
- Detection of near-singularity in Cholesky and LDL^ T factorizations
- Reliable Krylov-based algorithms for matrix null space and rank
- Estimation of atmospheric PSF parameters for hyperspectral imaging.
- Low rank approximation of binary matrices: column subset selection and generalizations
- Gram-Schmidt orthogonalization: 100 years and more
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- A block algorithm for computing rank-revealing QR factorizations
- On the computation of the rank of block bidiagonal Toeplitz matrices
- A direct method for sparse least squares problems with lower and upper bounds
- The behavior of the QR-factorization algorithm with column pivoting
- Computation of the GCD of polynomials using gaussian transformations and shifting
- Dynamic block GMRES: An iterative method for block linear systems
- Structured matrix methods computing the greatest common divisor of polynomials
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
- The ERES method for computing the approximate GCD of several polynomials
- Rang revealing QR factorizations
- A new method of calculating the rank of the matrix.
- Literature survey on low rank approximation of matrices
- scientific article; zbMATH DE number 554742 (Why is no real title available?)
- A nonlinear QR algorithm for banded nonlinear eigenvalue problems
- Deviation maximization for rank-revealing QR factorizations
- On rank and null space computation of the generalized Sylvester matrix
- Maintaining LU factors of a general sparse matrix
This page was built for publication: Rank and null space calculations using matrix decomposition without column interchanges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1074304)
