A Block Ordering Method for Sparse Matrices
From MaRDI portal
Publication:3486733
DOI10.1137/0911048zbMath0706.65021OpenAlexW2013226093WikidataQ115156488 ScholiaQ115156488MaRDI QIDQ3486733
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
convergencepartitioninglarge sparse linear systemblock iterative methodsblock orderingPABLO algorithm
Computational methods for sparse matrices (65F50) Searching and sorting (68P10) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10)
Related Items
A Block Compression Algorithm for Computing Preconditioners, Parallelizable block diagonal preconditioners for the compressible Navier-Stokes equations, An algebraic multilevel parallelizable preconditioner for large-scale CFD problems, Unnamed Item, Conditioning analysis of modified block incomplete factorizations, 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, Adaptive algebraic smoothers, Optimal block-tridiagonalization of matrices for coherent charge transport, Preconditioning techniques for large linear systems: A survey
Uses Software
