An approach to reducing the computational cost of constructing curvilinear grids
type: Item
instance of: scholarly article
title: An approach to reducing the computational cost of constructing curvilinear grids
zbMATH Open document ID: 0951.65094
author: A. A. Charakhch'yan
published in: Computational Mathematics and Mathematical Physics
publication date: 2000-07-03T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65M50
Mathematics Subject Classification ID: 65M06
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 35R35
zbMATH DE Number: 1467884
zbMATH Keywords: curvilinear grid generation
zbMATH Keywords: computational cost
zbMATH Keywords: moving boundary problems
zbMATH Keywords: finite difference
reviewed by: A. Tret'yakov
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1467884