Fast and Efficient Parallel Solution of Sparse Linear Systems
From MaRDI portal
Recommendations
Cited in
(41)- Parallel, iterative solution of sparse linear systems: Models and architectures
- Efficient solutions of hierarchical systems of linear equations
- Parallel nested dissection for path algebra computations
- Efficient approximate solution of sparse linear systems
- A faster algorithm for solving linear algebraic equations on the star graph.
- Efficient VLSI implementation of iterative solutions to sparse linear systems
- Parallel solution of arbitrarily sparse linear systems
- Fast and efficient solution of path algebra problems
- Parallel computation of a Krylov matrix for a sparse and structured input
- A parallel implementation of the CMRH method for dense linear systems
- Maximum matchings in planar graphs via Gaussian elimination
- Additive preconditioning and aggregation in matrix computations
- Efficient parallel factorization and solution of structured and unstructured linear systems
- A linear work, \(O(n^{1/6})\) time, parallel algorithm for solving planar Laplacians
- scientific article; zbMATH DE number 2127775 (Why is no real title available?)
- scientific article; zbMATH DE number 3862321 (Why is no real title available?)
- scientific article; zbMATH DE number 3874479 (Why is no real title available?)
- On the Complexity of Sparse Gaussian Elimination via Bordering
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- scientific article; zbMATH DE number 3967813 (Why is no real title available?)
- scientific article; zbMATH DE number 4030966 (Why is no real title available?)
- Pairwise reduction for the direct, parallel solution of sparse, unsymmetric sets of linear equations
- scientific article; zbMATH DE number 4076453 (Why is no real title available?)
- scientific article; zbMATH DE number 1302610 (Why is no real title available?)
- scientific article; zbMATH DE number 1121981 (Why is no real title available?)
- scientific article; zbMATH DE number 1163749 (Why is no real title available?)
- scientific article; zbMATH DE number 2051077 (Why is no real title available?)
- An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems
- Transformations of matrix structures work again
- scientific article; zbMATH DE number 4001308 (Why is no real title available?)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- Processor Efficient Parallel Solution of Linear Systems of Equations
- Cache Optimized Solution for Sparse Linear System over Large Order Finite Field
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
- Matrix sparsification and nested dissection over arbitrary fields
- Parallel frontal solvers for large sparse linear systems
- Minimum Cuts in Surface Graphs
- Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
- Parallel nested dissection
- Parallelism and fast solution of linear systems
- Randomized preprocessing of homogeneous linear systems of equations
This page was built for publication: Fast and Efficient Parallel Solution of Sparse Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277539)
