Beresford N. Parlett. The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1998. Corrected reprint of the 1980 original.Beresford. N. Parlett. The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cuffs, NJ, 1980....
> 待分类 > Parlett B.N. The symmetric eigenvalue problem (SIAM, 1998)对称矩阵的特征值问题 打印 转格式 156阅读文档大小:2.48M426页惜缘@资料sha..上传于2012-11-12格式:PDF 第十八讲 广义特征值问题及对称矩阵特征值的极性 热度: 矩阵的特征值问题 ...
A new method is presented for the solution of the matrix eigenvalue problem Ax= 位Bx, where A and B are real symmetric square matrices and B is positive semidefinite. It reduces A and B to diagonal form by congruence transformations that preserve the symmetry of the problem. This method is...
Classics in Applied Mathematics(共90册), 这套丛书还有 《Iterative Solution of Nonlinear Equations in Several Variables》《Stochastic Processes with Applications》《Functions of a Complex Variable Theory and Technique》《Discourse on Fourier Series》《Optimal Design of Experiments》 等。
The method that we refer to asinfinite Lanczos, or shortly ILAN, consists of applying the indefinite Lanczos method (Algorithm 1), described in the next section, to the symmetric eigenvalue problem (10). 3Infinite Lanczos method 3.1Indefinite Lanczos method ...
El-Gebeily MA, Abu-Baker Y., Elgindi MB. (1999). The generalized eigenvalue problem for tridiagonal symmetric interval matrices. Int J Control; 72: 531-535.The generalized eigenvalue problem for tridiagonal symmetric interval matrices - El-Gebeily, Abu-Baker, et al. - 1999 () Citation ...
Eigenvalue techniques based on reduction by similarity transformations 123 Error analysis of methods based on elementary non-unitary trans- formations 124 Error analysis of methods based on elementary unitary transformations 126 Superiority of the unitary transformation 128 Real symmetric matrices 129...
We therefore study the convergence of the approximate eigenelements obtained by such a process. In particular, when the eigenvalues of A are real, we obtain bounds for the rates of convergence similar to those for the symmetric Lanczos algorithm. Some practical methods are presented in addition ...
Sincee^{\phi }is strictly positive and bounded onM, this quadratic form is non-negative, closed, symmetric and densely defined inL^2(M,e^\phi d\mu _g), and hence, generates the self-adjoint non-negative operator; see Theorem 2.6 in [30, Ch. 6.2]. We denote this operator by-\Delt...
Here, the Householder matrices are symmetric orthogonal transforms of the form: vvT Pi = I ? 2 vT v where v 2 <n and ( vj = 0 if j < i + 1 or j > i + 3 1 if j = i + 1 We assume the Hessenberg matrix is unreduced, and if not, nd the largest unreduced submatrix of...