Numerical computation of root loci using the Newton-Raphson technique

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.