Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions (Q1577439)
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 1501474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions |
scientific article; zbMATH DE number 1501474 |
Statements
Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions (English)
0 references
28 March 2001
0 references
The authors modify a traditional interval algorithm for solving the zero crossing points problem for one-dimensional functions subject to bound constraints by using new rejection and selection techniques. Numerous numerical results are presented.
0 references
branch and bound algorithms
0 references
zero crossing point
0 references
interval algorithm
0 references
rejection
0 references
selection
0 references
numerical results
0 references
0.8721455335617065
0 references
0.7445412874221802
0 references
