Conditioning analysis of modified block incomplete factorizations
Linear Algebra and its ApplicationsPublished 1 August 1991
Yvan Notay
Citations24
SJR quartileQ1
SJR score0.98
SNIP1.40
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We improve the conditioning analysis of modified block incomplete factorizations of Stieltjes matrices. Letting N denote the number of diagonal blocks, our results show that the spectral condition number is bounded by N for a large class of two dimensional PDEs.
Keywords
Computer ScienceMathematicsEngineering
SIAM Journal on Scientific and Statistical ComputingBlock Preconditioning for the Conjugate Gradient Method
363 Citations1985Paul Concus, Gene H. Golub +1 more
Numerical experiments on test problems for two dimensions indicate that a particularly attractive preconditioning, which uses special properties of tridiagonal matrix inverses, can be computationally more efficient for the same computer storage than other preconditionsings, including the popular point incomplete Cholesky factorization.
Medical Entomology and ZoologyParallel algorithms and matrix computation
127 Citations1988J.J. Modi
Part 1 Fundamentals of parallel computation: general principles of parallel computing parallel techniques and algorithms parallel sorting algorithms and future trends in algorithm development.
Parallel ComputingParallel S.O.R. iterative methods
79 Citations1984D. J. Evans
New explicit group S.O.R.G.O.'s methods suitable for use on an asynchronous MIMD computer are presented for the numerical solution of the sparse linear systems derived from the discretization of two-dimensional, second-order, elliptic boundary value problems.
Linear Algebra and its ApplicationsA general incomplete block-matrix factorization method
73 Citations1986Owe Axelsson
The method generalizes previous methods for pointwise incomplete factorization as well as a method for tridiagonal block matrices and presents a new and more general result on the existence of so-called modified incomplete factorizations which satisfy a generalized rowsum criterion.
Linear Algebra and its ApplicationsOn approximate factorization methods for block matrices suitable for vector and parallel processors
71 Citations1986Owe Axelsson, Ben Polman
Some existence results for methods based on the approximate factorization of block matrices are proven and a recently proposed inverse free factorization method is discussed.
SIAM Journal on Scientific and Statistical ComputingA Block Ordering Method for Sparse Matrices
51 Citations1990James P. O’Neil, Daniel B. Szyld
A method is presented based on combinatorial considerations which permutes the rows and columns of a general matrix in such a way that relatively dense blocks of various sizes appear along the diagonal.
Theory and Computation
47 Citations2019Abdelkrim Araar, Paolo Verme
This chapter treats the various computation methods offered by the literature to estimate the alternative measures of well-being outlined in Chap.
Linear Algebra and its ApplicationsUpper eigenvalue bounds for pencils of matrices
41 Citations1984Robert Beauwens
Journal of Computational and Applied MathematicsConditioning analysis of positive definite matrices by approximate factorizations
28 Citations1989Robert Beauwens, Renaud Wilmet
Lecture notes in mathematicsSolving positive (semi)definite linear systems by preconditioned iterative methods
28 Citations1990Yvan Notay
This work first reviews the extension of the general theory of polynomial acceleration to the case of singular preconditionings, and emphasizes that all results can be formulated in such a way that they cover both the regular and singular cases.
SIAM Journal on Numerical AnalysisOn Sparse Block Factorization Iterative Methods
26 Citations1987Robert Beauwens, Mustapha Ben Bouzid
A synthetic formalism is proposed for the description of sparse block factorization iterative methods that is used to develop existence, convergence and comparison theorems and to compare block factorized schemes against point factorization schemes.
SIAM Journal on Numerical AnalysisExistence and Conditioning Properties of Sparse Approximate Block Factorizations
22 Citations1988Robert Beauwens, Mustapha Ben Bouzid
BIT Numerical MathematicsIncomplete factorizations of singular linear systems
18 Citations1989Yvan Notay
Linear Algebra and its ApplicationsOn the conditioning analysis of block approximate factorization methods
17 Citations1991Monga-Made Magolu, Yvan Notay
Apply to discrete elliptic PDEs, the results show that an O ( h −1 ) spectral bound can be achieved for a large class of problems.
Applied Numerical MathematicsConditioning analysis of sparse block approximate factorizations
10 Citations1991Monga-Made Magolu
The conditioning analysis of sparse approximate block factorizations of Stieltjes matrices developed by Beauwens and Ben Bouzid in [10] is generalized here on the basis of recent improvements of the point factorization analysis.