Numerical linear algebra algorithms and software

DOI10.1016/S0377-0427(00)00400-3zbMath0965.65049MaRDI QIDQ1591199

Victor Eijkhout, Jack J. Dongarra

Publication date: 19 December 2000

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

performancesurvey paperpreconditionersLU factorizationKrylov subspace methodsiteration methodsbandwidth reductionblock methodsincomplete factorizationsoftware librariessparse algorithmsdense algorithmsnested dissections

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15)

Related Items

Dynamic priority allocation via restless bandit marginal productivity indices, Minimal faithful upper-triangular matrix representations for solvable Lie algebras, Neville elimination: a study of the efficiency using checkerboard partitioning, Blocking Neville elimination algorithm for exploiting cache memories, The impact of high-performance computing in the solution of linear systems: Trends and problems

Uses Software

• LAPACK
• ScaLAPACK
• BLAS
• CGS
• symrcm

Cites Work

• Algebraic multilevel preconditioning methods. I
• The ijk forms of factorization methods. I: Vector computers
• The ijk forms of factorization methods. II: Parallel systems
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• Analysis of parallel incomplete point factorizations
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• The effect of ordering on preconditioned conjugate gradients
• The Use of Linear Graphs in Gauss Elimination
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Preconditioning by Fast Direct Methods for Nonself-Adjoint Nonseparable Elliptic Equations
• An extended set of FORTRAN basic linear algebra subprograms
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• A Separator Theorem for Planar Graphs
• Generalized Nested Dissection
• The Nested Recursive Two-Level Factorization Method for Nine-Point Difference Matrices
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Partial Elimination
• Basic Linear Algebra Subprograms for Fortran Usage
• A set of level 3 basic linear algebra subprograms
• Orthogonal Error Methods
• Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into Substructures
• Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations
• Methods of conjugate gradients for solving linear systems
• 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