Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions

DOI10.1023/A:1009917222929zbMath0958.65057OpenAlexW302645333MaRDI QIDQ1577439

Inmaculada F. García, Yaroslav D. Sergeyev, Leocadio G. Casado

Publication date: 28 March 2001

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009917222929

zbMATH Keywords

numerical resultsselectionbranch and bound algorithmsrejectioninterval algorithmzero crossing point

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05)

Related Items (2)

Univariate global optimization with multiextremal non-differentiable constraints without penalty functions ⋮ On first zero crossing points.

Uses Software

• INTOPT_90

This page was built for publication: Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions