Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
DOI10.1007/S00200-007-0039-8zbMATH Open1122.65031DBLPjournals/aaecc/HerreroN07OpenAlexW2074431240WikidataQ61736220 ScholiaQ61736220MaRDI QIDQ2642898FDOQ2642898
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
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
performancelinear programminginterior point methodsnumerical examplessparse matrixfinite element methodssparse Cholesky factorization2D partitioninghypermatrix structuresmall matrix librarywindows in submatrices
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- The University of Florida sparse matrix collection
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- On Finding Supernodes for Sparse Matrix Computations
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- The Role of Elimination Trees in Sparse Factorization
- The influence of relaxed supernode partitions on the multifrontal method
- Title not available (Why is that?)
- Hypermatrix solution of larg e sets of symmetric positive-definite linear equations
- Title not available (Why is that?)
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
Cited In (3)
Uses Software
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)
