Symbolic local refinement of tetrahedral grids (Q1333158)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Symbolic local refinement of tetrahedral grids |
scientific article; zbMATH DE number 638314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symbolic local refinement of tetrahedral grids |
scientific article; zbMATH DE number 638314 |
Statements
Symbolic local refinement of tetrahedral grids (English)
0 references
2 May 1995
0 references
The paper shows how a usual efficient simplicial refinement method (Maubach's algorithm) can be made even more efficient replacing numerical computations by symbolic computations. A prototype written in the Mathematica programming language is used to test the algorithms.
0 references
symbolic local refinement
0 references
tetrahedral grids
0 references
Maubach's algorithm
0 references
simplicial refinement method
0 references
symbolic computations
0 references
Mathematica programming language
0 references