An iterated tangential filtering decomposition
The authors consider solving large linear algebraic systems with symmetric and positive definite matrices and a tridiagonal block structure arising from the discretization of elliptic partial differential equations on structured meshes mainly in the tridimensional space. The described techniques can be extended to nonsymmetric case. The topic of this paper consists on construction of a block LDL\(^{\text{T}}\) preconditioner having the same block LDL\(^{\text{T}}\) structure as the original system. Various tangential filtering techniques are discussed in the first part of the paper. The preconditioners are used in the preconditioned conjugate gradient algorithm (PCG) combined with the preconditioned Richardson method. The amount of memory needed by the preconditioner in a factorized form is smaller than that needed by the original matrix. A C++ implementation is outlined. The paper contains wide numerical tests. Elliptic partial differential equations in a given domain in \(\mathbb R^3\) are discretized on uniform, non-uniform and very anisotropic grids. Highly heterogeneous media are, moreover, considered. The PCG method is used and the results are compared for various input data.
- A twisted block tangential filtering decomposition preconditioner
- Block filtering decomposition.
- Optimized Schwarz methods with nonoverlapping circular domain decomposition
- Low frequency tangential filtering decomposition
- AN INCOMPLETE LU PRECONDITIONER FOR PROBLEMS IN ACOUSTICS
- Iterated frequency filtering preconditioners
- Two sides tangential filtering decomposition
- Fourier analysis of frequency filtering decomposition preconditioners
- Modified tangential frequency filtering decomposition and its Fourier analysis
- Dimension filtration on loops.
This page was built for publication: An iterated tangential filtering decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317896)