首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
Backward errors for the symmetric matrix inverse eigenvalue problem with respect to an approximate solution are defined, and explicit expressions of the backward errors are derived. The expressions may be useful for testing the stability of practical algorithms. Received August 4, 1997 / Revised version received May 11, 1998  相似文献   

2.
A backward error for inverse singular value problems with respect to an approximate solution is defined, and an explicit expression for the backward error is derived by extending the approach described in [J.G. Sun, Backward errors for the inverse eigenvalue problem, Numer. Math. 82 (1999) 339-349]. The expression may be useful for testing the stability of practical algorithms.  相似文献   

3.
Summary. We present bounds on the backward errors for the symmetric eigenvalue decomposition and the singular value decomposition in the two-norm and in the Frobenius norm. Through different orthogonal decompositions of the computed eigenvectors we can define different symmetric backward errors for the eigenvalue decomposition. When the computed eigenvectors have a small residual and are close to orthonormal then all backward errors tend to be small. Consequently it does not matter how exactly a backward error is defined and how exactly residual and deviation from orthogonality are measured. Analogous results hold for the singular vectors. We indicate the effect of our error bounds on implementations for eigenvector and singular vector computation. In a more general context we prove that the distance of an appropriately scaled matrix to its orthogonal QR factor is not much larger than its distance to the closest orthogonal matrix. Received July 19, 1993  相似文献   

4.
We discuss the perturbation analysis for eigenvalues and eigenvectors of structured homogeneous matrix polynomials with Hermitian, skew-Hermitian, H-even and H-odd structure. We construct minimal structured perturbations (structured backward errors) such that an approximate eigenvalue and eigenvector pair (finite or infinite eigenvalues) is an exact eigenvalue eigenvector pair of an appropriately perturbed structured matrix polynomial. We present various comparisons with unstructured backward errors and previous backward errors constructed for the non-homogeneous case and show that our results generalize previous results.  相似文献   

5.
§1 IntroductionWe considerthe following inverse eigenvalue problem offinding an n-by-n matrix A∈S such thatAxi =λixi,i =1,2 ,...,m,where S is a given set of n-by-n matrices,x1 ,...,xm(m≤n) are given n-vectors andλ1 ,...,λmare given constants.Let X=(x1 ,...,xm) ,Λ=(λ1 ,λ2 ,...,λm) ,then the above inverse eigenvalue problemcan be written as followsProblem Given X∈Cn×m,Λ=(λ1 ,...,λm) ,find A∈S such thatAX =XΛ,where S is a given matrix set.We also discuss the so-called opti…  相似文献   

6.
In this paper, the constrained inverse eigenvalue problem and associated approximation problem for normal matrices are considered. The solvability conditions and general solutions of the constrained inverse eigenvalue problem are presented, and the expression of the solution for the optimal approximation problem is obtained.  相似文献   

7.
In this paper, the inverse eigenvalue problem of Hermitian generalized anti-Hamihonian matrices and relevant optimal approximate problem are considered. The necessary and sufficient conditions of the solvability for inverse eigenvalue problem and an expression of the general solution of the problem are derived. The solution of the relevant optimal approximate problem is given.  相似文献   

8.
This paper involves related inverse eigenvalue problems of reflexive matrices and their optimal approximation, the sufficient and necessary conditions under which the solvable problems of inverse eigenvalue, and the general provided form of the solution. Furthermore, the algorithm to compute the optimal approximate solution and some numerical experiments are given.  相似文献   

9.
Through different orthogonal decompositions of computed eigenvectors we can define different Hermitian backward perturbations for a Hermitian eigenvalue problem. Certain optimal Hermitian backward perturbations are studied. The results show that not all the optimal Hermitian backward perturbations are small when the computed eigenvectors have a small residual and are close to orthonormal.Dedicated to Åke Björck on the occasion of his 60th birthdayThis work was supported by the Swedish Natural Science Research Council under Contract F-FU 6952-302 and the Department of Computing Science, Umeå University.  相似文献   

10.
In this paper, we present a normwise perturbation theory for the regular generalized eigenproblem Ax = λBx, when λ is a semi-simple and finite eigenvalue, which departs from the classical analysis with the chordal norm [9]. A backward error and a condition number are derived for a choice of flexible measure to represent independent perturbations in the matrices A and B. The concept of optimal backward error associated with an eigenvalue only is also discussed. © 1998 John Wiley & Sons, Ltd.  相似文献   

11.
给出了严格对角占优M-矩阵的逆矩阵的无穷大范数上界新的估计式,进而给出严格对角占优M-矩阵的最小特征值下界的估计式.新估计式改进了已有文献的结果.  相似文献   

12.
This paper studies inverse eigenvalue problems of generalized reflexive matrices and their optimal approximations. Necessary and sufficient conditions for the solvability of the problems are derived, the solutions and their optimal approximations are provided.  相似文献   

13.
A partially described inverse eigenvalue problem and an associated optimal approximation problem for generalized K-centrohermitian matrices are considered. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solution of the inverse eigenproblem exists, the optimal approximation problem can be solved. The formula of its unique solution is given.  相似文献   

14.
本文研究实矩阵关于复近似特征对的范数型向后误差.在复扰动情形,这个问题已被Higham 等学者解决.本文研究实扰动情形.结果表明,通常情况下,两种情形差别不大,但在某些情形,二者可以相差很大.作为推广,我们还讨论了矩阵多项式的相应问题.文中的一个结果部分地解决了D.J.Higham和N.J.Higham 1999年提出的一个待解决的问题.  相似文献   

15.
1 引言 在信号处理、时间序列分析中,QR分解有重要应用.设X_n={x_1~H…x_n~H}为n×p矩阵,每个x_i~H都是落入某个正则区间的数据样本。若序列{X_i~H}非平稳,则需要压缩老数据以抑制其污染新数据所带的信息。指数窗法是解决这个问题的一种重要而又常用  相似文献   

16.
Summary. This paper explores the relationship between certain inverse unitary eigenvalue problems and orthogonal functions. In particular, the inverse eigenvalue problems for unitary Hessenberg matrices and for Schur parameter pencils are considered. The Szeg? recursion is known to be identical to the Arnoldi process and can be seen as an algorithm for solving an inverse unitary Hessenberg eigenvalue problem. Reformulation of this inverse unitary Hessenberg eigenvalue problem yields an inverse eigenvalue problem for Schur parameter pencils. It is shown that solving this inverse eigenvalue problem is equivalent to computing Laurent polynomials orthogonal on the unit circle. Efficient and reliable algorithms for solving the inverse unitary eigenvalue problems are given which require only O() arithmetic operations as compared with O() operations needed for algorithms that ignore the structure of the problem. Received April 3, 1995 / Revised version received August 29, 1996  相似文献   

17.
反中心对称矩阵的广义特征值反问题   总被引:8,自引:0,他引:8  
Given matrix X and diagonal matrix A , the anti-centrosymmetric solutions (A, B) and its optimal approximation of inverse generalized eigenvalue problem AX = BXA have been considered. The general form of such solutions is given and the expression of the optimal approximation solution to a given matrix is derived. The algorithm and one numerical example for solving optimal approximation solution are included.  相似文献   

18.
Heavily damped quadratic eigenvalue problem (QEP) is a special type of QEPs. It has a large gap between small and large eigenvalues in absolute value. One common way for solving QEP is to linearize the original problem via linearizations. Previous work on the accuracy of eigenpairs of not heavily damped QEP focuses on analyzing the backward error of eigenpairs relative to linearizations. The objective of this paper is to explain why different linearizations lead to different errors when computing small and large eigenpairs. To obtain this goal, we bound the backward error of eigenpairs relative to the linearization methods. Using these bounds, we build upper bounds of growth factors for the backward error. We present results of numerical experiments that support the predictions of the proposed methods.  相似文献   

19.
谱约束下对称正交对称矩阵束的最佳逼近   总被引:3,自引:0,他引:3  
讨论了对称正交对称矩阵的广义逆特征值问题,得到了通解表达式和最佳解的表达式。  相似文献   

20.
k次R-对称矩阵的特征值反问题及最佳逼近问题   总被引:1,自引:0,他引:1  
<正>1引言在[7]中,Trench推广了中心对称矩阵和自反矩阵的概念定义了R-对称矩阵,采用一个统一的方式证明了许多已有的结论并得到更强的结果.在Trench工作的基础上,文[6]定义了k次R-对称矩阵,并指出对于任意奇异的Hermitian矩阵A,都存在k次单位矩阵R  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号