In this paper, least-squaxes mirrorsymmetric solution for matrix equations (AX = B, XC = D) and its optimal approximation is considered. With special expression of mirrorsymmetric matrices, a general representation of...In this paper, least-squaxes mirrorsymmetric solution for matrix equations (AX = B, XC = D) and its optimal approximation is considered. With special expression of mirrorsymmetric matrices, a general representation of solution for the least-squares problem is obtained. In addition, the optimal approximate solution and some algorithms to obtain the optimal approximation are provided.展开更多
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.展开更多
基金supported by National Natural Science Foundation of China(1057,1047).
文摘In this paper, least-squaxes mirrorsymmetric solution for matrix equations (AX = B, XC = D) and its optimal approximation is considered. With special expression of mirrorsymmetric matrices, a general representation of solution for the least-squares problem is obtained. In addition, the optimal approximate solution and some algorithms to obtain the optimal approximation are provided.
基金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.