Preconditioning of elliptic problems by approximation in the transform domain

DOI10.1007/BF02510358MaRDI QIDQ1378469zbMATH OpenOpenAlexFDO

Authors Michael Ng

Publication date 6 July 1998

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02510358, http://digitalcollections.anu.edu.au/handle/1885/40752

zbMATH Keywords

conjugate gradient methodfinite differencesfinite elementsnumerical resultspreconditionersecond-order elliptic boundary value problemssparse matrixtransform approximation

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Review text

The numerical solution of second-order elliptic boundary value problems is examined. Using finite differences or finite elements, such problems generally are reduced to linear systems of the form \(Ax=b\), where \(A\) is a symmetric and positive definite sparse matrix. The author views the matrix \(A\) as an image and constructs the transform based preconditioner by using the low frequency components of the transformed matrix. The smooth coefficients of the given elliptic operator can be approximated well by the low-rank matrix. Numerical results are reported to show the effectiveness of the methodology.

Recommendations

• scientific article; zbMATH DE number 179274
• scientific article; zbMATH DE number 871577
• Sine transform based preconditioners for elliptic problems
• Tensor-structured preconditioners and approximate inverse of elliptic operators in \(\mathbb R^{d}\)

Cites work

• A note on skewcirculant preconditioners for elliptic problems
• Block Preconditioning for the Conjugate Gradient Method
• Circulant block-factorization preconditioners for elliptic problems
• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• Finite element solution of boundary value problems. Theory and computation.
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 49594 (Why is no real title available?)
• scientific article; zbMATH DE number 2107175 (Why is no real title available?)
• Iterative Solution Methods and Preconditioners for Block-Tridiagonal Systems of Equations
• Optimal trigonometric preconditioners for elliptic and queueing problems
• Semicirculant Preconditioners for First-Order Partial Differential Equations
• Sine transform based preconditioners for elliptic problems
• Sine transform based preconditioners for symmetric Toeplitz systems

Cited in

(5)

• On generalized successive overrelaxation methods for augmented linear systems
• A reciprocal preconditioner for structured matrices arising from elliptic problems with jumping coefficients
• Sine transform based preconditioners for elliptic problems
• Finite element matrix sequences: the case of rectangular domains
• On parameterized inexact Uzawa methods for generalized saddle point problems

This page was built for publication: Preconditioning of elliptic problems by approximation in the transform domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378469)