Hypermatrix oriented supernode amalgamation

DOI10.1007/s11227-008-0188-yzbMath1187.65046OpenAlexW1996554278WikidataQ61736218 ScholiaQ61736218MaRDI QIDQ1009360

Juan J. Navarro, José R. Herrero

Publication date: 31 March 2009

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11227-008-0188-y

zbMATH Keywords

HypermatrixSparse Cholesky factorizationSupernode amalgamation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Uses Software

• PERMAS
• KORBX
• WSMP
• SPLASH-2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypermatrix solution of larg e sets of symmetric positive-definite linear equations
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• The Role of Elimination Trees in Sparse Factorization
• A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• On Finding Supernodes for Sparse Matrix Computations
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• The influence of relaxed supernode partitions on the multifrontal method
• Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers

This page was built for publication: Hypermatrix oriented supernode amalgamation