A `marching simplex' algorithm for approximate solution of nonlinear systems of equations and applications to branching of solutions and intersection problems (Q3595670)
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 5183617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A `marching simplex' algorithm for approximate solution of nonlinear systems of equations and applications to branching of solutions and intersection problems |
scientific article; zbMATH DE number 5183617 |
Statements
28 August 2007
0 references
system of nonlinear equations
0 references
marching-simplex method
0 references
algorithm
0 references
visualization
0 references
curves
0 references
surfaces
0 references
stability
0 references
efficiency
0 references
Lagrange interpolation
0 references
linear convex computations
0 references
dyadic grid-refinement
0 references
adaptive local depth of refinement
0 references
0.7870526313781738
0 references
0.7767804265022278
0 references
0.7603751420974731
0 references
0.7517856955528259
0 references
