A survey of the advances in the exploitation of the sparsity in the solution of large problems
From MaRDI portal
Publication:1099926
DOI10.1016/0377-0427(87)90127-0zbMath0639.65020OpenAlexW2083993407MaRDI QIDQ1099926
Publication date: 1987
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(87)90127-0
Gaussian eliminationorthogonal methodslarge-scale problemsparse matrix techniquespivotal strategiesstorage schemes
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel pivoting algorithms for sparse symmetric matrices
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- General scheme for solving linear algebraic problems by direct methods
- Direct methods for sparse matrices
- Exploiting the sparsity in the solution of linear ordinary differential equations
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Parallel implementation of multifrontal schemes
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Solution of sparse linear least squares problems using Givens rotations
- Y12M. Solution of large and sparse systems of linear algebraic equations. Documentation of subroutines
- A direct method for the solution of sparse linear least squares problems
- Comparison of two pivotal strategies in sparse plane rotations
- Pivot selection and row ordering in Givens reduction on sparse matrices
- Error analysis of QR decompositions by Givens transformations
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Consistency and convergence of general linear multistep variable stepsize variable formula methods
- A desirable form for sparse matrices when computing their inverse in factored forms
- The Elimination form of the Inverse and its Application to Linear Programming
- Block Preconditioning for the Conjugate Gradient Method
- The Multifrontal Solution of Unsymmetric Sets of Linear Equations
- Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
- Numerical Methods for Large Sparse Linear Least Squares Problems
- Condition Number Estimators in a Sparse Matrix Software
- On General Row Merging Schemes for Sparse Givens Transformations
- On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- Condition Number Estimation for Sparse Matrices
- Modified Diagonally Implicit Runge–Kutta Methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Comparison of Two Algorithms for Solving Large Linear Systems
- Yale sparse matrix package I: The symmetric codes
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- Partial Elimination
- Eigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Some Design Features of a Sparse Matrix Code
- An Estimate for the Condition Number of a Matrix
- Basic Linear Algebra Subprograms for Fortran Usage
- Least Squares Computations by Givens Transformations Without Square Roots
- Iterative refinement of linear least squares solutions I
- Techniques for automatic tolerance control in linear programming
- Iterative refinement of linear least squares solutions II
- The Solution of Large Sparse Unsymmetric Systems of Linear Equations
- The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
- Some Results on Sparse Matrices
