Items related to Complex Root Isolation
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
I 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 Cheng and graduated from the Oakland University in Rochester, Michigan in 2009.
"About this title" may belong to another edition of this title.
Search results for Complex Root Isolation
Seller Image
Complex Root Isolation
Published by
Scholars' Press Jun 2013, 2013
ISBN 10: 3639514440
ISBN 13: 9783639514445
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639514445
Stock Image
Complex Root Isolation
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 26357317148
Stock Image
Complex Root Isolation
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand. Seller Inventory # 356222403
Buy New
£ 62.32
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Complex Root Isolation
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND. Seller Inventory # 18357317142
Seller Image
Complex Root Isolation
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4993140
Buy New
£ 34.28
£ 42.09 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Complex Root Isolation
Published by
Scholars' Press Jun 2013, 2013
ISBN 10: 3639514440
ISBN 13: 9783639514445
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639514445
Seller Image
Complex Root Isolation
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639514445