Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
From MaRDI portal
Publication:2840356
DOI10.1137/110838297zbMath1270.65023OpenAlexW2068324845WikidataQ56560423 ScholiaQ56560423MaRDI QIDQ2840356
Publication date: 18 July 2013
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110838297
numerical exampleseigenvaluesChebyshev interpolationcomplex rootsChebyshev-Frobenius companion matrix
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
Related Items
Fast algorithms using orthogonal polynomials, Unnamed Item, A comparison of companion matrix methods to find roots of a trigonometric polynomial, Convergent Power Series for Boundary Value Problems and Eigenproblems with Application to Atmospheric and Oceanic Tides, Quasi-analytical root-finding for non-polynomial functions, Fast multipole methods for approximating a function from sampling values, Analysis of Error Localization of Chebyshev Spectral Approximations, Numerical, perturbative and Chebyshev inversion of the incomplete elliptic integral of the second kind, A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class, Four ways to compute the inverse of the complete elliptic integral of the first kind, A note on generalized companion pencils in the monomial basis, Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic, Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding, A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters
Uses Software
