Towards an accurate performance modeling of parallel sparse factorization

DOI10.1007/s00200-007-0036-yzbMath1122.65029OpenAlexW2044416352MaRDI QIDQ2642894

Yanyan Li

Publication date: 6 September 2007

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc899955/

zbMATH Keywords

numerical examplesparallel computationCholesky factorizationLU factorizationQR factorizationperformance modelingdistributed parallel machineparallel sparse factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A survey of direct methods for sparse linear systems

Uses Software

• SuperLU-DIST
• ATLAS
• SuperLU
• GEMM
• SparseMatrix
• PAPI

Cites Work

• GEMM-based level 3 BLAS
• Algorithm 784: GEMM-based level 3 BLAS
• SuperLU_DIST
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards an accurate performance modeling of parallel sparse factorization