The impact of high-performance computing in the solution of linear systems: Trends and problems
From MaRDI portal
Publication:1591200
DOI10.1016/S0377-0427(00)00401-5zbMath0970.65025OpenAlexW1997210084MaRDI QIDQ1591200
Publication date: 7 October 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00401-5
sparse matricesfactorizationdirect methodsparallel computationshigh-performance computingdense systems
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
High performance inverse preconditioning, A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method, Explicit approximate inverse preconditioning techniques, Solving PDEs in non-rectangular 3D regions using a collocation finite element method, A survey of direct methods for sparse linear systems, A performance study of normalized explicit finite element approximate inverse preconditioning on uniprocessor and multicomputer systems, OpenMP based parallel normalized direct methods for sparse finite element linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel sparse matrix solution and performance
- Parallel sparse QR factorization on shared memory architectures
- Parallel implementation of multifrontal schemes
- Reordering sparse matrices for parallel elimination
- Decomposition of a symmetric matrix
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- Two-dimensional block partitionings for the parallel sparse Cholesky factorization
- Parallel ordering using edge contraction
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Iterative solution of linear systems in the 20th century
- Numerical linear algebra algorithms and software
- Parallelized methods for large nonlinear and linear systems in the dynamic simulation of industrial applications
- Multiprocessing a sparse matrix code on the Alliant FX/8
- The Elimination form of the Inverse and its Application to Linear Programming
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Parallel Sparse LU Decomposition on a Mesh Network of Transputers
- Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- An extended set of FORTRAN basic linear algebra subprograms
- Incomplete Nested Dissection for Solving n by n Grid Problems
- The Design of a User Interface for a Sparse Matrix Package
- Basic Linear Algebra Subprograms for Fortran Usage
- Numerical Linear Algebra for High-Performance Computers
- Improving the Run Time and Quality of Nested Dissection Ordering
- A Supernodal Approach to Sparse Partial Pivoting
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- ScaLAPACK Users' Guide
- A set of level 3 basic linear algebra subprograms
- Robust Ordering of Sparse Matrices using Multisection
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- An Approximate Minimum Degree Ordering Algorithm
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- Optimal Parallel Solution of Sparse Triangular Systems
- Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
- Nested Dissection of a Regular Finite Element Mesh
