By Topic

Numerical computation of root loci using the Newton-Raphson technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ash, R. ; Rensselaer Polytechnic Institute, Troy, NY, USA ; Ash, G.

An algorithm is described which employs the method of Newton-Raphson iteration in order to compute the root loci of a linear system. The technique differs widely in several aspects from those previously reported, and thereby significant gains in speed, accuracy, and versatility have been achieved. A FORTRAN program which utilizes the algorithm has been written, and some of its features are pointed out. An example of the use of this program is given.

Published in:

Automatic Control, IEEE Transactions on  (Volume:13 ,  Issue: 5 )