Rank and null space calculations using matrix decomposition without column interchanges
type: Item
instance of: scholarly article
title: Rank and null space calculations using matrix decomposition without column interchanges
zbMATH Open document ID: 0589.65031
DOI: 10.1016/0024-3795(86)90115-1
author: Leslie Foster
published in: Linear Algebra and its Applications
publication date: 1986-01-01T00:00:00Z
review text: With this paper two stable algorithms are presented which do not require column interchanges for determining the rank and nullity of a matrix. Potential applications to sparse matrix rank determination and more specifically rank determination when sequentially adding columns are discussed.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A23
zbMATH DE Number: 3947521
zbMATH Keywords: stable algorithms
zbMATH Keywords: nullity
zbMATH Keywords: sparse matrix rank determination
reviewed by: Dimitris Voukalis
describes a project that uses: CRAIG
describes a project that uses: LSQR
describes a project that uses: LINPACK
MaRDI profile type: Publication
full work available at URL: 0024-3795(86)90115-1
OpenAlex ID: W2088028877
cites work: A direct method for the solution of sparse linear least squares problems
cites work: Q4121360
cites work: Updating the singular value decomposition
cites work: An Estimate for the Condition Number of a Matrix
cites work: Q5540945
cites work: A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
cites work: Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
cites work: A practical solution to the minimal design problem
cites work: Solution of sparse linear least squares problems using Givens rotations
cites work: Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
cites work: Some Modified Matrix Eigenvalue Problems
cites work: Condition Number Estimation for Sparse Matrices
cites work: Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: Q4879581
cites work: An Interval Analysis Approach to Rank Determination in Linear Least Squares Problems
cites work: Estimating Matrix Condition Numbers
cites work: Q4104798
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: The least squares problem and pseudo-inverses
cites work: Minimum and Basic Solutions to Singular Linear Systems
cites work: Q4057472
cites work: Q5674306
cites work: A comparison of solutions to the minimal design problem
description: scientific article; zbMATH DE number 3947521