On computing INV block preconditionings for the conjugate gradient method (Q1088378): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inverses of Matrices $\{a_{ij}\}$ which Satisfy $a_{ij} = 0$ for $j > i+p$. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Boundary Value Problems Solved by Green's Matrix. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of preconditioned iterative methods for linear systems of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverses of banded matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Preconditioning for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank

Latest revision as of 18:41, 17 June 2024

scientific article
Language Label Description Also known as
English
On computing INV block preconditionings for the conjugate gradient method
scientific article

    Statements

    On computing INV block preconditionings for the conjugate gradient method (English)
    0 references
    0 references
    0 references
    1986
    0 references
    The INV(k) and MINV(k) block preconditionings for the conjugate gradient method require generation of selected elements of the inverses of symmetric matrices of bandwidth \(2k+1\). Generalizing the previously described \(k=1\) (tridiagonal) case to \(k=2\), explicit expressions for the inverse elements of a symmetric pentadiagonal matrix in terms of Green's matrix of rank two are given. The expressions are found to be seriously ill-conditioned; hence alternative computational algorithms for the inverse elements must be used. Behavior of the \(k=1\) and \(k=2\) preconditionings are compared for some discretized elliptic partial differential equation test problems in two dimensions.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    incomplete factorization
    0 references
    iterative methods
    0 references
    preconditionings
    0 references
    conjugate gradient method
    0 references
    Green's matrix
    0 references
    ill-conditioned
    0 references
    0 references
    0 references