Rank and null space calculations using matrix decomposition without column interchanges
From MaRDI portal
Publication:1074304
DOI10.1016/0024-3795(86)90115-1zbMath0589.65031OpenAlexW2088028877MaRDI QIDQ1074304
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(86)90115-1
Related Items
Computation of the GCD of polynomials using gaussian transformations and shifting ⋮ Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations ⋮ A direct method for sparse least squares problems with lower and upper bounds ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ The behavior of the QR-factorization algorithm with column pivoting ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ Unnamed Item ⋮ Literature survey on low rank approximation of matrices ⋮ Block elimination with one refinement solves bordered linear systems accurately ⋮ Dynamic block GMRES: An iterative method for block linear systems ⋮ A block algorithm for computing rank-revealing QR factorizations ⋮ An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition ⋮ Estimation of atmospheric PSF parameters for hyperspectral imaging ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ Rang revealing QR factorizations ⋮ Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies ⋮ On rank and null space computation of the generalized Sylvester matrix ⋮ On the computation of the rank of block bidiagonal Toeplitz matrices ⋮ Maintaining LU factors of a general sparse matrix ⋮ Deviation maximization for rank-revealing QR factorizations ⋮ A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast projection methods for minimal design problems in linear system theory
- Solution of sparse linear least squares problems using Givens rotations
- A direct method for the solution of sparse linear least squares problems
- A practical solution to the minimal design problem
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- A comparison of solutions to the minimal design problem
- Estimating Matrix Condition Numbers
- Condition Number Estimation for Sparse Matrices
- An Interval Analysis Approach to Rank Determination in Linear Least Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- An Estimate for the Condition Number of a Matrix
- Minimum and Basic Solutions to Singular Linear Systems
- The least squares problem and pseudo-inverses
- Some Modified Matrix Eigenvalue Problems
- Updating the singular value decomposition
This page was built for publication: Rank and null space calculations using matrix decomposition without column interchanges
