Complex root finding algorithm based on Delaunay triangulation (Q2828142)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complex root finding algorithm based on Delaunay triangulation |
scientific article; zbMATH DE number 6642861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complex root finding algorithm based on Delaunay triangulation |
scientific article; zbMATH DE number 6642861 |
Statements
24 October 2016
0 references
complex root finding
0 references
Delaunay triangulation
0 references
global algorithm
0 references
Complex root finding algorithm based on Delaunay triangulation (English)
0 references
0.8279110789299011
0 references
0.7847726345062256
0 references
0.7813029885292053
0 references
0.7636688351631165
0 references
