Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems
The authors continue their study of an algorithm for solving polynomial equations based on the Taylor series of the inverse function of a polynomial in the neighborhood of a given point. The main motivation is that the approximate evaluation of this Taylor series at zero can be utilized to find initial approximations for Newton's method. Upper and lower bounds are established for this evaluation. The new proofs of the theorems involved in the construction of the inverse (appeared in previous publications) are given. They provide a better radius of convergence of its Taylor series. More importantly, they present a more general perspective that could allow its application to non-polynomial equations that the authors are working on. Finally, the authors also reexamine the problem of solving polynomial systems using these inverse functions. The new approach can ease the complexity of how they treat it in previous works.
- An algorithm to initialize the search of solutions of polynomial systems
- Solution of one variable equations
- On semilocal convergence analysis of the inverse Weierstrass method for simultaneous computing of polynomial zeros
- Functional approximation for inversion of Laplace transforms via polynomial series
- An Algorithm for Solving Polynomial Equations
- A bibliography on roots of polynomials
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A classification of quasi-Newton methods
- A Family of Scaled Factorized Broyden-Like Methods for Nonlinear Least Squares Problems
- An algorithm to initialize the search of solutions of polynomial systems
- Convergence of a generalized Newton and an inexact generalized Newton algorithms for solving nonlinear equations with nondifferentiable terms
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares
- Modified Newton's method for systems of nonlinear equations with singular Jacobian
- On Convergence of the Additive Schwarz Preconditioned Inexact Newton Method
- On new third-order convergent iterative formulas
- On Sizing and Shifting the BFGS Update within the Sized-Broyden Family of Secant Updates
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Practical quasi-Newton methods for solving nonlinear systems
- Quasi-Newton Methods, Motivation and Theory
- Recent applications and numerical implementation of quasi-Newton methods for solving nonlinear systems of equations
- Solving a Polynomial Equation: Some History and Recent Progress
- Tensor-Krylov Methods for Solving Large-Scale Systems of Nonlinear Equations
- Variants of Newton's method using fifth-order quadrature formulas
- A new algorithm for solving all the real roots of a nonlinear system of equations in a given feasible region
- An infinite family of one-step iterators for solving nonlinear equations to increase the order of convergence and a new algorithm of global convergence
- A comprehensive study of the mathematical methods used to approximate the inverse Langevin function
This page was built for publication: Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639990)
