Analytical bounds for block approximate factorization methods (Q1208299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 166246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analytical bounds for block approximate factorization methods |
scientific article; zbMATH DE number 166246 |
Statements
Analytical bounds for block approximate factorization methods (English)
0 references
16 May 1993
0 references
The author derives simple analytical upper bounds on the spectral condition number associated with the preconditioning of large sparse linear systems by the so-called modified block incomplete factorizations. By the application of graph notions to block matrices, he succeeds to get the upper bounds for the preconditioning in the case of a Stieltjes matrix. The results prove to handle a large class of discretization of second-order elliptic partial differential equations with mixed boundary conditions, and support that sparse approximate block-matrix factorizations provide powerful preconditioners.
0 references
upper bonds
0 references
spectral condition number
0 references
preconditioning
0 references
large sparse linear systems
0 references
modified block incomplete factorizations
0 references
Stieltjes matrix
0 references
second-order elliptic partial differential equations
0 references
block- matrix factorizations
0 references
0 references
0 references
0.868716835975647
0 references
0.8396696448326111
0 references
0.8357826471328735
0 references
0.8271737098693848
0 references
