On the construction of sufficient refinements for computation of topological degree
type: Item
instance of: scholarly article
title: On the construction of sufficient refinements for computation of topological degree
zbMATH Open document ID: 0451.55001
DOI: 10.1007/BF01400322
author: Martin Stynes
published in: Numerische Mathematik
publication date: 1981-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/132744
Mathematics Subject Classification ID: 55-04
Mathematics Subject Classification ID: 55M25
Mathematics Subject Classification ID: 65D99
Mathematics Subject Classification ID: 65H10
zbMATH DE Number: 3705507
zbMATH Keywords: n-dimensional polyhedron
zbMATH Keywords: topological degree
zbMATH Keywords: algorithms
zbMATH Keywords: refinements of triangulations
MaRDI profile type: Publication
cites work: Q5727924
cites work: A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
cites work: Computing the topological degree of a mapping in \(R^n\)
cites work: Research announcement an algorithm for numerical calculation of topical degree
cites work: An algorithm for numerical calculation of topological degree
cites work: A simplification of Stenger's topological degree formula
description: scientific article; zbMATH DE number 3705507