A Block Ordering Method for Sparse Matrices

DOI10.1137/0911048MaRDI QIDQ3486733zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

convergencepartitioningblock iterative methodslarge sparse linear systemblock orderingPABLO algorithm

Mathematics Subject Classification ID

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)

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

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
• scientific article; zbMATH DE number 5885642 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1442000 (Why is no real title available?)
• scientific article; zbMATH DE number 1226277 (Why is no real title available?)
• Ordering algorithms for irreducible sparse linear systems
• An algebraic multilevel parallelizable preconditioner for large-scale CFD problems
• A block compression algorithm for computing preconditioners
• Computing the block triangular form of a sparse matrix
• 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

Describes a project that uses

Uses Software

• NSPCG

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)