Complex root isolation von lanel jayantha (8 Ergebnisse)

Zustand: New.

Taschenbuch. Zustand: Neu. Complex Root Isolation | Jayantha Lanel | Taschenbuch | 64 S. | Englisch | 2013 | Scholars' Press | EAN 9783639514445 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Complex root isolation of univariate Gaussian integer polynomial A(z) can be done by reducing the problem to find an algorithm to determine the number of roots of A(z) in any given closed rectangle R in the complex plane. If there are no zeros of A(z) on the boundary of R, then the number of roots in R can be obtained by using the argument principle. However, the argument principle fails when there is a root on the boundary of R. In this book a mathematical proof is given to solve the problem although there are roots on the boundary. We have also presented an algorithm based on the above result that isolate all complex zeros of A. Furthermore we have shown that the time complexity of the algorithm has a good upper bound. Finally, the algorithm is implemented in SacLib2.1 and we have provided empirical evidence that our algorithm is efficient in practice. 64 pp. Englisch.…

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Lanel JayanthaI am Dr. G.H.J. Lanel, a Senior Lecturer in the Department of Mathematics at University of Sri Jayewardenepura. I completed my Ph.D. with thesis titled Complex Root Isolation under the supervision of Professor Charles.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Complex root isolation of univariate Gaussian integer polynomial A(z) can be done by reducing the problem to find an algorithm to determine the number of roots of A(z) in any given closed rectangle R in the complex plane. If there are no zeros of A(z) on the boundary of R, then the number of roots in R can be obtained by using the argument principle. However, the argument principle fails when there is a root on the boundary of R. In this book a mathematical proof is given to solve the problem although there are roots on the boundary. We have also presented an algorithm based on the above result that isolate all complex zeros of A. Furthermore we have shown that the time complexity of the algorithm has a good upper bound. Finally, the algorithm is implemented in SacLib2.1 and we have provided empirical evidence that our algorithm is efficient in practice.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 64 pp. Englisch.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Complex root isolation of univariate Gaussian integer polynomial A(z) can be done by reducing the problem to find an algorithm to determine the number of roots of A(z) in any given closed rectangle R in the complex plane. If there are no zeros of A(z) on the boundary of R, then the number of roots in R can be obtained by using the argument principle. However, the argument principle fails when there is a root on the boundary of R. In this book a mathematical proof is given to solve the problem although there are roots on the boundary. We have also presented an algorithm based on the above result that isolate all complex zeros of A. Furthermore we have shown that the time complexity of the algorithm has a good upper bound. Finally, the algorithm is implemented in SacLib2.1 and we have provided empirical evidence that our algorithm is efficient in practice.…