Efficiently Computing Many Roots of a Function
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1984134
- scientific article; zbMATH DE number 1086546
- Algorithm 987: MANBIS -- a C++ mathematical software package for locating and computing efficiently many roots of a function: theoretical issues
- scientific article; zbMATH DE number 903755
- Locating and Computing All the Simple Roots and Extrema of a Function
Cited in
(12)- The Bisection Method: Which Root?
- Application of collocation method in finding roots
- scientific article; zbMATH DE number 903755 (Why is no real title available?)
- Coupled bisection for root ordering
- Robust crossings detection in noisy signals using topological signal processing
- Approximating \(x^ n\) efficiently
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
- Locating and Computing All the Simple Roots and Extrema of a Function
- scientific article; zbMATH DE number 1086546 (Why is no real title available?)
- scientific article; zbMATH DE number 1984134 (Why is no real title available?)
- Global root bracketing method with adaptive mesh refinement
- Algorithm 987: MANBIS -- a C++ mathematical software package for locating and computing efficiently many roots of a function: theoretical issues
This page was built for publication: Efficiently Computing Many Roots of a Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693188)