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 the normal view instead:
scientific article; zbMATH DE number 638314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8284463286399841
0 references
0.8014715313911438
0 references
0.7927573323249817
0 references
0.785663366317749
0 references
0.7745442986488342
0 references
