The Finite Difference Based Fast Adaptive Composite Grid Method
convergenceelliptic boundary value problemsFAC methodfast adaptive composite grid methodfinite difference discretizationiterative methodnumerical examples
Boundary value problems for second-order elliptic equations (35J25) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
The fast adaptive composite grid method (the FAC method) which is studied in this paper is an iterative method for solving discrete problems resulting from finite difference discretizations on a composite grid. The approach here is to approximate the solution by means of several uniform grids with various meshsizes covering different parts of the domain. At least one grid should cover the entire domain. The meshsize of this global coarse grid is chosen in agreement with the smooth behaviour of the solution outside the high activity regions (i.e., the regions in which the solution varies much more rapidly than in the remaining part of the domain). In each iteration step of the FAC method a residual is computed on the composite grid, corrections are computed on the uniform subgrids and the composite grid approximation is corrected. In this way expensive computing, i.e., solving linear systems of equations, takes place on the uniform subgrids only. It is shown that the convergence behaviour of the FAC method depends mainly on the way in which the composite grid residuals are restricted on the interfaces between the uniform subgrids. An optimality criterion for the restriction operators is defined and it is shown that for a composite grid problem resulting from the uniform interface discretization (i.e., the grid points on the interfaces are treated as the grid points of the coarsest uniform grid adjacent to the interface), each restriction operator which equals the trivial injection on the interfaces satisfies this optimality criterion. It is also shown that for the composite problem resulting from non-uniform interface discretization one should not use trivial injection on the interface. The theoretical results are illustrated by two numerical examples.
- Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: Basic ideas
- The fast adaptive composite-grid method (FAC): Algorithms for advanced computers
- Adaptive integral method with fast Gaussian gridding for solving combined field integral equations
- A fast-adaptive composite grid algorithm for solving the free-space Poisson problem on the cell broadband engine
- scientific article; zbMATH DE number 3880039 (Why is no real title available?)
- The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
- scientific article; zbMATH DE number 4058784 (Why is no real title available?)
- scientific article; zbMATH DE number 27684 (Why is no real title available?)
- A comparison of FAC and PCG methods for solving composite grid problems
- Multilevel Adaptive Methods for Elliptic Eigenproblems: A Two-Level Convergence Theory
- scientific article; zbMATH DE number 1131683 (Why is no real title available?)
- Concept de zoom adaptatif en architecture multigrille locale ; étude comparative des méthodes L.D.C., F.A.C. et F.I.C.
- Experimental analysis of a Fast Adaptive Composite-based grid expansion scheme for open boundary problems.
- High order finite difference discretization for composite grid hierarchy and its applications
- Accurate solution-adaptive finite difference schemes for coarse and fine grids
This page was built for publication: The Finite Difference Based Fast Adaptive Composite Grid Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4220439)