Symbolic local refinement of tetrahedral grids
type: Item
instance of: scholarly article
title: Symbolic local refinement of tetrahedral grids
zbMATH Open document ID: 0811.65107
author: D. J. Hebert
published in: Journal of Symbolic Computation
publication date: 1995-05-02T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 638314
zbMATH Keywords: symbolic local refinement
zbMATH Keywords: tetrahedral grids
zbMATH Keywords: Maubach's algorithm
zbMATH Keywords: simplicial refinement method
zbMATH Keywords: symbolic computations
zbMATH Keywords: Mathematica programming language
reviewed by: Vladimir L. Makarov
describes a project that uses: Mathematica
MaRDI profile type: Publication
full work available at URL: jsco.1994.1029
OpenAlex ID: W2004031624
DOI: 10.1006/JSCO.1994.1029
description: scientific article; zbMATH DE number 638314