Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Cullum J., Willoughby R. A., Lanczos algorithms for large symmetric eigenvalue computations, v. I, Theory, Birkhaüser, Boston, 1985 | MR | Zbl
[2] Cullum J., Willoughby R. A., Lanczos algorithms for large symmetric eigenvalue computations, v. II, Programs, Birkhaüser, Boston, 1985 | MR | Zbl
[3] Golub G. H., Van Loan C. F., Matrix computations, John Hopkins Univ. Press, Baltimore, 1989 | MR | Zbl
[4] Parlett B., Simmetrichnaya problema sobstvennykh znachenii, Mir, M., 1983 | MR | Zbl
[5] Ikramov Kh. D., “Razrezhennye matritsy”, Matem. analiz. Itogi nauki i tekhn., VINITI, M., 1982
[6] Nechepurenko Yu. M., “Singular functions of polynomial matrices”, Russ. J. Numer. Analys. Math. Modelling, 7:1 (1992), 63–74 | DOI | MR | Zbl
[7] Gohberg I., Lancaster P., Rodman L., Matrix polynomials, Acad. Press, N. Y., 1982 | MR | Zbl
[8] Kato T., Teoriya vozmuschenii lineinykh operatorov, Mir, M., 1972 | MR | Zbl
[9] Uilkinson Dzh. Kh., Algebraicheskaya problema sobstvennykh znachenii, Nauka, M., 1970
[10] Sun Ji-guang, “Multiple eigenvalue sensitivity analysis”, Linear Algebra Appl., 137/138 (1990), 183–211 | DOI | MR | Zbl
[11] Dennis Jr., Schnabel R. B., Numerical methods for unconstrained optimization and nonlinear equations, Press Hall, Inc., New Jersey, Englewood Cliffs, 1983 | MR | Zbl
[12] Garbow B. S., Boyle J. M., Dongarra J. J., Moler C. B., Matrix eigensystem routines-EISPACK Guide extention, Lect. Notes Comput Sci., 51, Springer, Berlin, 1977 | MR | Zbl