SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
From MaRDI portal
Publication:3350654
DOI10.1142/S0129053389000056zbMath0726.65026WikidataQ57696273 ScholiaQ57696273MaRDI QIDQ3350654
Publication date: 1989
Published in: International Journal of High Speed Computing (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ Unnamed Item ⋮ Finite element applications on a shared-memory multiprocessor: Algorithms and experimental results ⋮ Performance optimizations for scalable implicit RANS calculations with SU2 ⋮ Iterative ILU Preconditioners for Linear Systems and Eigenproblems ⋮ A parallel multithreaded sparse triangular linear system solver ⋮ Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices ⋮ Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems ⋮ Efficient time integration of Navier-Stokes equations ⋮ MPI+OpenMP реализация метода сопряженных градиентов с факторизованными неявными предобусловливателями ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ A survey of direct methods for sparse linear systems ⋮ Nonsymmetric Reduction-Based Algebraic Multigrid ⋮ Effect of the storage format of sparse linear systems on parallel CFD computations ⋮ Fine-Grained Parallel Incomplete LU Factorization ⋮ Iterative solution of linear systems in the 20th century ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems ⋮ A parallel interior point algorithm for linear programming on a network of transputers
