Use the Jacobi algorithm to find the eigenvalues and eigenvectors of a real symmetric matrix. Use the Jacobi algorithm to solve the generalized eigenvalue problem for real symmetric matrices. Illustrates use of algorithms A14JE and A15GSE. (See J.C. Nash, Compact Numerical Methods for Computers: Linear Algebra and Function Minimization, John Wiley, New York, 1979, pages 106-115.). Classes : D4a1 . Real symmetric matrix eigenvalue problems D4b1 . Real symmetric generalized matrix eigenvalue problems Type : Fortran software in NASHLIB collection. Access : Public domain. Portable. Precision: Single. Usage : CALL A14JE(N, A, NA, V, NV, ISWP, IPR, SETV, COMV), CALL A15GSE(N, A, NA, B, NB, V, NV, FAIL, ISWP, IPR) Details : Source Sites : (1) ITL
ITL: Unix Workstation Network, National Institute of Standards and Technology (NIST), Gaithersburg, MD. Available to NIST staff. Precision: Single.
GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology
This page was generated on Wed Sep 17, 2008 at 18:02:50 UTC