On the k-th root in circular arithmetic

Computing ◽  
1984 ◽  
Vol 33 (1) ◽  
pp. 27-35 ◽  
Author(s):  
Ljiljana Petković ◽  
M. Petković
Keyword(s):  
Circular Arithmetic

Circular arithmetic and the determination of polynomial zeros

1971 ◽  
Vol 18 (4) ◽  
pp. 305-320 ◽  
Author(s):  
Irene Gargantini ◽  
Peter Henrici
Keyword(s):  
Polynomial Zeros ◽  
Circular Arithmetic

Inequalities in Circular Arithmetic: A Survey

1998 ◽  
pp. 325-340 ◽  
Author(s):  
Ljiljana D. Petković ◽  
Miodrag S. Petković
Keyword(s):  
Circular Arithmetic

Error-bounds for zeroes of polynomials using complex circular arithmetic

Computing ◽  
1988 ◽  
Vol 40 (3) ◽  
pp. 273-280
Author(s):  
A. Frommer ◽  
W. Straub
Keyword(s):  
Error Bounds ◽  
Circular Arithmetic

scholarly journals Derivative free method for the simultaneous inclusion of polynomial zeros

Filomat ◽  
2003 ◽  
pp. 155-168
Author(s):  
Miodrag Petkovic ◽  
Dusan Milosevic
Keyword(s):  
Order Of Convergence ◽  
Initial Conditions ◽  
Convergence Speed ◽  
Combined Method ◽  
Polynomial Zeros ◽  
Numerical Example ◽  
Derivative Free ◽  
Circular Arithmetic ◽  
Derivative Free Method ◽  
Complex Zeros

A combined method for the simultaneous inclusion of complex zeros of a polynomial, composed of two circular arithmetic methods, is presented. This method does not use polynomial derivatives and has the order of convergence equals four. Computationally variable initial conditions that guarantee the convergence are also stated. Two numerical example are included to demonstrate the convergence speed of the presented method.

Construction of value set for robustness analysis via circular arithmetic

1994 ◽  
Vol 4 (3) ◽  
pp. 371-385 ◽  
Author(s):  
B. T. Polyak ◽  
P. S. Scherbakov ◽  
S. B. Shmulyian
Keyword(s):  
Robustness Analysis ◽  
Value Set ◽  
Circular Arithmetic
Sign in / Sign up

Export Citation Format

Share Document