Matrix enlarging methods and their application
type: Item
instance of: scholarly article
title: Matrix enlarging methods and their application
zbMATH Open document ID: 0883.65036
DOI: 10.1007/BF02510237
author: Fernando L. Alvarado
published in: BIT
publication date: 1997-11-13T00:00:00Z
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.
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F20
zbMATH DE Number: 1087015
zbMATH Keywords: numerical experiments
zbMATH Keywords: Schur complement
zbMATH Keywords: sparse matrix
zbMATH Keywords: condition number
zbMATH Keywords: matrix enlarging
reviewed by: D. Braess
describes a project that uses: Harwell-Boeing sparse matrix collection
MaRDI profile type: Publication
cites work: Manipulation and Visualization of Sparse Matrices
cites work: Q3973836
cites work: Q4851601
cites work: A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
cites work: Q4868585
cites work: Q4353200
cites work: Q3768810
cites work: Predicting fill for sparse orthogonal factorization
cites work: On the Condition of the Linear Systems Associated with Discretized BVP<scp>s</scp> of ODE<scp>s</scp>
cites work: Sparse matrix test problems
cites work: A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
cites work: Solution of sparse linear least squares problems using Givens rotations
cites work: On Row and Column Orderings for Sparse Least Squares Problems
cites work: Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
cites work: Q4114698
cites work: Numerical methods for solving linear least squares problems
cites work: Numerical Methods for Large Sparse Linear Least Squares Problems
cites work: Modification of the minimum-degree algorithm by multiple elimination
cites work: Q4320128
cites work: Splitting dense columns in sparse linear systems
description: scientific article; zbMATH DE number 1087015