Full-FAS multigrid grid generation algorithms
From MaRDI portal
Publication:1975668
DOI10.1016/S0168-9274(99)00064-1zbMath0973.65114MaRDI QIDQ1975668
Publication date: 27 April 2000
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
elliptic grid generationcurvilinear coordinate systemsdouble ellipsoid problemfull approximation storage algorithmsfull-FAS multigrid grid generation algorithmsnested iteration technique
Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (8)
A scientific computing environment for differential field simulation ⋮ Convergence analysis of the Fast Subspace Descent method for convex optimization problems ⋮ Efficient mesh optimization schemes based on optimal Delaunay triangulations ⋮ The heat equation to generate planar grids ⋮ An algebraic-elliptic algorithm for boundary orthogonal grid generation ⋮ A class of network optimization methods for planar grid generation ⋮ A linearly constrained optimization problem for planar grid generation ⋮ A fully implicit, nonlinear adaptive grid strategy
This page was built for publication: Full-FAS multigrid grid generation algorithms
