实对称矩阵谱的可信计算
The Verification of the Spectra of the Real Symmetric Matrix
DOI: 10.12677/AAM.2020.910204, PDF,    科研立项经费支持
作者: 王学清, 李 喆*:长春理工大学理学院,吉林 长春
关键词: 对称矩阵可信验证Symmetric Matrix Spectra Verification
摘要: 本文主要研究实对称矩阵谱的可信计算。给定实对称矩阵,首先利用Matlab中的eig命令求其数值谱,然后利用Kantorovich定理,设计算法计算数值谱的可信误差界。算法保证在该误差界范围内存在一实对称矩阵,该实对称矩阵的精确谱为给定实对称矩阵的数值谱。
Abstract: This paper mainly investigates the verification of the spectra of the real symmetric matrix. Given a real symmetric matrix, we firstly use eig code in Matlab to obtain its numerical spectra. Then by Kantorovich theorem, we provide an algorithm to compute verified error bound such that there exists a perturbed real symmetric matrix within computed error bound, whose exact spectra is the computed numerical spectra of the given matrix.
文章引用:王学清, 李喆. 实对称矩阵谱的可信计算[J]. 应用数学进展, 2020, 9(10): 1766-1775. https://doi.org/10.12677/AAM.2020.910204

参考文献

[1] Trefethen, L.N. and Embree, M. (2005) Spectra and Pseudospectra: The Behavior of Non-Normal Natrices and Operators. Princeton University Press, Princeton. [Google Scholar] [CrossRef
[2] 吕丽莎, 赵卫红, 苗辉. 三维荧光结合平行因子分析在东海溶解有机物研究中的应[J]. 光谱学与光谱分析, 2013, 33(3): 653-658.
[3] Kannan, R. and Vempala, S. (2009) Spectral Algorithms. Foundations and Trends® in Theoretical Computer Science, 4, 157-288. [Google Scholar] [CrossRef
[4] Kressner, D. (2005) Numerical Methods for General and Structured Eigenvalue Problems. Springer, Berlin Heidelberg.
[5] Wilkinson, J.H. (2001) Algebraic Eigenvalue Problem. Science Press, Beijing.
[6] Karow, M., Kressner, D. and Tisseur, F. (2006) Structured Eigenvalue Condition Numbers. SIAM Journal on Matrix Analysis and Applications, 28, 1052-1068. [Google Scholar] [CrossRef
[7] Graillat, S. (2006) A Note on Structured Pseudospectra. Journal of Computational and Applied Mathematics, 191, 68-76. [Google Scholar] [CrossRef
[8] Graillat, S. (2005) Structured Condition Number and Backward Error for Eigenvalue Problems. Technical Report.
[9] Adhikari, B. and Alam, R. (2009) Structured Backward Errors and Pseudospectra of Structured Matrix Pencils. SIAM Journal on Matrix Analysis and Applications, 31, 331-359. [Google Scholar] [CrossRef
[10] Rump, S.M. (2006) Eigenvalues, Pseudospectrum and Structured Perturbations. Linear Algebra and Its Applications, 413, 567-593. [Google Scholar] [CrossRef
[11] Noschese, S. and Reichel, L. (2017) Computing Unstructured and Structured Polynomial Pseudospectrum Approximations. Computational and Applied Mathematics, 350, 57-68. [Google Scholar] [CrossRef
[12] Alon, N., Krivelevich, M. and Van, H.V. (2002) On the Concentration of Eigenvalues of Random Symmetric Matrices. Israel Journal of Mathematics, 131, 259-267. [Google Scholar] [CrossRef
[13] Edwards, S.F. and Jones, R.C. (1976) The Eigenvalue Spectrum of a Large Symmetric Random Matrix. Journal of Physics A: Mathematical and General, 9, 1595-1603. [Google Scholar] [CrossRef
[14] Hiriart-Urruty, J.B. and Ye, D. (1995) Sensitivity Analysis of All Eigenvalues of a Symmetric Matrix. Numerische Mathematik, 70, 45-72. [Google Scholar] [CrossRef
[15] Hladik, M., Daney, D. and Tsigaridas, E. (2011) Characterizing and Approximating Eigenvalue Sets of Symmetric Interval Matrices. Computers & Mathematics with Applications, 62, 3152-3163. [Google Scholar] [CrossRef
[16] Hernandez, T.M., Beeumen, R.V., Caprio, M.A. and Yang, C. (2019) A Greedy Algorithm for Computing Eigenvalues of a Symmetric Matrix. Journal of Computational Physics. [Google Scholar] [CrossRef
[17] Reid, R.M. (1997) Some Eigenvalue Properties of Persymmetric Matrices. SIAM Review, 39, 313-316. [Google Scholar] [CrossRef
[18] Golub, G.H. and Charles, F. (1996) Matrix Computations. Johns Hopkins University Press, Baltimore.
[19] Rump, S.M. (1999) INTLAB-Interval Laboratory. In: Csendes, T., Ed., Developments in Reliable Computing, Kluwer Academic Publishers, Dordrecht, 77-104. [Google Scholar] [CrossRef
[20] Kantorovich, L.V. (1948) Functional Analysis and Applied Mathematics. Uspekhi Matematicheskikh Nauk, 3, 89-185. Translated by Benster, C.D. (1952) National Bureau of Standards Rept., Washington DC, 1509.
[21] Rump, S.M. (2010) Verification Methods: Rigorous Results Using Floating-Point Arithmetic. Acta Numerica, 19, 287-449. [Google Scholar] [CrossRef
[22] Rump, S.M. (1983) Solving Algebraic Problems with High Accuracy. In: Kulisch, U.W. and Miranker, W.L., Eds., A New Approach to Scientific Computation, Academic Press, San Diego, 51-120. [Google Scholar] [CrossRef
[23] Rall, L.B. (1980) A Comparision of the Existence Theorems of Kantorovich and Moore. SIAM Journal on Numerical Analysis, 17, 148-161. [Google Scholar] [CrossRef