On first zero crossing points.
From MaRDI portal
Recommendations
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
- scientific article; zbMATH DE number 4078655
- Some efficient methods for enclosing simple zeros of nonlinear equations
- On bounding zeros of analytic functions
- scientific article; zbMATH DE number 804624
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 488523 (Why is no real title available?)
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
- Interval mathematics, algebraic equations and optimization
- Introduction to Numerical Analysis
- On interval enclosures using slope arithmetic
- Rigorous global search: continuous problems
- Rigorous sensitivity analysis for parameter-dependent systems of equations
- Robust and efficient ray intersection of implicit surfaces
Cited in
(2)
This page was built for publication: On first zero crossing points.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427655)
