Complexity of a root clustering algorithm for holomorphic functions (Q6496875)
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 7842522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of a root clustering algorithm for holomorphic functions |
scientific article; zbMATH DE number 7842522 |
Statements
Complexity of a root clustering algorithm for holomorphic functions (English)
0 references
6 May 2024
0 references
holomorphic functions
0 references
root clustering
0 references
approximating roots
0 references
continuous amortization
0 references
subdivision algorithms
0 references
de Branges's theorem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8289251923561096
0 references
0.7816460132598877
0 references
0.7739623188972473
0 references
0.7656428813934326
0 references
0.7596458792686462
0 references
