AbstractRational iteration procedures such as the Newton iteration or Regula falsi for the approximation of algebraic numbers are considered from the point of view of algebraic complexity theory. It is shown that n-point procedures satisfying some additional hypothesis can be replaced by 1-point procedures without increasing the complexity
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
AbstractNewton iteration is known (under some precise conditions) to convergence quadratically to ze...
AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial ti...
AbstractRational iteration procedures such as the Newton iteration or Regula falsi for the approxima...
For a convergent sequence {xi} generated by xi+1=(xi, xi−1,…,xi−d+1), define the multiplicative effi...
AbstractWe study the minimal complexity index of one-point iterations without memory for the solutio...
This is the third paper in which we study iterations using linear information for the solution of no...
AbstractWe generalize several methods for obtaining lower bounds for the complexity of polynomials, ...
AbstractIt is known that computing all coefficients of the Lagrangian interpolation polynomial, give...
AbstractNewton iteration is known (under some precise conditions) to convergence quadratically to ze...
AbstractThis is the third paper in which we study iterations using linear information for the soluti...
AbstractThis is the third paper in which we study iterations using linear information for the soluti...
Real numbers are represented as rational numbers in a symbolic manipulation system. The advantage of...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
AbstractNewton iteration is known (under some precise conditions) to convergence quadratically to ze...
AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial ti...
AbstractRational iteration procedures such as the Newton iteration or Regula falsi for the approxima...
For a convergent sequence {xi} generated by xi+1=(xi, xi−1,…,xi−d+1), define the multiplicative effi...
AbstractWe study the minimal complexity index of one-point iterations without memory for the solutio...
This is the third paper in which we study iterations using linear information for the solution of no...
AbstractWe generalize several methods for obtaining lower bounds for the complexity of polynomials, ...
AbstractIt is known that computing all coefficients of the Lagrangian interpolation polynomial, give...
AbstractNewton iteration is known (under some precise conditions) to convergence quadratically to ze...
AbstractThis is the third paper in which we study iterations using linear information for the soluti...
AbstractThis is the third paper in which we study iterations using linear information for the soluti...
Real numbers are represented as rational numbers in a symbolic manipulation system. The advantage of...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
AbstractNewton iteration is known (under some precise conditions) to convergence quadratically to ze...
AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial ti...
DOI
Add to ORKG