Locating and Computing All the Simple Roots and Extrema of a Function
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1131781
- On the complexity of isolating real roots and computing with certainty the topological degree
- Locating and computing in parallel all the simple roots of special functions using PVM
- Efficiently Computing Many Roots of a Function
- An automatic and guaranteed determination of the number of roots of an analytic function interior to a simple closed curve in the complex plane
Cited in
(13)- Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- Stability of equilibrium points in the generalized perturbed restricted three-body problem
- Computing zeros of analytic mappings: A logarithmic residue approach
- A dimension-reducing method for unconstrained optimization
- On the complexity of isolating real roots and computing with certainty the topological degree
- Topological degree theory and local analysis of area preserving maps
- Locating, characterizing and computing the stationary points of a function
- On perturbation of roots of homogeneous algebraic systems
- A note on multiple roots of a likelihood equation for Weibull sequential order statistics
- The equilibrium points in the perturbed R3BP with triaxial and luminous primaries
- Efficiently Computing Many Roots of a Function
- 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: Locating and Computing All the Simple Roots and Extrema of a Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895605)
