Optimal Parallel Solution of Sparse Triangular Systems
From MaRDI portal
Publication:5286359
DOI10.1137/0914027zbMath0774.65011OpenAlexW2036603155MaRDI QIDQ5286359
Robert Schreiber, Fernando L. Alvarado
Publication date: 29 June 1993
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/19920002438
numerical examplessparse matricesmatrix factorizationtriangular matricesparallel solverconnection machinetriangular linear systems
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A clique tree algorithm for partitioning a chordal graph into transitive subgraphs, Updating incomplete factorization preconditioners for model order reduction, Parallelizable approximate solvers for recursions arising in preconditioning, An Asynchronous Incomplete Block LU Preconditioner for Computational Fluid Dynamics on Unstructured Grids, Linear algebra software for large-scale accelerated multicore computing, A survey of direct methods for sparse linear systems, On the performance of SPAI and ADI-like preconditioners for core collapse supernova simulations in one spatial dimension, Nonsymmetric Reduction-Based Algebraic Multigrid, Fine-Grained Parallel Incomplete LU Factorization, The impact of high-performance computing in the solution of linear systems: Trends and problems, Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
