Chebyshev subdivision and reduction methods for solving multivariable systems of equations
Authors:
- Erik ParkinsonEPErik Parkinson
- Kate WallKWKate Wall
- Jane SlagleJSJane Slagle
- Daniel TreuhaftDTDaniel Treuhaft
- Xander de la BruereXBXander de la Bruere
- Samuel GoldrupSGSamuel Goldrup
- Timothy KeithTKTimothy Keith
- Peter CallPCPeter Call
- Tyler J. JarvisTJTyler J. Jarvis
- 3 October 2024
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 128
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Brigham Young University
This publication has 9 references indexed in Scilit:
- Truncated normal forms for solving polynomial systems: Generalized and efficient algorithmsJournal of Symbolic Computation, 2021
- Chebfun in Three DimensionsSIAM Journal on Scientific Computing, 2017
- Numerical Instability of Resultant Methods for Multidimensional RootfindingSIAM Journal on Numerical Analysis, 2016
- Computing the common zeros of two bivariate functions via Bézout resultantsNumerische Mathematik, 2014
- An Extension of Chebfun to Two DimensionsSIAM Journal on Scientific Computing, 2013
- Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion MatrixSIAM Review, 2013
- Subdivision methods for solving polynomial equationsJournal of Symbolic Computation, 2009
- Transformation of Chebyshev–Bernstein Polynomial BasisComputational Methods in Applied Mathematics, 2003
- Backward Stability of Clenshaw's AlgorithmBIT Numerical Mathematics, 2002