The ijk forms of factorization methods. I: Vector computers

DOI10.1016/0167-8191(88)90035-XzbMath0665.65023OpenAlexW2057176337MaRDI QIDQ1116275

S. H. Smith

Publication date: 1988

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90035-x

zbMATH Keywords

Cholesky factorizationLU factorizationparallel computersvector computersijk forms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers ⋮ A reliable linear algebra library for transputer networks ⋮ Block-Cholesky for parallel processing ⋮ A parallel implementation of Wang's method for solving tridiagonal systems ⋮ On the \(ijk\) forms of the truncated LU decomposition ⋮ Numerical linear algebra algorithms and software

This page was built for publication: The ijk forms of factorization methods. I: Vector computers