Parallelism and fast solution of linear systems
From MaRDI portal
Publication:911213
DOI10.1016/0898-1221(90)90354-MzbMath0697.65011MaRDI QIDQ911213
Mauro Leoncini, Bruno Codenotti
Publication date: 1990
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
parallel computation; conjugate gradient method; iterative solution; direct solution; fast solution of linear systems; parallel arithmetic complexity
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65Y05: Parallel numerical computation
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- Fast parallel algorithms for matrix inversion and linear systems solution
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- An improved parallel processor bound in fast matrix inversion
- Gaussian elimination is not optimal
- Chaotic relaxation
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- Fast Parallel Matrix Inversion Algorithms
- On Stable Parallel Linear System Solvers
- On Relating Time and Space to Size and Depth
- Asynchronous Iterative Methods for Multiprocessors
- Solving Triangular Systems on a Parallel Computer
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- Fast parallel matrix and GCD computations
- Parallelism in random access machines
- Matrix Inversion Using Parallel Processing
