A survey of the advances in the exploitation of the sparsity in the solution of large problems
type: Item
instance of: scholarly article
title: A survey of the advances in the exploitation of the sparsity in the solution of large problems
zbMATH Open document ID: 0639.65020
DOI: 10.1016/0377-0427(87)90127-0
author: Zahari Zlatev
published in: Journal of Computational and Applied Mathematics
publication date: 1987-01-01T00:00:00Z
review text: The author gives an interesting survey and discussion on the advance made in recent years in the development of sparse matrix techniques [cf. \textit{D. J. Evans} (ed.), Sparsity and its applications (1985; Zbl 0544.00021)]. One of the aims in using a sparse matrix technique to solve a large-scale problem involving sparse matrices is to reduce the storage space in the computer memory. The author describes the advantages and the limitations of two basic types of storage schemes, namely the static storage schemes and the dynamic storage schemes, for storing the elements of a sparse matrix in the computer memory, and gives in a systematic way the advances achieved after 1980 in the efforts to improve the performances of these storage schemes. The interested reader may greatly benefit from the large number of references included in the paper.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65-02
zbMATH DE Number: 4043147
zbMATH Keywords: pivotal strategies
zbMATH Keywords: Gaussian elimination
zbMATH Keywords: orthogonal methods
zbMATH Keywords: sparse matrix techniques
zbMATH Keywords: large-scale problem
zbMATH Keywords: storage schemes
describes a project that uses: symrcm
describes a project that uses: MA32
describes a project that uses: MA28
describes a project that uses: SSLEST
describes a project that uses: CRAIG
describes a project that uses: ITPACK
describes a project that uses: LINPACK
describes a project that uses: ELLPACK
describes a project that uses: HSL
describes a project that uses: LSQR
describes a project that uses: Y12M
describes a project that uses: YSMP
MaRDI profile type: Publication
full work available at URL: 0377-0427(87)90127-0
OpenAlex ID: W2083993407
cites work: Iterative refinement of linear least squares solutions I
cites work: Iterative refinement of linear least squares solutions II
cites work: Q3361799
cites work: A direct method for the solution of sparse linear least squares problems
cites work: Some Results on Sparse Matrices
cites work: Techniques for automatic tolerance control in linear programming
cites work: An Estimate for the Condition Number of a Matrix
cites work: Block Preconditioning for the Conjugate Gradient Method
cites work: Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
cites work: Q3878647
cites work: The Solution of Large Sparse Unsymmetric Systems of Linear Equations
cites work: Q3932291
cites work: Pivot selection and row ordering in Givens reduction on sparse matrices
cites work: Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core
cites work: Parallel implementation of multifrontal schemes
cites work: Q3340014
cites work: A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
cites work: Some Design Features of a Sparse Matrix Code
cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear
cites work: The Multifrontal Solution of Unsymmetric Sets of Linear Equations
cites work: Yale sparse matrix package I: The symmetric codes
cites work: The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
cites work: Q4769371
cites work: Q3217519
cites work: Least Squares Computations by Givens Transformations Without Square Roots
cites work: Error analysis of QR decompositions by Givens transformations
cites work: Q4101346
cites work: Solution of sparse linear least squares problems using Givens rotations
cites work: A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
cites work: Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
cites work: Q3664299
cites work: Q3833498
cites work: Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
cites work: Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
cites work: Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
cites work: An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
cites work: Q5827285
cites work: Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form
cites work: Condition Number Estimation for Sparse Matrices
cites work: Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
cites work: Q4404310
cites work: Numerical Methods for Large Sparse Linear Least Squares Problems
cites work: Q3779661
cites work: Partial Elimination
cites work: Basic Linear Algebra Subprograms for Fortran Usage

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: On General Row Merging Schemes for Sparse Givens Transformations

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: The elimination form of the inverse and its application to linear programming

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: The Software Scene in the Extraction of Eigenvalues from Sparse Matrices

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q5849795

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Parallel pivoting algorithms for sparse symmetric matrices

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q3321331

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q4127260

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q4723168

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q3675458

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: A desirable form for sparse matrices when computing their inverse in factored forms

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Eigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q5560629

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q3920540

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q3788962

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Consistency and convergence of general linear multistep variable stepsize variable formula methods

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Modified Diagonally Implicit Runge–Kutta Methods

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Use of Iterative Refinement in the Solution of Sparse Linear Systems

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Comparison of two pivotal strategies in sparse plane rotations

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: General scheme for solving linear algebraic problems by direct methods

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q3217516

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Solving large and sparse linear least-squares problems by conjugate gradient algorithms

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Q3945480

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Y12M. Solution of large and sparse systems of linear algebraic equations. Documentation of subroutines

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Comparison of Two Algorithms for Solving Large Linear Systems

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Exploiting the sparsity in the solution of linear ordinary differential equations

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Condition Number Estimators in a Sparse Matrix Software

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor

A survey of the advances in the exploitation of the sparsity in the solution of large problems (cites work)
cites work: Direct methods for sparse matrices