A Block Ordering Method for Sparse Matrices
DOI10.1137/0911048zbMATH Open0706.65021OpenAlexW2013226093WikidataQ115156488 ScholiaQ115156488MaRDI QIDQ3486733FDOQ3486733
Authors: James O'Neil, Daniel B. Szyld 
Publication date: 1990
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0911048
Recommendations
- Extensions of Certain Graph-based Algorithms for Preconditioning
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Direct methods for solving large sparse systems of equations based on the two by two block decomposition of the matrix
- Scalable iterative solution of sparse linear systems
- The effect of block red-black ordering on block ILU preconditioner for sparse matrices
convergencepartitioningblock iterative methodslarge sparse linear systemblock orderingPABLO algorithm
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Searching and sorting (68P10) Iterative numerical methods for linear systems (65F10) Enumeration in graph theory (05C30)
Cited In (20)
- Preconditioning techniques for large linear systems: A survey
- Direct methods for solving large sparse systems of equations based on the two by two block decomposition of the matrix
- Title not available (Why is that?)
- Parallelizable block diagonal preconditioners for the compressible Navier-Stokes equations
- On the ordering of sparse linear systems
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ordering algorithms for irreducible sparse linear systems
- An algebraic multilevel parallelizable preconditioner for large-scale CFD problems
- Computing the block triangular form of a sparse matrix
- A block compression algorithm for computing preconditioners
- Adaptive algebraic smoothers
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
- A class of asynchronous multisplitting two-stage iterations for large sparse block systems of weakly nonlinear equations
- Optimal block-tridiagonalization of matrices for coherent charge transport
- Conditioning analysis of modified block incomplete factorizations
- Extensions of Certain Graph-based Algorithms for Preconditioning
Uses Software
This page was built for publication: A Block Ordering Method for Sparse Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3486733)
