{"references": ["W. E. Arnoldi, The principle of minimized iterations in the solution of\nthe matrix eigenvalue problem, Quart. Appl. Math., 9(1951), pp. 17-29.", "Z. Bai, J. Demmel, J. Dongarra, A. Ruhe and H. van der Vorst, Templates\nfor the Solution of Algebraic Eigenvalue Problems: A Practical Guide,\nSIAM, Philadelphia, 2000.", "Z. Bai and Y. Su, SOAR: a second-order Arnoldi method for the solution\nof the quadratic eigenvalue problem, SIAM J. Matrix Anal. Appl.,\n26(2005), pp. 640-659.", "A. Berm'udez, R. G. Dur'an, R. Rodr'\u2500\u2592guez and J. Solomin, Finite\nelement analysis of a quadratic eigenvalue problem arising in dissipative\nacoustics, SIAM J. Numer. Anal., 38(2000), pp. 267-91.", "J. V. Clark, N. Zhou and K. S. J. Pister, Modified nodal analysis\nfor MEMS with multienergy domains, in International Conference on\nModeling and Simulation of Microsystems, Semiconductors, Sensors\nand Actuators, San Diego, CA, March 27-29, 2000.", "R. W. Clough and J. Penzien, Dynamics of Structures, McGraw-Hill,\nDusseldorf, 1975.", "J. W. Daniel, W. B. Gragg, L. Kaufman, and G. W. Stewart, Reorthogonalization\nand stable algorithms for updating the Gram-Schmidt QR\nfactorization, Math. Comp., 30(1976), pp. 772-795.", "C. E. Davila, A subspace approach to estimation of autoregressive\nparameters from noisy measurements, IEEE Trans. Signal Processing,\n46(1998), pp. 531-534.", "J. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia,\n1997.\n[10] R. W. Freund and N. M. Nachtigal, QMR: a quasi-minimal residual\nmethod for non-Hermitian linear systems, Numer. Math., 60(1991), pp.\n315-339.\n[11] G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd edition,\nJohns Hoplins University Press, Baltimore, 1996.\n[12] C.-H. Guo, Numerical solution of a quadratic eigenvalue problem,\nLinear Algebra Appl., 385(2004), pp. 391-406.\n[13] J.-S. Guo, W.-W. Lin and C.-S. Wang, Numerical solutions for large\nsparse quadratic eigenvalue problems, Linear Algebra Appl., 225(1995),\npp. 57-89.\n[14] R. S. Heeg and B. J. Geurts, Spatial instabilities of the incompressible\nattachment-line flow using sparse matrix Jacobi-Davidson techniques,\nAppl. Sci. Res., 59(1998), pp. 315-329.\n[15] A. Hilliges, C. Mehl and V. Mehrmann, On the solution of palindromic\neigenvalue problems, in Proceedings of the 4th European Congress on\nComputational Methods in Applied Sciences and Engineering (ECCOMAS),\nJyv\u252c\u00bfaskyl\u252c\u00bfa, Finland, 2004.\n[16] M. E. Hochstenbach and H. A. van der Vorst, Alternatives to the\nRayleigh quotient for the quadratic eigenvalue problem, SIAM J. Sci.\nComput., 25(2003), pp. 591-603.\n[17] U. B. Holz, G. Golub and K. H. Law, A subspace approximation method\nfor the quadratic eigenvalue problem, SIAM J. Matrix Anal. Appl.,\n26(2005), pp. 498-521.\n[18] T.-M. Hwang, W.-W. Lin and V. Mehrmann, Numerical solution of\nquadratic eigenvalue problems with structure-preserving methods, SIAM\nJ. Sci. Comput., 24(2003), pp. 1283-1302.\n[19] T.-M. Huang, W.-W. Lin and J. Qian, Structure-preserving algorithms\nfor palindromic quadratic eigenvalue problems arising from vibration\nof fast trains, SIAM J. Matrix Anal. Appl., 30(2009), pp. 1566-1592.\n[20] Z. Jia, Refined iterative algorithm based on Arnoldi-s process for large\nunsymmetric eigenproblems, Linear Algebra Appl., 259(1997), pp. 1-23.\n[21] Z. Jia, A refined subspace iteration algorithm for large spares eigenproblems,\nAppl. Numer. Math., 32(2000), pp. 35-52.\n[22] J. Lampe and H. Voss, On a quadratic eigenproblem occurring in\nregularized total least squares, Comput. Stat. Data Anal., 52(2007), pp.\n1090-1102.\n[23] J. Lampe and H. Voss, Global convergence of RTLSQEP: a solver of\nregularized total least squares problems via quadratic eigenproblems,\nMath. Modelling Anal., 13(2008), pp. 55-66.\n[24] R. Li and Q. Ye, A Krylov subspace method for quadratic matrix\npolynomials with application to constrained least squares problems,\nSIAM J. Matrix Anal. Appl., 25(2003), pp. 405-428.\n[25] The MathWorks, Inc., MATLAB 7, September 2004.\n[26] K. Meerbergen, Locking and restarting quadratic eigenvalue solvers,\nSIAM J. Sci. Comput., 22(2001), pp. 1814-1839.\n[27] K. Meerbergen, The quadratic Arnoldi method for the solution of the\nquadratic eigenvalue problem, SIAM J. Matrix Anal. Appl., 30(2008),\npp. 1463-1482.\n[28] J. Qian and W.-W. Lin, A numerical method for quadratic eigenvalue\nproblems of gyroscopic systems, J. Sound Vibration, 306(2007), pp. 284-\n296.\n[29] F. A. Raeven, A new Arnoldi approach for polynomial eigenproblems, In\nProceedings of the Copper Mountain Conference on Iterative Methods,\n1996.\n[30] G. X. Ren and Z. C. Zheng, A reformulated Arnoldi algorithm for nonclassically\ndamped eigenvalue problems, Int. J. Numer. Methods Eng.,\n40(1997), pp. 3537-3555.\n[31] A. Ruhe, Numerical aspects of Gramm-Schmidt orthogonalization of\nvectors, Linear Algebra Appl., 52(1983), pp. 591-601.\n[32] Y. Saad, Variations on Arnoldi-s method for computing eigenproblems\nof large non-Hermitian matrices, Linear Algebra Appl., 34(1980), pp.\n269-295.\n[33] Y. Saad and M. Schultz, GMRES: A generalized minimal residual\nalgorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist.\nComput., 7(1986), pp. 856-869.\n[34] Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd edition,\nSIAM, Philadelphia, 2003.\n[35] H. Schmitz, K. Volk and W. L. Wendland, On three-dimensional\nsingularities of elastic fields near vertices, Numer. Methods Partial\nDifferential Equations, 9(1993), pp. 323-337.\n[36] G. L. G. Sleijpen, G. L. Booten, D. R. Fokkema and H. A. van der\nVorst, Jacobi-Davidson type methods for generalized eigenproblems and\npolynomial eigenproblems, BIT, 36(1996), pp. 595-633.\n[37] F. Tisseur, Backward error and condition of polynomial eigenvalue\nproblems, Linear Algebra Appl., 309(2000), pp. 339-361.\n[38] F. Tisseur and K. Meerbergen, The quadratic eigenvalue problem, SIAM\nReview, 43(2001), pp. 235-286.\n[39] H. A. van der Vorst, BICGSTAB: a fast and smoothly converging variant\nof Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci.\nStatist. Comput., 13(1992), pp. 631-644.\n[40] Q. Ye, An iterated shift-and-invert Arnoldi algorithm for quadratic\nmatrix eigenvalue problems, Appl. Math. Comput., 172(2006), pp. 818-\n827."]}

This article is devoted to the numerical solution of large-scale quadratic eigenvalue problems. Such problems arise in a wide variety of applications, such as the dynamic analysis of structural mechanical systems, acoustic systems, fluid mechanics, and signal processing. We first introduce a generalized second-order Krylov subspace based on a pair of square matrices and two initial vectors and present a generalized second-order Arnoldi process for constructing an orthonormal basis of the generalized second-order Krylov subspace. Then, by using the projection technique and the refined projection technique, we propose a restarted generalized second-order Arnoldi method and a restarted refined generalized second-order Arnoldi method for computing some eigenpairs of largescale quadratic eigenvalue problems. Some theoretical results are also presented. Some numerical examples are presented to illustrate the effectiveness of the proposed methods.