Chebyshev subdivision and reduction methods for solving multivariable systems of equations

DOI10.1016/J.JSC.2024.102392MaRDI QIDQ6650577zbMATH OpenFDO

Authors Erik Parkinson, Kate Wall, Jane Slagle, Daniel Treuhaft, Xander de la Bruere, Samuel Goldrup, Timothy Keith, Peter Call, Tyler Jarvis

Publication date 9 December 2024

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JSC.2024.102392

zbMATH Keywords

Chebyshev proxy methodnumerical computation of real solutionsreductionsubdivisionsystem of equationszero elimination

Mathematics Subject Classification ID

Other special orthogonal polynomials and functions (33C47) Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to systems of equations (65H10) Numerical optimization and variational techniques (65K10)

Recommendations

• scientific article; zbMATH DE number 1795739
• AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
• Subdivision methods for solving polynomial equations
• Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis
• Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves

Cites work

• A Remark on Stirling's Formula
• Accuracy and Stability of Numerical Algorithms
• An Extension of Chebfun to Two Dimensions
• Backward stability of Clenshaw's algorithm
• Chebfun in Three Dimensions
• Computing the common zeros of two bivariate functions via Bézout resultants
• Finding the zeros of a univariate equation: Proxy rootfinders, Chebyshev interpolation, and the companion matrix
• Foundations of applied mathematics. Volume 2. Algorithms, approximation, optimization
• Numerical instability of resultant methods for multidimensional rootfinding
• Numerical Polynomial Algebra
• Solving transcendental equations. The Chebyshev polynomial proxy and other numerical rootfinders, perturbation series, and oracles
• Subdivision methods for solving polynomial equations
• Sur l'ordre de la meilleure approximation des fonctions continues par des polynomes de degré donné.
• Transformation of Chebyshev–Bernstein Polynomial Basis
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms

Cited in

(1)

• Chebyshev varieties

This page was built for publication: Chebyshev subdivision and reduction methods for solving multivariable systems of equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650577)