在本文中，我們討論了如何使用多項式 Jacobi-Davidson 疊代法去解決多項式特徵值問題。此外，我們使用 locking 的方式把已收斂的值給保留住，並且給予四個 scheme 來解用多項式 Jacobi-Davidson 疊代法解多項式特徵值問題所產生的 correction 方程式。
我們的多項式特徵值問題是來自量子點模擬，其中包含三種不同形狀的量子點和兩種有效質量模型。在數值結果中，我們說明了係數矩陣裡的非零元素在這五個問題中的表現，以及比較各種 schenme 來解 correction 方程式以及使用不同的 precondition 的效果，用以建議一個最佳的選擇在每一個不同的情況下，用來解多項式 Jacobi-Davidson 疊代法解多項式特徵值問題所產生的 correction 方程式。

In this paper, we study how to use the polynomial Jacobi-Davidson iterative mehtod to solve the polynomial eigenvalues problem. And we use the locking scheme to lock the convergent eigenpaors, and give four schemes to solve the correction equation in polynomial Jacobi-Davidson method. A set of polynomial eigenvalue benchmark problems are derived from quantum dot simulations, with three different shapes of quantum dot and two kinds of effective mass models. In numerical results, we illustrate the non-zero elements of all coefficient matrices in these five benchmark problems and compare the performance of the various schemes for solving correction equation with different preconditioners to suggest the best choice in each different case when solving the correction equation in polynomial Jacobi-Davidson method.

[1] W. E. Arnoldi. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quarterly of Applied Mathematics, 9:17–29, 1951.
[2] Zhaojun Bai and Yangfeng Su. SOAR: A second-order Arnoldi method for the solution of the quadratic eigenvalue problem. SIAM J. Matrix Anal. Appl., 26(3):640–659, 2005.
[3] Satish Balay, William D. Gropp, Lois C. McInnes, and Barry F. Smith. Effcienct Management of Parallelism in Object Oriented Numerical Software Libraries. In E. Arge, A. M. Bruaset, and H. P. Langtangen, editors, Modern Software Tools in Scientific Computing, pages 163–202. Birkh¨auser Press, 1997.
[4] Satish Balay, William D. Gropp, Lois C. McInnes, and Barry F. Smith. PETSc home page. http://www.mcs.anl.gov/petsc, 2001.
[5] Satish Balay, William D. Gropp, Lois C. McInnes, and Barry F. Smith. PETSc Users Manual. Technical Report ANL-95/11 - Revision 2.1.5, Argonne National Laboratory, 2003.
[6] T. Betcke and H. Voss. A Jacobi-Davidson-type projection method for nonlinear eigenvalue problems. Future Generation Computer Systems., 20:363–372, 2004.
[7] E. A. de Andrada e Silva, G. C. La Rocca, and F. Bassani. Spin-orbit splitting of electronic states in semiconductor asymmetric quantum wells. PHYSICAL REVIEW B, 55(24):16293–16299, 1997.
[8] Gene H. Golub and Charles F. Van Loan. Matrix Computations Third edition. The Johns Hopkins University Press, 1996.
[9] Tsung-Min Hwang, Wen-Wei Lin, and Jinn-Liang Liu and. Jacobi-Davidson methods for cubic eigenvalue problems. Numer. Linear Algebra Appl., 12:605–624, 2005.
[10] Tsung-Min Hwang, Wen-Wei Lin, Wei-Cheng Wang, and Weichung Wang. Numerical simulation of three dimensional pyramid quantum dot. Journal of Computational Physics, 196(1):208–232, 2004.
[11] Tsung-Min Hwang, Wei-Cheng Wang, and Weichung Wang. Numerical schemes for three-dimensional irregular shape quantum dots over curvilinear coordinate systems. Journal of Computational Physics, 226(1):754–773, 2007.
[12] Tsung-Min Hwang, Wei-Hua Wang, and Weichung Wang. Effcient numerical schemes for electronic states in coupled quantum dots. Journal of Nanoscience and Nanotechnology, 8(7):3695–3709, 2008.
[13] Cornelius Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards, 45:255–282, 1950.
[14] Karl Meerbergen. Locking and restarting quadratic eigenvalue solvers. SIAM J. Sci. Comput., 22(5):1814–1839, 2001.
[15] Karl Meerbergen. The quadratic Arnoldi method for the solution of the quadratic eigenvalue problem. SIAM J. Matrix Anal. Appl., 30(4):1463–1482, 2008.
[16] Youcef Saad and Martin H. Schultz. GMRES: a generalized minimal residual algorithmfor solving nonsymmetric linear systems. SIAM J. ScI. STAT. COMPUT., 7(3):856–869, 1986.
[17] Gerard L. G. Sleijpen, Albert G. L. Booten, Diederik R. Fokkema, and Henk A. van der Vorst. Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT Numerical Mathematics, 36(3):595–633, 1996.
[18] Gerard L. G. Sleijpen and Henk A. Van der Vorst. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl., 17:401–425, 1996.
[19] G. W. Stewart. Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices. Numer. Math., 25:123–136, 1976.
[20] G. W. Stewart. Matrix Algorithms Volume II: Eigensystems. SIAM, 2001.
[21] H. A. Van Der Vorst. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientic and Statistical Computing, 13:631–644, 1992.
[22] H. Voss. An Arnoldi method for nonlinear symmetric eigenvalue problems. in Online Proceedings of the SIAM Conference on Applied Linear Algebra, Williamsburg, http://www.siam.org/meetings/laa03/, 2003.
[23] H. Voss. An arnoldi method for nonlinear eigenvalue problems. BIT Nu-merical Mathematics, 44:387–401, 2004.