Matrix enlarging methods and their application

DOI10.1007/BF02510237MaRDI QIDQ1371659zbMATH OpenFDO

Authors Fernando L. Alvarado

Publication date 13 November 1997

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02510237

zbMATH Keywords

condition numbermatrix enlargingnumerical experimentsSchur complementsparse matrix

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Review text

It is known that finding the Schur complement of a sparse matrix often results in a denser matrix with a worse condition number. Therefore, the converse is tried in this paper. There are reports on experiments with three methods for matrix enlarging, sparse matrix primitization, stretching, and mode splitting.

Recommendations

• scientific article; zbMATH DE number 554765
• scientific article; zbMATH DE number 4117735
• scientific article; zbMATH DE number 3997028
• Sparsification of rectangular matrices

Cites work

• A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
• A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
• scientific article; zbMATH DE number 4027357 (Why is no real title available?)
• scientific article; zbMATH DE number 17137 (Why is no real title available?)
• scientific article; zbMATH DE number 3538731 (Why is no real title available?)
• scientific article; zbMATH DE number 712354 (Why is no real title available?)
• scientific article; zbMATH DE number 1058090 (Why is no real title available?)
• scientific article; zbMATH DE number 804602 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• Manipulation and Visualization of Sparse Matrices
• Modification of the minimum-degree algorithm by multiple elimination
• Numerical Methods for Large Sparse Linear Least Squares Problems
• Numerical methods for solving linear least squares problems
• On Row and Column Orderings for Sparse Least Squares Problems
• On the Condition of the Linear Systems Associated with Discretized BVP<scp>s</scp> of ODE<scp>s</scp>
• Predicting fill for sparse orthogonal factorization
• Solution of sparse linear least squares problems using Givens rotations
• Sparse matrix test problems
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Splitting dense columns in sparse linear systems

Cited in

(4)

• Matrix stretching for sparse least squares problems
• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
• A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
• Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Matrix enlarging methods and their application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371659)