Computational complexity of the fast adaptive composite grid (FAC) method
Boundary value problems for nonlinear higher-order PDEs (35G30) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Analysis of algorithms and problem complexity (68Q25)
First one describes the fast adaptive composite grid method and then later, one discusses the decision-making process of refining the coarse grid method. The computational complexity is estimated, and it is shown that FAC retains its optimal complexity, even when the cost of the adaptive algorithm is taken into account.
- scientific article; zbMATH DE number 4058784 (Why is no real title available?)
- scientific article; zbMATH DE number 4078694 (Why is no real title available?)
- Local adaptive mesh refinement for shock hydrodynamics
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
- The fast adaptive composite-grid method (FAC): Algorithms for advanced computers
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Immersed boundary model of aortic heart valve dynamics with physiological driving and loading conditions
- scientific article; zbMATH DE number 3880039 (Why is no real title available?)
- scientific article; zbMATH DE number 27684 (Why is no real title available?)
- Multilevel Adaptive Methods for Elliptic Eigenproblems: A Two-Level Convergence Theory
This page was built for publication: Computational complexity of the fast adaptive composite grid (FAC) method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911724)