Consistent sparse factorization
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.
- A Factorization Procedure for the Solution of Multidimensional Elliptic Partial Differential Equations
- A Symmetric Factorization Procedure for the Solution of Elliptic Boundary Value Problems
- An extrapolation procedure for solving linear systems
- An implicit, numerical method for solving two-dimensional time-dependent diffusion problems
- Consistent sparse factorization of elliptic difference equations
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 3763154 (Why is no real title available?)
- Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
- Solution algorithms for nonlinear transient heat conduction analysis employing element-by-element iterative strategies
This page was built for publication: Consistent sparse factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205913)