Pages that link to "Item:Q4316313"
From MaRDI portal
The following pages link to An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization (Q4316313):
Displaying 17 items.
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity (Q92247) (← links)
- IPM based sparse LP solver on a heterogeneous processor (Q373202) (← links)
- Hypermatrix oriented supernode amalgamation (Q1009360) (← links)
- Block-Cholesky for parallel processing (Q1188310) (← links)
- Parallel sparse Cholesky factorization on a shared memory multiprocessor (Q1201013) (← links)
- Communication results for parallel sparse Cholesky factorization on a hypercube (Q1263230) (← links)
- Two-dimensional block partitionings for the parallel sparse Cholesky factorization (Q1385158) (← links)
- Sparse matrix tools for Gaussian models on lattices (Q1389604) (← links)
- Efficient implementation of a generalized Cholesky factorization for symmetric Galerkin boundary element methods (Q1419920) (← links)
- Financial planning via multi-stage stochastic optimization. (Q1422378) (← links)
- Near optimal Cholesky factorization on orthogonal multiprocessors. (Q1853099) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- Parallel Algorithms for Sparse Linear Systems (Q3981404) (← links)
- A Mapping Algorithm for Parallel Sparse Cholesky Factorization (Q4271106) (← links)
- Data-Parallel Sparse Factorization (Q4389260) (← links)
- Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer (Q4842591) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)