Quasi-analytical root-finding for non-polynomial functions

DOI10.1007/S11075-017-0274-4zbMath1377.65056DBLPjournals/na/BraccialiC17OpenAlexW2591264703WikidataQ59612787 ScholiaQ59612787MaRDI QIDQ1681771

Michael Carley, Cleonice F. Bracciali

Publication date: 24 November 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-017-0274-4

zbMATH Keywords

numerical exampleNewton's methodorthogonal functionsTaylor expansionsquadrature rulesSturm's theoremroot-findingnon-polynomial functions

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved estimates for nonoscillatory phase functions
• Orthogonal polynomials on the unit circle and chain sequences
• Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals
• Explicit formulas for OPUC and POPUC associated with measures which are simple modifications of the Lebesgue measure
• A class of orthogonal functions given by a three term recurrence formula
• Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
• On the Numerical Calculation of the Roots of Special Functions Satisfying Second Order Ordinary Differential Equations
• A Fast Algorithm for the Calculation of the Roots of Special Functions
• Moment Theory, Orthogonal Polynomials, Quadrature, and Continued Fractions Associated with the unit Circle

This page was built for publication: Quasi-analytical root-finding for non-polynomial functions