Title
On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
Abstract
A measure of efficiency of simultaneous methods for determination of polynomial zeros, defined by the coefficient of efficiency, is considered. This coefficient takes into consideration (1) the R-order of convergence in the sense of the definition introduced by Ortega and Rheinboldt (Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970) and (2) the number of basic arithmetic operations per iteration, taken with certain weights depending on a processor time. The introduced definition of computational efficiency was used for comparison of the simultaneous methods with various structures.
Year
DOI
Venue
1986
10.1145/22721.8932
ACM Trans. Math. Softw.
Keywords
Field
DocType
polynomial zero,basic arithmetic operation,iterative solution,new york,simultaneous approximation,academic press,nonlinear equations,certain weight,processor time,computational efficiency,additional key words and phrases: algebraic equation,simultaneous methods,polynomial zeros,iterative method,simultaneous method,nonlinear equation,iteration method,order of convergence
Convergence (routing),Nash–Sutcliffe model efficiency coefficient,Mathematical optimization,Nonlinear system,Polynomial,Iterative method,Fundamental Resolution Equation,Mathematics
Journal
Volume
Issue
Citations 
12
4
9
PageRank 
References 
Authors
1.78
3
2
Name
Order
Citations
PageRank
G. V. Milovanovic1176.40
M S Petkovic2269.78