Não disponívelThis work is intended to present contributions to solve problems which occur in the application of iterative methods for solving polynomial equations, thus amplifying the numerical computational means already available. We present two new techniques, called Initial Pha se and Variant of the Initial Phase, in chapter 2, by means o f which we determine one or more initial approximations to the root of the smaller modulus of a polynomi al equation. In chapter 3 of this work, a new iterative method, called MIDREM is proposed. This method gives not only the root of a polynomial equation but also its multiplicity. Considerations about Graeffe\'s method to solve real polynomial equations are presented in chapter 4. It is well known t...
An iterative method is described which finds all the roots of a square-free polynomial at once, usin...
These notes accompany an introductory lecture given by the author at the workshop on solving polynom...
Novel approaches are used to ensure consistently rapid convergence of an algorithm, based on Newton&...
Não disponívelThis work is intended to present contributions to solve problems which occur in the ap...
AbstractComputational methods for manipulating sets of polynomial equations are becoming of greater ...
The aim of this article is to present a brief review and a numerical comparison of iterative methods...
A more robust root finding technique using the fixed point theory is developed. This is based on the...
This paper is dedicated to our beloved friend and colleague Jean Pierre Dedieu. Abstract. These page...
textCurrently, there exist several methods for finding roots of polynomial functions. From elementar...
We describe the implementation and the use of the package MPSolve (Multiprecision Polynomial Solver)...
AbstractTwo accelerating generators that produce iterative root-finding methods of arbitrary order o...
Abstract Two new iterative methods for the simultaneous determination of all multiple as well as dis...
Abstract: New methods for computation of solutions of an algebraic equation of three varia...
This program uses Bairstow's method to find the real and complex roots of a polynomial with real co...
Summary. In this paper, we describe the definition of the first, second, and third degree algebraic ...
An iterative method is described which finds all the roots of a square-free polynomial at once, usin...
These notes accompany an introductory lecture given by the author at the workshop on solving polynom...
Novel approaches are used to ensure consistently rapid convergence of an algorithm, based on Newton&...
Não disponívelThis work is intended to present contributions to solve problems which occur in the ap...
AbstractComputational methods for manipulating sets of polynomial equations are becoming of greater ...
The aim of this article is to present a brief review and a numerical comparison of iterative methods...
A more robust root finding technique using the fixed point theory is developed. This is based on the...
This paper is dedicated to our beloved friend and colleague Jean Pierre Dedieu. Abstract. These page...
textCurrently, there exist several methods for finding roots of polynomial functions. From elementar...
We describe the implementation and the use of the package MPSolve (Multiprecision Polynomial Solver)...
AbstractTwo accelerating generators that produce iterative root-finding methods of arbitrary order o...
Abstract Two new iterative methods for the simultaneous determination of all multiple as well as dis...
Abstract: New methods for computation of solutions of an algebraic equation of three varia...
This program uses Bairstow's method to find the real and complex roots of a polynomial with real co...
Summary. In this paper, we describe the definition of the first, second, and third degree algebraic ...
An iterative method is described which finds all the roots of a square-free polynomial at once, usin...
These notes accompany an introductory lecture given by the author at the workshop on solving polynom...
Novel approaches are used to ensure consistently rapid convergence of an algorithm, based on Newton&...