Generating computational grids using implicit functions

MaRDI QIDQ1802578zbMATH OpenFDO

Authors V. S. Sakovich

Publication date 6 September 1993

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

grid generationimplicit functionparallel computersVectorization

Mathematics Subject Classification ID

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

Review text

A method of grid construction for domains with boundary described by a differential implicit function \(F(x,y,z) = 0\) is considered. The mesh of nodes consists of surfaces \(F(x,y,z) = a_ i\), \(i = 1,2,\dots,n\), and orthogonal paths (i.e. parallel to \(\text{grad }F\)). The method is developed for the union and intersection of such domains. More complicated domains may be approximated by implicit differential functions, using an algorithm suggested by the author. Vectorization of the grid construction algorithm is its significant advantage for an application to parallel computers. Some time estimations for VAX-750 computers are mentioned.

Recommendations

• A hybrid differential‐algebraic method for three‐dimensional grid generation
• scientific article; zbMATH DE number 1979569
• A new algorithm for generating tetrahedral grids
• Generation of 3D grids by approximate factorization
• scientific article; zbMATH DE number 1131688

This page was built for publication: Generating computational grids using implicit functions

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