On the construction of sufficient refinements for computation of topological degree (Q1148023): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5727924 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the topological degree of a mapping in \(R^n\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Research announcement an algorithm for numerical calculation of topical degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for numerical calculation of topological degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simplification of Stenger's topological degree formula / rank | |||
Normal rank | |||
Latest revision as of 10:10, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the construction of sufficient refinements for computation of topological degree |
scientific article |
Statements
On the construction of sufficient refinements for computation of topological degree (English)
0 references
1981
0 references
n-dimensional polyhedron
0 references
topological degree
0 references
algorithms
0 references
refinements of triangulations
0 references
