Parallel algorithms for solving large linear systems
From MaRDI portal
Survey paper on the solution of large dense linear systems by direct methods (Gauss, Gauss-Jordan, Huard, Enright) on shared and distributed memory parallel computers. Rather description of the methods than a detailed discussion of parallelization properties which must include the block versions of these algorithms with their communication characteristics.
Recommendations
- Parallel algorithms for the solution of certain large sparse linear systems
- Parallel methods for solving the linear algebraic systems
- Large-Scale Scientific Computing
- Parallelism and fast solution of linear systems
- Problems of parallel solution of large systems of linear algebraic equations
- scientific article; zbMATH DE number 1421713
- scientific article; zbMATH DE number 1185930
- Parallel solution of linear systems
- Parallel strategies for linear systems of equations
- scientific article; zbMATH DE number 4184919
Cites work
- Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- Average-Case Stability of Gaussian Elimination
- Error Analysis of Direct Methods of Matrix Inversion
- scientific article; zbMATH DE number 4016031 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3994887 (Why is no real title available?)
- scientific article; zbMATH DE number 4001309 (Why is no real title available?)
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- Iterated Runge–Kutta Methods on Parallel Computers
- Monitoring the numerical stability of Gaussian elimination
- On the performance of transputer networks for solving linear systems of equations
- On the stability of Gauss-Jordan elimination with pivoting
- Parallel Computers 2
- Rehabilitation of the Gauss-Jordan algorithm
- Solving linear systems on a vector computer
Cited in
(26)- A parallel algorithm for linear programming problems
- Solving large dense systems of linear equations on systems with virtual memory and with cache
- The Gauss-Huard algorithm and LU factorization
- Stability of the Gauss-Huard algorithm with partial pivoting
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Fast and efficient parallel solution of dense linear systems
- scientific article; zbMATH DE number 3843061 (Why is no real title available?)
- Parallelly solving linear systems on a hierarchy memory multiprocessor
- Parallel Algorithms for Dense Linear Algebra Computations
- scientific article; zbMATH DE number 4032903 (Why is no real title available?)
- scientific article; zbMATH DE number 4074332 (Why is no real title available?)
- scientific article; zbMATH DE number 1185930 (Why is no real title available?)
- scientific article; zbMATH DE number 125197 (Why is no real title available?)
- scientific article; zbMATH DE number 1341938 (Why is no real title available?)
- SOLUTION OF LARGE LINEAR SYSTEMS ON PIPELINED SIMD MACHINES
- scientific article; zbMATH DE number 1159803 (Why is no real title available?)
- Communication analysis of the PIE and QIF algorithms on distributed memory architecture
- An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems
- scientific article; zbMATH DE number 4115826 (Why is no real title available?)
- Parallel strategies for linear systems of equations
- On the cost of sequential and parallel algorithms for solving linear system of equations
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Solving systems of large dense linear equations
- Clustered Gauss-Huard algorithm for the solution of Ax = b
- Parallelism and fast solution of linear systems
- A parallel implementation of overlapping Schwarz method for the dual reciprocity method
This page was built for publication: Parallel algorithms for solving large linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334766)
