Parallelism and fast solution of linear systems

DOI10.1016/0898-1221(90)90354-MzbMath0697.65011OpenAlexW2037076817MaRDI QIDQ911213

Bruno Codenotti, Mauro Leoncini

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90354-m

zbMATH Keywords

parallel computationconjugate gradient methoditerative solutiondirect solutionfast solution of linear systemsparallel arithmetic complexity

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Improvement of ID3 algorithm based on simplified information entropy and coordination degree ⋮ Unnamed Item ⋮ A parallel alternating direction implicit preconditioning method

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