In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative meth...In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.展开更多
In this paper we first present a CG-type method for inverse eigenvalue problem of constructing real and symmetric matrices M,D and K for the quadratic pencil Q(λ)=λ^(2)M+λD+K,so that Q(λ)has a prescribed subset of...In this paper we first present a CG-type method for inverse eigenvalue problem of constructing real and symmetric matrices M,D and K for the quadratic pencil Q(λ)=λ^(2)M+λD+K,so that Q(λ)has a prescribed subset of eigenvalues and eigenvectors.This method can determine the solvability of the inverse eigenvalue problem automatically.We then consider the least squares model for updating a quadratic pencil Q(λ).More precisely,we update the model coefficient matrices M,C and K so that(i)the updated model reproduces the measured data,(ii)the symmetry of the original model is preserved,and(iii)the difference between the analytical triplet(M,D,K)and the updated triplet(M_(new),D_(new),K_(new))is minimized.In this paper a computationally efficient method is provided for such model updating and numerical examples are given to illustrate the effectiveness of the proposed method.展开更多
文摘In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.
基金Research supported by National Natural Science Foundation of China(10571047 and 10861005)Provincial Natural Science Foundation of Guangxi(0991238)。
文摘In this paper we first present a CG-type method for inverse eigenvalue problem of constructing real and symmetric matrices M,D and K for the quadratic pencil Q(λ)=λ^(2)M+λD+K,so that Q(λ)has a prescribed subset of eigenvalues and eigenvectors.This method can determine the solvability of the inverse eigenvalue problem automatically.We then consider the least squares model for updating a quadratic pencil Q(λ).More precisely,we update the model coefficient matrices M,C and K so that(i)the updated model reproduces the measured data,(ii)the symmetry of the original model is preserved,and(iii)the difference between the analytical triplet(M,D,K)and the updated triplet(M_(new),D_(new),K_(new))is minimized.In this paper a computationally efficient method is provided for such model updating and numerical examples are given to illustrate the effectiveness of the proposed method.