Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking

DOI10.1007/S00200-007-0039-8MaRDI QIDQ2642898zbMATH OpenOpenAlexDBLPWikidataFDO

Authors José R. Herrero, Juan J. Navarro

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://doi.org/10.1007/s00200-007-0039-8

zbMATH Keywords

performancelinear programminginterior point methodsnumerical examplessparse matrixfinite element methodssparse Cholesky factorization2D partitioninghypermatrix structuresmall matrix librarywindows in submatrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Sparse hypermatrix Cholesky: customization for high performance
• Two-dimensional block partitionings for the parallel sparse Cholesky factorization
• Hypermatrix oriented supernode amalgamation
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers

Cites work

• scientific article; zbMATH DE number 1187163 (Why is no real title available?)
• scientific article; zbMATH DE number 2087095 (Why is no real title available?)
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• Hypermatrix solution of larg e sets of symmetric positive-definite linear equations
• On Finding Supernodes for Sparse Matrix Computations
• Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†
• The Role of Elimination Trees in Sparse Factorization
• The University of Florida sparse matrix collection
• The influence of relaxed supernode partitions on the multifrontal method

Cited in

(3)

• Sparse hypermatrix Cholesky: customization for high performance
• Analysis of the multiplicative Schwarz method for matrices with a special block structure
• Hypermatrix oriented supernode amalgamation

Describes a project that uses

Uses Software

• SPLASH-2
• SparseM
• IPM
• PCx
• LIPSOL
• SparseMatrix
• KORBX
• PERMAS
• SPARSEM
• ATLAS

This page was built for publication: Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking

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