Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions (Q1577439): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1009917222929 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W302645333 / rank | |||
Normal rank | |||
Latest revision as of 11:51, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions |
scientific article |
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
