Continuation algorithms for the eigenvalue problems

Three algorithms for the solution of the eigenvalue problem for a continuously parameterized family of sparse matrices are presented; a continuousLU (orLR) algorithm, a continuousQR algorithm, and a continuous Hessenberg algorithm. Each of the three algorithms may be implemented recursively and the sparsity of the given matrices is preserved throughout the numerical process.This research was supported by the Joint Services Electronics Program at Texas Tech under ONR Contract 76-C-1176.