Optimal algorithms concerning the solving of equations by interpolation

Abstract

In this paper we approach two aspects concerning the optimality problems arising from the consideration of the iterative methods for approximating the solutions of equations by inverse interpolation.

The first aspect concerns the construction of some algorithms having optimal convergence orders, while the second addresses the optimal complexity of calculus concerning the inverse interpolation iterative methods.

Authors

Ion Păvăloiu,
Tiberiu Popoviciu Institute of Numerical Analysis

Keywords

nonlinear equations in \(\mathbb{R}\); inverse interpolation; convergence order; efficiency index; optimal iterative methods

References

PDF

About this paper

Cite this paper as:

I. Păvăloiu, Optimal algorithms concerning the solving of equations by interpolation, Research on Theory of Allure, Approximation, Convexity and Optimization, Ed. Srima, Cluj-Napoca (1999), pp. 222-248, ISBN 973-98551-4-3.

Journal

Research on Theory of Allure, Approximation, Convexity and Optimization

Publisher Name

Editura Srima

DOI

Not available yet.

Print ISBN

973-98551-4-3

Not available yet.

Google Scholar Profile

Related Posts

Menu