The ILU method for finite-element discretizations
accelerationeigenvalue problemincomplete LU decompositionslinear finite elementmultigrid algorithmsnumerical stabilityPoisson equationringwise numbering of grid pointsself-adaptive refinementsparse matricesvectorization
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Boundary value problems for second-order elliptic equations (35J25) Direct numerical methods for linear systems and matrix inversion (65F05) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
As a model problem the author studies the boundary value problem \(\Delta u=g\) in \(\Omega=(0,1)\times(0,1)\), \(u=0\) on \(\partial\Omega\). For finite- difference discretizations on rectangular grids the resulting sparse linear system has a structured pattern; the system can be solved iteratively by incomplete LU decompositions with sparse matrices \(L\) and \(U\) --- called ILU method. This method is transferred to linear systems arising from linear finite element discretizations over problem-oriented triangular grids (self- adaptive refinement). Strategies for acceleration and vectorization of the algorithm are developed (e.g. ringwise numbering of grid points, data structure for the non-zero coefficients, vectorization of uniform parts). It is shown how the numerical stability of the method is influenced by the topology of the grid. For a numerical test an eigenvalue problem of the form \(-\hbox{div}(h \hbox{grad} u)=\lambda u\) in \(\Omega\) (surface of the lake) \(u_ n=0\) on \(\partial\Omega\) (shore of the lake) is treated. It is solved by a multigrid algorithm using ILU iteration as a smoother.
- scientific article; zbMATH DE number 434795
- A finite element method for an ill-posed problem
- Discrete least-squares finite element methods
- scientific article; zbMATH DE number 978216
- DISCONTINUOUS/CONTINUOUS LEAST-SQUARES FINITE ELEMENT METHODS FOR ELLIPTIC PROBLEMS
- An approach to the discretization of ill-posed problems
- The discretization of ill-posed problems
- The finite element method for initial value problems: mathematics and computations
- An efficient discretization scheme for solving ill-posed problems
- Interval-based finite element methods
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- scientific article; zbMATH DE number 3938445 (Why is no real title available?)
- scientific article; zbMATH DE number 3621657 (Why is no real title available?)
- scientific article; zbMATH DE number 3633654 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Linear iterations as smoothers in multigrid methods: Theory with applications to incomplete decompositions
- On the Robustness of ILU Smoothing
- The effect of ordering on preconditioned conjugate gradients
- Theoretical and Practical Aspects of a Multigrid Method
This page was built for publication: The ILU method for finite-element discretizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177224)
