scientific article; zbMATH DE number 554771

MaRDI QIDQ4288587zbMATH OpenFDO

Authors Steven G. Kratzer, A. J. Cleary

Publication date 19 April 1994

zbMATH Keywords

Cholesky factorizationparallel computationLU factorizationQR factorizationSIMD parallel computerssparse matrix factorizationmessage passing modeldata parallel modelirregular sparse matrices

Mathematics Subject Classification ID

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

Recommendations

• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• scientific article; zbMATH DE number 741173
• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
• Sparse Matrix Computations on Parallel Processor Arrays
• Data-Parallel Sparse Factorization
• Towards an accurate performance modeling of parallel sparse factorization
• Parallel sparse matrix solution and performance
• Highly Parallel Sparse Cholesky Factorization

Cited in

(8)

• Parallel (M−N)SVD algorithms on the SIMD computers
• Design and implementation of a parallel Markowitz threshold algorithm
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications
• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
• Towards an accurate performance modeling of parallel sparse factorization
• Sparse QR factorization on a massively parallel computer
• scientific article; zbMATH DE number 741173 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288587)