A parallel algorithm for optimal grid generation
zbMATH Open0973.65115MaRDI QIDQ2729338FDOQ2729338
A. F. Khajrullin, O. B. Khajrullina, N. A. Artemova
Publication date: 22 July 2001
Published in: Vychislitel'nye Tekhnologii (Search for Journal in Brave)
Full work available at URL: http://www-sbras.nsc.ru/win/mathpub/comp-tech/eng
Recommendations
- Automatic parallel generation of tetrahedral grids by using a domain decomposition approach
- Parallel grid generation/optimization using block-domain decomposition
- A parallel advancing front grid generation scheme
- Three‐dimensional parallel unstructured grid generation
- Generic parallel adaptive-grid Navier-Stokes algorithm
iterative algorithmparallelizationoptimal algorithmgrid generationtwo-dimensional block regular grid
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cited In (11)
- A Greedy Strategy for Coarse-Grid Selection
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimised grid-partitioning for block structured grids in parallel computation
- Title not available (Why is that?)
- A practical guide to direct optimization for planar grid-generation
- On the generation of bipartite grids in 2 and 3 dimensional regions
- On Nonconservative Algorithms for Grid Interfaces
- A scheme for generating unstructured grids on spheres with application to parallel computation
- Computational Science – ICCS 2005
- A generalized length strategy for direct optimization in planar grid generation
This page was built for publication: A parallel algorithm for optimal grid generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729338)
