An approach to reducing the computational cost of constructing curvilinear grids
Free boundary problems for PDEs (35R35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
The author suggests a modification of a well-known method, which occupies a special place among the methods for constructing regular grids in domains with curvilinear boundaries. This method guarantees that, for given coordinates of the boundary nodes, all quadrangular cells of the grid are convex at each iteration step. It considerably reduces the computational cost of constructing grids with a large number of nodes for moving boundary problems.
- scientific article; zbMATH DE number 766275
- An elliptic grid generator based on quasi-one-dimensional grids
- scientific article; zbMATH DE number 1285535
- A new approach to grid generation
- Method of constructing block regular optimal grids in two-dimensional multiply connected domains of complex geometries
This page was built for publication: An approach to reducing the computational cost of constructing curvilinear grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569355)
