Consistent sparse factorization (Q1205913): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:32, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Consistent sparse factorization |
scientific article |
Statements
Consistent sparse factorization (English)
0 references
1 April 1993
0 references
A preconditioned conjugate gradient method (PCG) for solving \(Au=f\) is considered for which the preconditioner \(B\) is a sparse factorization of local accuracy \(O(h^ 2)\). It is therefore called consistent with typical five-point-difference or nine-point finite element discretizations on a rectangular grid. \(B\) captures the low-mode behaviour of \(A\), higher mode error components are damped efficiently by CG. As numerical example Poisson's equation with smooth and oscillatory true solutions are considered. For problems with smooth solutions the combination of the consistent sparse factorization (CSF) with Jacobi iteration only shows marginal improvement over pure CSF iteration, whereas compound iteration is to be preferred for problems with high mode solution components. CSF is not compared with other PCG methods.
0 references
preconditioned conjugate gradient method
0 references
five-point-difference
0 references
nine- point finite element
0 references
numerical example
0 references
Poisson's equation
0 references
smooth solutions
0 references
consistent sparse factorization
0 references
Jacobi iteration
0 references