Computational complexity of the fast adaptive composite grid (FAC) method

DOI10.1016/0168-9274(90)90023-9zbMath0697.65076OpenAlexW1994747981MaRDI QIDQ911724

Steven M. McKay, Stephen F. McCormick, James W. Thomas

Publication date: 1990

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(90)90023-9

zbMATH Keywords

computational complexityadaptive algorithmfast adaptive composite grid methodcoarse grid method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boundary value problems for nonlinear higher-order PDEs (35G30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (2)

Immersed boundary model of aortic heart valve dynamics with physiological driving and loading conditions ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations

Cites Work

• Unnamed Item
• Unnamed Item
• Local adaptive mesh refinement for shock hydrodynamics
• The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
• Multi-Level Adaptive Solutions to Boundary-Value Problems

This page was built for publication: Computational complexity of the fast adaptive composite grid (FAC) method