Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms (Q2975426)
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 6704702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms |
scientific article; zbMATH DE number 6704702 |
Statements
Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms (English)
0 references
11 April 2017
0 references
global optimization
0 references
quadratic upper function
0 references
quadratic lower function
0 references
root-finding
0 references
bound and reduce branch
0 references
bound w-subdivision
0 references
0.8945626020431519
0 references
0.784739077091217
0 references
0.7837573885917664
0 references
