Locating and Computing All the Simple Roots and Extrema of a Function

DOI10.1137/S1064827594265666zbMath0862.65028OpenAlexW2015773120MaRDI QIDQ4895605

Dimitris J. Kavvadias, Michael N. Vrahatis

Publication date: 25 May 1997

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827594265666

zbMATH Keywords

performancealgorithmscomputational complexitytopological degreeBessel functionsimple rootsextremaKronecker-Picard integralzeros isolation

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10) Complexity and performance of numerical algorithms (65Y20)

Related Items (10)

Locating, characterizing and computing the stationary points of a function ⋮ A dimension-reducing method for unconstrained optimization ⋮ 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 ⋮ Stability of equilibrium points in the generalized perturbed restricted three-body problem ⋮ Topological degree theory and local analysis of area preserving maps ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves ⋮ On perturbation of roots of homogeneous algebraic systems ⋮ Computing zeros of analytic mappings: A logarithmic residue approach

This page was built for publication: Locating and Computing All the Simple Roots and Extrema of a Function