Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
DOI10.1007/s00200-007-0039-8zbMath1122.65031OpenAlexW2074431240WikidataQ61736220 ScholiaQ61736220MaRDI QIDQ2642898
Juan J. Navarro, José R. Herrero
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
performancelinear programmingnumerical examplesfinite element methodssparse matrixsparse Cholesky factorizationinterior point methods2D partitioninghypermatrix structuresmall matrix librarywindows in submatrices
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hypermatrix solution of larg e sets of symmetric positive-definite linear equations
- The university of Florida sparse matrix collection
- The Role of Elimination Trees in Sparse Factorization
- On Finding Supernodes for Sparse Matrix Computations
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- 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
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
This page was built for publication: Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
