Full-FAS multigrid grid generation algorithms

DOI10.1016/S0168-9274(99)00064-1MaRDI QIDQ1975668zbMATH OpenFDO

Authors Rosa Maria Spitaleri

Publication date 27 April 2000

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

Full work available at URL https://doi.org/10.1016/S0168-9274(99)00064-1

zbMATH Keywords

curvilinear coordinate systemsdouble ellipsoid problemelliptic grid generationfull approximation storage algorithmsfull-FAS multigrid grid generation algorithmsnested iteration technique

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Review text

This paper deals with the aim of coupling multigrid generation of boundary-fitted grids with an effective full multigrid technique. The author presents a full-FAS multigrid algorithm for the generation of curvilinear coordinate systems on physical domains. He adopts standard central differences for the approximation of the nonlinear generating 2D and 3D systems, full approximation storage (FAS) algorithms to solve the resulting discrete equations and full multigrid computation to obtain a better initial guess for the already developed multigrid algorithms. The elliptic grid generation models, the multigrid computation and the full multigrid algorithm, based on the nested iteration technique are introduced. As a test, the double ellipsoid problem is considered to generate C-type grids for external flow investigations.

Recommendations

• Multiblock multigrid grid generation algorithms: Overcoming multigrid anisotropy
• Computational and visual advances in multigrid grid generation
• scientific article; zbMATH DE number 27646
• scientific article; zbMATH DE number 3958638
• Fully Adaptive Multigrid Methods
• Generation, optimization, and adaption of multiblock structured grids for complex configurations
• scientific article; zbMATH DE number 1015022
• scientific article; zbMATH DE number 1217677
• scientific article; zbMATH DE number 3965388

Cited in

(15)

• Computational and visual advances in multigrid grid generation
• Multiblock multigrid grid generation algorithms: Overcoming multigrid anisotropy
• A scientific computing environment for differential field simulation
• An algebraic-elliptic algorithm for boundary orthogonal grid generation
• A class of network optimization methods for planar grid generation
• Application of a single-equation MG-FAS solver to elliptic grid generation equations (subgrid and supergrid coefficient generation)
• The heat equation to generate planar grids
• A linearly constrained optimization problem for planar grid generation
• A fully implicit, nonlinear adaptive grid strategy
• Optimum application of the multigrid method in generating body‐fitted co‐ordinates
• Multilevel First-Order System Least Squares for Elliptic Grid Generation
• Convergence analysis of the fast subspace descent method for convex optimization problems
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• Multigrid applications to three-dimensional elliptic coordinate generation
• A multigrid method for grid generation with line-spacing control

This page was built for publication: Full-FAS multigrid grid generation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975668)