scientific article; zbMATH DE number 1163095
zbMATH Open0896.65026MaRDI QIDQ4394583FDOQ4394583
Authors: Anshul Gupta, George Karypis, Vipin Kumar 
Publication date: 6 October 1998
Title of this publication is not available (Why is that?)
Recommendations
performanceCholesky factorizationscalabilitydirect methodsgraph partitioningparallel computationgeometric partitioninglarge sparse linear systemsmultifrontal methodspectral partitioningisoefficiencyfill-in reducing orderings
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)
Cited In (17)
- The scalability of parallel computers for sparse QR factorisation
- Optimal parallel randomized algorithms for sparse addition and identification
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
- Parallel sparse matrix multiplication for linear scaling electronic structure calculations
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
- Towards an accurate performance modeling of parallel sparse factorization
- Large-Scale Scientific Computing
- Title not available (Why is that?)
- A shared- and distributed-memory parallel general sparse direct solver
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient GPU-parallel coordinate descent algorithm for sparse precision matrix estimation via scaled Lasso
- Title not available (Why is that?)
- Parallel, iterative solution of sparse linear systems: Models and architectures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394583)
