1968/10/01 by R. Ash, G. Ash · 1 citation
Computer Science · Mathematics · #Matrix Theory and Algorithms #Numerical Methods and Algorithms #Newton's method #Computation #Fortran #Root (linguistics) #Computer science #Algorithm #Root-finding algorithm #Linear system #Iterative method #Applied mathematics #Mathematics #Mathematical optimization #Nonlinear system #Mathematical analysis #Programming language
paper · doi:10.1109/tac.1968.1098980
openalex publication_date 1968/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
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.