Computational complexity of the fast adaptive composite grid (FAC) method
type: Item
instance of: scholarly article
title: Computational complexity of the fast adaptive composite grid (FAC) method
zbMATH Open document ID: 0697.65076
DOI: 10.1016/0168-9274(90)90023-9
author: Steven M. McKay
author: S. F. McCormick
author: James W. Thomas
published in: Applied Numerical Mathematics
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65N22
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 35G30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4143387
zbMATH Keywords: fast adaptive composite grid method
zbMATH Keywords: coarse grid method
zbMATH Keywords: computational complexity
zbMATH Keywords: adaptive algorithm
reviewed by: Guy Jumarie
MaRDI profile type: Publication
full work available at URL: 0168-9274(90)90023-9
OpenAlex ID: W1994747981
cites work: Local adaptive mesh refinement for shock hydrodynamics
cites work: Multi-Level Adaptive Solutions to Boundary-Value Problems
cites work: Q3809173
cites work: Q3793661
cites work: The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
description: scientific article; zbMATH DE number 4143387