Symmetric eigenvalue problem

First Author1,2* and Second Author2,3

1*
Mathematics Department, Mahindra University, Street, Hyderabad, 500043,
Telangana State, India.

*Corresponding author(s). E-mail(s): [email protected];

Contributing authors: [email protected];

Abstract

Keywords: Rayleigh quotient, eigenvalues

1 Introduction
The Eigenvalue Problem chapter
Properties of Eigenvalues and Eigenvectors
Numerical Methods for Eigenproblems

2 Conclusion
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22]
[23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41]
[42] [43] [44] [45] [46] [47] [48] [? ] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59]
[60] [61] [62] [63] [64] [65] [66] [67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78]
[79] [80] [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [93]

Appendix A
References
[1] Dax, A.: A cross-product approach for low-rank approximations of large matrices.
Journal of Computational and Applied Mathematics 369, 112576 (2020)

1
 [2] Tănăsescu, A., Popescu, P.G.: A fast singular value decomposition algorithm of general
k-tridiagonal matrices. Journal of Computational Science 31, 1–5 (2019)

[3] Dongarra, J.J., Sorensen, D.C.: A fully parallel algorithm for the symmetric eigenvalue
problem. SIAM Journal on Scientific and Statistical Computing 8(2), 139–154 (1987)

[4] Fasino, D., Fazzi, A.: A gauss–newton iteration for total least squares problems. BIT
Numerical Mathematics 58(2), 281–299 (2018)

[5] Schwetlick, H., Lösche, R.: A generalized rayleigh quotient iteration for computing
simple eigenvalues of nonnormal matrices. ZAMM-Journal of Applied Mathematics and
Mechanics/Zeitschrift für Angewandte Mathematik und Mechanik 80(1), 9–25 (2000)

[6] Stewart, M.: A locally optimal rank revealing product decomposition. Linear Algebra
and its Applications 623, 420–453 (2021)

[7] He, Y., Li, Y., Xie, H., You, C., Zhang, N.: A multilevel newton’s method for eigenvalue
problems. Applications of Mathematics 63(3), 281–303 (2018)

[8] Liu, C.-S., Chang, J.-R., Shen, J.-H., Chen, Y.-W.: A new quotient and iterative detec-
tion method in an affine krylov subspace for solving eigenvalue problems. Journal of
Mathematics 2023(1), 9859889 (2023)

[9] Niu, D., Meng, J., Li, H.: A new shift strategy for the implicitly restarted refined
harmonic lanczos method. Journal of Computational and Applied Mathematics 336,
458–467 (2018)

[10] Vömel, C.: A note on harmonic ritz values and their reciprocals. Numerical Linear
Algebra with Applications 17(1), 97–108 (2010)

[11] Zhou, Y., Saad, Y.: A chebyshev–davidson algorithm for large symmetric eigenprob-
lems. SIAM Journal on Matrix Analysis and Applications 29(3), 954–971 (2007)

[12] Neymeyr, K.: A note on inverse iteration. Numerical Linear Algebra with Applications
12(1), 1–8 (2005)

[13] Tisseur, F., Dongarra, J.: A parallel divide and conquer algorithm for the symmetric
eigenvalue problem on distributed memory architectures. SIAM Journal on Scientific
Computing 20(6), 2223–2236 (1999)

[14] Balaji, N.N., Brake, M.R.: A quasi-static non-linear modal analysis procedure extending
rayleigh quotient stationarity for non-conservative dynamical systems. Computers &
Structures 230, 106184 (2020)

[15] Ortega, M., Slaybaugh, R., Brown, P., Bailey, T., Chang, B.: A rayleigh quotient method
for criticality eigenvalue problems in neutron transport. Annals of Nuclear Energy 138,
107120 (2020)

2
[16] Hetmaniuk, U.: A rayleigh quotient minimization algorithm based on algebraic multi-
grid. Numerical Linear Algebra with Applications 14(7), 563–580 (2007)

[17] Armentano, D., Beltrán, C., Bürgisser, P., Cucker, F., Shub, M.: A stable, polynomial-
time algorithm for the eigenpair problem. Journal of the European Mathematical Society
20(6), 1375–1437 (2018)

[18] Liu, B., Liu, Y., Zhang, H., Xu, Y., Tang, C., Tang, L., Qin, H., Miao, C.: Adaptive
power iteration clustering. Knowledge-Based Systems 225, 107118 (2021)

[19] Bakhta, A., Lombardi, D.: An a posteriori error estimator based on shifts for posi-
tive hermitian eigenvalue problems. Comptes Rendus. Mathématique 356(6), 696–705
(2018)

[20] Moler, C.B., Stewart, G.W.: An algorithm for generalized matrix eigenvalue problems.
SIAM Journal on Numerical Analysis 10(2), 241–256 (1973)

[21] Huang, Y., Liu, Y.: An analytical model for solving generalized interval eigenvalue
problem. Applied Mathematical Modelling 61, 18–28 (2018)

[22] Voss, H.: An arnoldi method for nonlinear eigenvalue problems. BIT numerical mathe-
matics 44, 387–401 (2004)

[23] Wang, X., Wang, L., Xia, Y.: An efficient global optimization algorithm for maximizing
the sum of two generalized rayleigh quotients. Computational and Applied Mathematics
37, 4412–4422 (2018)

[24] Calvetti, D., Reichel, L., Sorensen, D.C.: An implicitly restarted lanczos method for
large symmetric eigenvalue problems. Electronic Transactions on Numerical Analysis
2(1), 21 (1994)

[25] Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear
differential and integral operators (1950)

[26] Berry, M., Sameh, A.: An overview of parallel algorithms for the singular value and
symmetric eigenvalue problems. Journal of Computational and Applied Mathematics
27(1-2), 191–213 (1989)

[27] Kim, Y.: An unconstrained global optimization framework for real symmetric eigen-
value problems. Applied Numerical Mathematics 144, 253–275 (2019)

[28] Jia, Z.: Approximation accuracy of the krylov subspaces for linear discrete ill-posed
problems. Journal of Computational and Applied Mathematics 374, 112786 (2020)

[29] Weaver, J.R.: Centrosymmetric (cross-symmetric) matrices, their basic properties,

eigenvalues, and eigenvectors. The American Mathematical Monthly 92(10), 711–717
(1985)

3
[30] Brandts, J.H., Silva, R.R.: Computable eigenvalue bounds for rank-k perturbations.
Linear algebra and its applications 432(12), 3100–3116 (2010)

[31] Miao, C.-Q.: Computing eigenpairs in augmented krylov subspace produced by jacobi–
davidson correction equation. Journal of Computational and Applied Mathematics 343,
363–372 (2018)

[32] Miao, C.-Q.: Computing eigenpairs of hermitian matrices in augmented krylov sub-
space produced by rayleigh quotient iterations. Journal of Computational and Applied
Mathematics 375, 112822 (2020)

[33] Bai, Z.-Z., Miao, C.-Q.: Computing eigenpairs of hermitian matrices in perfect krylov
subspaces. Numerical Algorithms 82(4), 1251–1277 (2019)

[34] Bergamaschi, L., Bozzo, E.: Computing the smallest eigenpairs of the graph laplacian.
SeMA Journal 75(1), 1–16 (2018)

[35] Dax, A.: Computing the smallest singular triplets of a large matrix. Results in Applied
Mathematics 3, 100006 (2019)

[36] Kahan, W.: Conserving confluence curbs ill-condition. Computer Science Dept. Report,
University of California, Berkeley (1972)

[37] Guan, Y., Chu, M.T., Chu, D.: Convergence analysis of an svd-based algorithm for
the best rank-1 tensor approximation. Linear Algebra and its Applications 555, 53–69
(2018)

[38] Kuijlaars, A.B.: Convergence analysis of krylov subspace iterations with methods from
potential theory. SIAM review 48(1), 3–40 (2006)

[39] Aishima, K.: Convergence proof of the harmonic ritz pairs of iterative projection
methods with restart strategies for symmetric eigenvalue problems. Japan Journal of
Industrial and Applied Mathematics 37, 415–431 (2020)

[40] Chen, M.-F., Li, Y.-S.: Development of powerful algorithm for maximal eigenpair.
Frontiers of Mathematics in China 14, 493–519 (2019)

[41] Chen, M.-F.: Efficient initials for computing maximal eigenpair. Frontiers of Mathemat-
ics in China 11, 1379–1418 (2016)

[42] Chen, M.-F.: Efficientmaxeigenpair vignette (2017)

[43] Golub, G.H., Vorst, H.A.: Eigenvalue computation in the 20th century. Journal of
Computational and Applied Mathematics 123(1-2), 35–65 (2000)

[44] Ding, J., Zhou, A.: Eigenvalues of rank-one updated matrices with some applications.
Applied Mathematics Letters 20(12), 1223–1226 (2007)

4
[45] Paul, D., Stevanović, D.: Eigenvector-based identification of bipartite subgraphs. Dis-
crete Applied Mathematics 269, 146–158 (2019)

[46] Denton, P., Parke, S., Tao, T., Zhang, X.: Eigenvectors from eigenvalues: A survey of a
basic identity in linear algebra. Bulletin of the American Mathematical Society 59(1),
31–58 (2022)

[47] Eigenvalues, I.: Ergodic convergence rates of markov processes. Studies in Advanced
Mathematics 26 (2002)

[48] Stor, N.J., Slapničar, I., Barlow, J.L.: Forward stable eigenvalue decomposition of rank-
one modifications of diagonal matrices. Linear algebra and its applications 487, 301–
315 (2015)

[49] Cen, X., Xia, Y.: Globally maximizing the sum of squares of quadratic forms over the
unit sphere. Optimization Letters 14(7), 1907–1919 (2020)

[50] Chu, M.T.: Inverse eigenvalue problems. SIAM review 40(1), 1–39 (1998)

[51] Neymeyr, K., Zhou, M.: Iterative minimization of the rayleigh quotient by block steepest
descent iterations. Numerical Linear Algebra with Applications 21(5), 604–617 (2014)

[52] Cullum, J.K., Willoughby, R.A.: Lanczos Algorithms for Large Symmetric Eigenvalue
Computations: Vol. I: Theory. SIAM, ??? (2002)

[53] Shi, P., He, K., Bindel, D., Hopcroft, J.E.: Locally-biased spectral approximation for
community detection. Knowledge-Based Systems 164, 459–472 (2019)

[54] Silva, R., et al.: Matrix Perturbations: Bounding and Computing Eigenvalues. Oisterwi-
jkUitgeverij BOXPress, ??? (2011)

[55] Oh, H., Hu, Z.: Multiple-rank modification of symmetric eigenvalue problem. Meth-
odsX 5, 103–117 (2018)

[56] Brandts, J.: Numerical methods for eigenvalue problems lecture notes (2007)

[57] Miao, C.-Q.: On chebyshev–davidson method for symmetric generalized eigenvalue

problems. Journal of Scientific Computing 85(3), 53 (2020)

[58] Chen, F., Miao, C.-Q., Muratova, G.V.: On convergence of mrqi and imrqi meth-
ods for hermitian eigenvalue problems. Communications on Applied Mathematics and
Computation 3(1), 189–197 (2021)

[59] Chang, K.-C., Pearson, K., Zhang, T.: On eigenvalue problems of real symmetric
tensors. Journal of Mathematical Analysis and Applications 350(1), 416–422 (2009)

[60] Overton, M.L.: On minimizing the maximum eigenvalue of a symmetric matrix. SIAM
Journal on Matrix Analysis and Applications 9(2), 256–268 (1988)

5
[61] Bai, Z.-Z., Miao, C.-Q., Jian, S.: On multistep rayleigh quotient iterations for hermitian
eigenvalue problems. Computers & Mathematics with Applications 77(9), 2396–2406
(2019)

[62] Li, Y., Wei, M., Zhang, F., Zhao, J.: On the power method for quaternion right eigenvalue
problem. Journal of Computational and Applied Mathematics 345, 59–69 (2019)

[63] Lin, C.-P., Xie, H., Grimes, R., Bai, Z.: On the shift-invert lanczos method for the buck-
ling eigenvalue problem. International Journal for Numerical Methods in Engineering
122(11), 2751–2769 (2021)

[64] Kato, T.: On the upper and lower bounds of eigenvalues. Journal of the Physical Society
of Japan 4(4-6), 334–339 (1949)

[65] Liu, Q., Wang, M.: On the weighting method for mixed least squares–total least squares
problems. Numerical Linear Algebra with Applications 24(5), 2094 (2017)

[66] Miao, H.-Y., Wang, L.: Preconditioned inexact jacobi–davidson method for large
symmetric eigenvalue problems. Computational and Applied Mathematics 39, 1–13
(2020)

[67] Miao, C.-Q., Liu, H.: Rayleigh quotient minimization method for symmetric eigenvalue
problems. Computational and Applied Mathematics 38, 1–16 (2019)

[68] Parks, M.L., De Sturler, E., Mackey, G., Johnson, D.D., Maiti, S.: Recycling krylov sub-
spaces for sequences of linear systems. SIAM Journal on Scientific Computing 28(5),
1651–1674 (2006)

[69] Pantazis, R.D., Szyld, D.B.: Regions of convergence of the rayleigh quotient iteration
method. Numerical linear algebra with applications 2(3), 251–269 (1995)

[70] Tănăsescu, A., Carabaş, M., Pop, F., Popescu, P.G.: Scalability of k-tridiagonal matrix
singular value decomposition. Mathematics 9(23), 3123 (2021)

[71] Han, J.: Shifted inverse iteration based multigrid methods for the quad-curl eigenvalue
problem. Applied Mathematics and Computation 367, 124770 (2020)

[72] Belardo, F., Brunetti, M., Ciampella, A.: Signed bicyclic graphs minimizing the least
laplacian eigenvalue. Linear Algebra and its Applications 557, 201–233 (2018)

[73] Ercole, G.: Solving an abstract nonlinear eigenvalue problem by the inverse iteration
method. Bulletin of the Brazilian Mathematical Society, New Series 49, 577–591 (2018)

[74] Nakatsukasa, Y., Higham, N.J.: Stable and efficient spectral divide and conquer al-
gorithms for the symmetric eigenvalue decomposition and the svd. SIAM Journal on
Scientific Computing 35(3), 1325–1349 (2013)

6
[75] Zhou, Y.: Studies on jacobi–davidson, rayleigh quotient iteration, inverse iteration gen-
eralized davidson and newton updates. Numerical Linear Algebra with Applications
13(8), 621–642 (2006)

[76] Zhang, T., Golub, G.H., Law, K.: Subspace iterative methods for eigenvalue problems.
Linear algebra and its applications 294(1-3), 239–258 (1999)

[77] Ou, X., Xia, J.: Superdc: superfast divide-and-conquer eigenvalue decomposition with
improved stability for rank-structured matrices. SIAM Journal on Scientific Computing
44(5), 3041–3066 (2022)

[78] Heuvers, K.J.: Symmetric matrices with prescribed eigenvalues and eigenvectors.
Mathematics Magazine 55(2), 106–111 (1982)

[79] Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., Vorst, H.: Templates for the Solution of
Algebraic Eigenvalue Problems: a Practical Guide. SIAM, ??? (2000)

[80] Chen, M.-F.: The charming leading eigenpair. arXiv preprint arXiv:1706.07146 (2017)

[81] Ravibabu, M., Singh, A.: The least squares and line search in extracting eigenpairs in
jacobi–davidson method. BIT Numerical Mathematics 60(4), 1033–1055 (2020)

[82] Martynova, T., Muratova, G., Oganesyan, P., Shtein, O.: The numerical solution of
large-scale generalized eigenvalue problems arising from finite-element modeling of
electroelastic materials. Symmetry 15(1), 171 (2023)

[83] Bai, Z.-Z., Wu, W.-T., Muratova, G.V.: The power method and beyond. Applied
Numerical Mathematics 164, 29–42 (2021)

[84] Miller, U., Gaul, L.: The rayleigh quotient iteration for quadratic eigenvalue problems.
PAMM 11(1), 331–332 (2011)

[85] Liu, Q., Jin, S., Yao, L., Shen, D.: The revisited total least squares problems with linear
equality constraint. Applied numerical mathematics 152, 275–284 (2020)

[86] Brent, R.P., Luk, F.T.: The solution of singular-value and symmetric eigenvalue prob-
lems on multiprocessor arrays. SIAM Journal on Scientific and Statistical Computing
6(1), 69–84 (1985)

[87] Queiroz, M., Júdice, J., Humes Jr, C.: The symmetric eigenvalue complementarity
problem. Mathematics of Computation 73(248), 1849–1863 (2004)

[88] Wu, K., Simon, H.D.: Thick-restart laczos method for symmetric eigenvalue prob-
lems. Technical report, Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA
(United States) (1999)

[89] Chen, M.-F., Chen, R.-R.: Top eigenpairs of large scale matrices. CSIAM Trans. Appl.
Math 3(1), 1–25 (2022)

7
[90] Chen, M.-F.: Trilogy on computing maximal eigenpair. In: Queueing Theory and Net-
work Applications: 12th International Conference, QTNA 2017, Qinhuangdao, China,
August 21-23, 2017, Proceedings 12, pp. 312–329 (2017). Springer

[91] Freitag, M.A., Kürschner, P.: Tuned preconditioners for inexact two-sided inverse and
rayleigh quotient iteration. Numerical Linear Algebra with Applications 22(1), 175–196
(2015)

[92] Chaysri, T., Jakovčević Stor, N., Slapničar, I.: Fast eigenvalue decomposition of ar-
rowhead and diagonal-plus-rank-k matrices of quaternions. Mathematics 12(9), 1327
(2024)

[93] Barlow, J.L., Eisenstat, S.C., Stor, N.J., Slapnicar, I.: Deflation for the symmetric arrow-
head and diagonal-plus-rank-one eigenvalue problems. SIAM journal on matrix analysis
and applications 43(2), 681–709 (2022)