Parallelism and fast solution of linear systems
From MaRDI portal
Purely theoretical survey of the parallel arithmetic complexity of some algorithms for direct and iterative solution of linear equations without communication penalty. Short discussion of the conjugate gradient method on hypercubes with communication.
Recommendations
- Parallel solution of linear systems
- Fast and efficient parallel solution of dense linear systems
- Parallel algorithms for solving large linear systems
- Processor Efficient Parallel Solution of Linear Systems of Equations
- Parallel strategies for linear systems of equations
- Parallel methods for solving the linear algebraic systems
- scientific article; zbMATH DE number 1185930
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- scientific article; zbMATH DE number 4076453
- Parallel Complexity of Numerically Accurate Linear System Solvers
Cites work
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- An improved parallel processor bound in fast matrix inversion
- Asynchronous Iterative Methods for Multiprocessors
- Chaotic relaxation
- Fast parallel algorithms for matrix inversion and linear systems solution
- Fast parallel matrix and GCD computations
- Fast Parallel Matrix Inversion Algorithms
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- Matrix Inversion Using Parallel Processing
- On computing the determinant in small parallel time using a small number of processors
- On Relating Time and Space to Size and Depth
- On Stable Parallel Linear System Solvers
- Parallelism in random access machines
- Solving Triangular Systems on a Parallel Computer
Cited in
(29)- Iterative methods for the parallel solution of linear systems
- Parallel algorithms for solving large linear systems
- Parallel solution of arbitrarily sparse linear systems
- Fast and efficient parallel solution of dense linear systems
- Improvement of ID3 algorithm based on simplified information entropy and coordination degree
- Efficient algorithm for linear problems using packed data structure with a set of parallel pointers
- Parallel computations in linear algebra. II
- TOTALLY PARALLEL MULTILEVEL ALGORITHMS
- PARALLEL ITERATIVE SOLUTION OF LARGE LINEAR SYSTEMS ON HYPERCUBES
- PARALLEL VARIATIONAL ITERATIVE LINEAR SOLVERS
- scientific article; zbMATH DE number 3915502 (Why is no real title available?)
- Communications oriented programming of parallel iterative solutions of sparse linear systems
- Parallel algorithms for solving linear equations using givens transformations
- scientific article; zbMATH DE number 4062472 (Why is no real title available?)
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- scientific article; zbMATH DE number 48972 (Why is no real title available?)
- scientific article; zbMATH DE number 52641 (Why is no real title available?)
- Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
- scientific article; zbMATH DE number 708861 (Why is no real title available?)
- Improving linear processing systems via flexibility
- scientific article; zbMATH DE number 4115826 (Why is no real title available?)
- Parallel strategies for linear systems of equations
- Fast Multiresolution Algorithms for Solving Linear Equations: A Comparative Study
- Parallel householder method for linear systems
- scientific article; zbMATH DE number 1431705 (Why is no real title available?)
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- An asynchronous parallel method for linear systems
- Successive underrelaxation (SUR) and generalised conjugate gradient (GCG) methods for hyperbolic difference equations on a parallel computer
- A parallel alternating direction implicit preconditioning method
This page was built for publication: Parallelism and fast solution of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911213)
