With the increasingly widespread application of linear algebra theory, and in its opposite direction is not enough emphasis, linear algebra, several important points： matrix, determinant, linear equations, linear tra...With the increasingly widespread application of linear algebra theory, and in its opposite direction is not enough emphasis, linear algebra, several important points： matrix, determinant, linear equations, linear transformations, matrix keratosis and other anti-deepening understanding of the basics and improve the comprehensive ability to solve problems.展开更多
The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficie...The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficients of spring and mass of the system can be obtained and the rigidity and mass matrices of an initially designed structure can be reconstructed through solving linear algebra equations. By using implicit function theorem, the conditions of existence and uniqueness of the solution are also deduced. The theory and method can be used for inverse vibration design of complex structure system.展开更多
Applying constructed homotopy and its properties,we gel some sufficient conditions for the solvability of algebraic inverse eigenvalue problems,which are better than that of the paper [4] in some cases. Inverse eigenv...Applying constructed homotopy and its properties,we gel some sufficient conditions for the solvability of algebraic inverse eigenvalue problems,which are better than that of the paper [4] in some cases. Inverse eigenvalue problems,solvability,sufficient conditions.展开更多
By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-H...By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.展开更多
In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the ...In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the least residual problem of the above generalized inverse eigenvalue problem is studied by using the canonical correlation decomposition（CCD）.The solutions to these problems are derived.Some numerical examples are given to illustrate the main results.展开更多
The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such th...The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such that AX = X(?), where BSHn×n≥ denotes the set of all n×n quaternion matrices which are bi-self-conjugate and nonnegative definite. Problem Ⅱ2= Given B ∈ Hn×m, find B ∈ SE such that ||B-B||Q = minAE∈=sE ||B-A||Q, where SE is the solution set of problem I , || ·||Q is the quaternion matrix norm. The necessary and sufficient conditions for SE being nonempty are obtained. The general form of elements in SE and the expression of the unique solution B of problem Ⅱ are given.展开更多
In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of co...In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.展开更多
is gained by deleting the k<sup>th</sup> row and the k<sup>th</sup> column （k=1,2,...,n） from T<sub>n</sub>.We put for-ward an inverse eigenvalue problem to be that:If we don’t k...is gained by deleting the k<sup>th</sup> row and the k<sup>th</sup> column （k=1,2,...,n） from T<sub>n</sub>.We put for-ward an inverse eigenvalue problem to be that:If we don’t know the matrix T<sub>1,n</sub>,but weknow all eigenvalues of matrix T<sub>1,k-1</sub>,all eigenvalues of matrix T<sub>k+1,k</sub>,and all eigenvaluesof matrix T<sub>1,n</sub> could we construct the matrix T<sub>1,n</sub>.Let μ<sub>1</sub>,μ<sub>2</sub>,…,μ<sub>k-1</sub>,μ<sub>k</sub>,μ<sub>k+1</sub>,…,μ<sub>n-1</sub>,展开更多
An Inverse perturbation method is described for solving the general inverse eigenvalue problem. By taking the analysis of the rotor system as example based upon FEM, the new inverse perturbation method for structural ...An Inverse perturbation method is described for solving the general inverse eigenvalue problem. By taking the analysis of the rotor system as example based upon FEM, the new inverse perturbation method for structural design with specified low-order natural frequencies or frequency constraint bands is detailed as well as its complete theoretical basis. Moreover, formulations to calculate the inverse perturbation parameter ε and method to select the corresponding ε's value properly are also proposed. The proposed method is characterized in reducing frequency analysis and suitable for large and small structrual changes alike. Finally, several different numerical examples for inverse cigenvalue problem are discussed to illustrate the method, which show that this inverse perturbation method Is general and can be applied to other type of structure or dement.展开更多
1 IntroductionLet R<sup>n×n</sup> be the set of all n×n real matrices.R<sup>n</sup>=R<sup>n×1</sup>.C<sup>n×n</sup>denotes the set of all n×n co...1 IntroductionLet R<sup>n×n</sup> be the set of all n×n real matrices.R<sup>n</sup>=R<sup>n×1</sup>.C<sup>n×n</sup>denotes the set of all n×n complex matrices.We are interested in solving the following inverse eigenvalue prob-lems:Problem A （Additive inverse eigenvalue problem） Given an n×n real matrix A=(a<sub>ij</sub>),and n distinct real numbers λ<sub>1</sub>,λ<sub>2</sub>,…,λ<sub>n</sub>,find a real n×n diagonal matrix展开更多
We present a differential geometric perspective of the IEP for symmetric matrices in the framework of a fibre bundle with structure group SO（n）. In particular, a Newton type algorithm is developed to construct a non...We present a differential geometric perspective of the IEP for symmetric matrices in the framework of a fibre bundle with structure group SO（n）. In particular, a Newton type algorithm is developed to construct a non singular symmetric matrix for given target eigenvalues using a singular symmetric matrix as the initial matrix for the iteration. Explicit computations are performed for 2 x 2 non singular symmetric matrix to illustrate the result.展开更多
In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current ...In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.展开更多
In this paper, an inverse problem on Jacobi matrices presented by Shieh in 2004 is studied. Shieh＇s result is improved and a new and stable algorithm to reconstruct its solution is given. The numerical examples is al...In this paper, an inverse problem on Jacobi matrices presented by Shieh in 2004 is studied. Shieh＇s result is improved and a new and stable algorithm to reconstruct its solution is given. The numerical examples is also given.展开更多
Given a list of real numbers ∧={λ1,…, λn}, we determine the conditions under which ∧will form the spectrum of a dense n × n singular symmetric matrix. Based on a solvability lemma, an algorithm to compute th...Given a list of real numbers ∧={λ1,…, λn}, we determine the conditions under which ∧will form the spectrum of a dense n × n singular symmetric matrix. Based on a solvability lemma, an algorithm to compute the elements of the matrix is derived for a given list ∧ and dependency parameters. Explicit computations are performed for n≤5 and r≤4 to illustrate the result.展开更多
In this paper the unsolvability of generalized inverse eigenvalue problems almost everywhere is discussed.We first give the definitions for the unsolvability of generalized inverse eigenvalue problems almost everywher...In this paper the unsolvability of generalized inverse eigenvalue problems almost everywhere is discussed.We first give the definitions for the unsolvability of generalized inverse eigenvalue problems almost everywhere.Then adopting the method used in [14],we present some sufficient conditions such that the generalized inverse eigenvalue problems are unsohable almost everywhere.展开更多
We present new sufficient conditions on the solvability and numericalmethods for the following multiplicative inverse eigenvalue problem: Given an n × nreal matrix A and n real numbers λ1 , λ2 , . . . ,λn, fin...We present new sufficient conditions on the solvability and numericalmethods for the following multiplicative inverse eigenvalue problem: Given an n × nreal matrix A and n real numbers λ1 , λ2 , . . . ,λn, find n real numbers c1 , c2 , . . . , cn suchthat the matrix diag(c1, c2,..., cn)A has eigenvalues λ1, λ2,..., λn.展开更多
A kind of inverse eigenvalue problem in structural dynamics design is considered. The problem is formulated as an optimization problem. The properties of this problem are analyzed, and the existence of the optimum sol...A kind of inverse eigenvalue problem in structural dynamics design is considered. The problem is formulated as an optimization problem. The properties of this problem are analyzed, and the existence of the optimum solution is proved. The directional derivative of the objective function is obtained and a necessary condition for a point to be a local minimum point is given. Then a numerical algorithm for solving the problem is presented and a plane-truss problem is discussed to show the applications of the theories and the algorithm.展开更多
Let H∈Cn×n be an n×n unitary upper Hessenberg matrix whose subdiagonal elements are all positive.Partition H as H=[H11 H12 H21 H22],(0.1)where H11 is its k×k leading principal submatrix;H22 is the comp...Let H∈Cn×n be an n×n unitary upper Hessenberg matrix whose subdiagonal elements are all positive.Partition H as H=[H11 H12 H21 H22],(0.1)where H11 is its k×k leading principal submatrix;H22 is the complementary matrix of H11.In this paper,H is constructed uniquely when its eigenvalues and the eigenvalues of(H|^)11 and(H|^)22 are known.Here(H|^)11 and(H|^)22 are rank-one modifications of H11 and H22 respectively.展开更多
In this article,we discuss singular Hermitian matrices of rank greater or equal to four for an inverse eigenvalue problem.Specifically,we look into how to generate n by n singular Hermitian matrices of ranks four and ...In this article,we discuss singular Hermitian matrices of rank greater or equal to four for an inverse eigenvalue problem.Specifically,we look into how to generate n by n singular Hermitian matrices of ranks four and five from a prescribed spectrum.Numerical examples are presented in each case to illustrate these scenarios.It was established that given a prescribed spectral datum and it multiplies,then the solubility of the inverse eigenvalue problem for n by n singular Hermitian matrices of rank r exists.展开更多
文摘With the increasingly widespread application of linear algebra theory, and in its opposite direction is not enough emphasis, linear algebra, several important points： matrix, determinant, linear equations, linear transformations, matrix keratosis and other anti-deepening understanding of the basics and improve the comprehensive ability to solve problems.
基金Science Developing Plan of Beijing Educational Committee, Beijing Natural Science Fund (No. 3022003), and NationalNatural Science Fund of China(No.50375002)
文摘The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficients of spring and mass of the system can be obtained and the rigidity and mass matrices of an initially designed structure can be reconstructed through solving linear algebra equations. By using implicit function theorem, the conditions of existence and uniqueness of the solution are also deduced. The theory and method can be used for inverse vibration design of complex structure system.
文摘Applying constructed homotopy and its properties,we gel some sufficient conditions for the solvability of algebraic inverse eigenvalue problems,which are better than that of the paper [4] in some cases. Inverse eigenvalue problems,solvability,sufficient conditions.
基金Project(10171031) supported by the National Natural Science Foundation of China
文摘By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.
基金Supported by the Key Discipline Construction Project of Tianshui Normal University
文摘In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the least residual problem of the above generalized inverse eigenvalue problem is studied by using the canonical correlation decomposition（CCD）.The solutions to these problems are derived.Some numerical examples are given to illustrate the main results.
基金This work is supported by the NSF of China (10471039, 10271043) and NSF of Zhejiang Province (M103087).
文摘The main aim of this paper is to discuss the following two problems: Problem I: Given X ∈ Hn×m (the set of all n×m quaternion matrices), A = diag(λ1,…, λm) EEEEE Hm×m, find A ∈ BSHn×n≥such that AX = X(?), where BSHn×n≥ denotes the set of all n×n quaternion matrices which are bi-self-conjugate and nonnegative definite. Problem Ⅱ2= Given B ∈ Hn×m, find B ∈ SE such that ||B-B||Q = minAE∈=sE ||B-A||Q, where SE is the solution set of problem I , || ·||Q is the quaternion matrix norm. The necessary and sufficient conditions for SE being nonempty are obtained. The general form of elements in SE and the expression of the unique solution B of problem Ⅱ are given.
文摘In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.
基金Project 19771020 supported by National Science Foundation of China
文摘is gained by deleting the k<sup>th</sup> row and the k<sup>th</sup> column （k=1,2,...,n） from T<sub>n</sub>.We put for-ward an inverse eigenvalue problem to be that:If we don’t know the matrix T<sub>1,n</sub>,but weknow all eigenvalues of matrix T<sub>1,k-1</sub>,all eigenvalues of matrix T<sub>k+1,k</sub>,and all eigenvaluesof matrix T<sub>1,n</sub> could we construct the matrix T<sub>1,n</sub>.Let μ<sub>1</sub>,μ<sub>2</sub>,…,μ<sub>k-1</sub>,μ<sub>k</sub>,μ<sub>k+1</sub>,…,μ<sub>n-1</sub>,
基金This research is supported by China National Natural Science Foundation (CNNSF), Research Grant No. 50128504
文摘An Inverse perturbation method is described for solving the general inverse eigenvalue problem. By taking the analysis of the rotor system as example based upon FEM, the new inverse perturbation method for structural design with specified low-order natural frequencies or frequency constraint bands is detailed as well as its complete theoretical basis. Moreover, formulations to calculate the inverse perturbation parameter ε and method to select the corresponding ε's value properly are also proposed. The proposed method is characterized in reducing frequency analysis and suitable for large and small structrual changes alike. Finally, several different numerical examples for inverse cigenvalue problem are discussed to illustrate the method, which show that this inverse perturbation method Is general and can be applied to other type of structure or dement.
文摘1 IntroductionLet R<sup>n×n</sup> be the set of all n×n real matrices.R<sup>n</sup>=R<sup>n×1</sup>.C<sup>n×n</sup>denotes the set of all n×n complex matrices.We are interested in solving the following inverse eigenvalue prob-lems:Problem A （Additive inverse eigenvalue problem） Given an n×n real matrix A=(a<sub>ij</sub>),and n distinct real numbers λ<sub>1</sub>,λ<sub>2</sub>,…,λ<sub>n</sub>,find a real n×n diagonal matrix
文摘We present a differential geometric perspective of the IEP for symmetric matrices in the framework of a fibre bundle with structure group SO（n）. In particular, a Newton type algorithm is developed to construct a non singular symmetric matrix for given target eigenvalues using a singular symmetric matrix as the initial matrix for the iteration. Explicit computations are performed for 2 x 2 non singular symmetric matrix to illustrate the result.
基金Supported by the National Natural Science Foundation of China(11971433)First Class Discipline of Zhe-jiang-A(Zhejiang Gongshang University-Statistics,1020JYN4120004G-091),Graduate Scientic Research and Innovation Foundation of Zhejiang Gongshang University.
文摘In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.
基金Project supported by the National Natural Science Foundation of China （Grant No.10271074）
文摘In this paper, an inverse problem on Jacobi matrices presented by Shieh in 2004 is studied. Shieh＇s result is improved and a new and stable algorithm to reconstruct its solution is given. The numerical examples is also given.
文摘Given a list of real numbers ∧={λ1,…, λn}, we determine the conditions under which ∧will form the spectrum of a dense n × n singular symmetric matrix. Based on a solvability lemma, an algorithm to compute the elements of the matrix is derived for a given list ∧ and dependency parameters. Explicit computations are performed for n≤5 and r≤4 to illustrate the result.
文摘In this paper the unsolvability of generalized inverse eigenvalue problems almost everywhere is discussed.We first give the definitions for the unsolvability of generalized inverse eigenvalue problems almost everywhere.Then adopting the method used in [14],we present some sufficient conditions such that the generalized inverse eigenvalue problems are unsohable almost everywhere.
文摘We present new sufficient conditions on the solvability and numericalmethods for the following multiplicative inverse eigenvalue problem: Given an n × nreal matrix A and n real numbers λ1 , λ2 , . . . ,λn, find n real numbers c1 , c2 , . . . , cn suchthat the matrix diag(c1, c2,..., cn)A has eigenvalues λ1, λ2,..., λn.
基金This research is partially supported by the National Natural Science Foundation of China (No. 10271055).
文摘A kind of inverse eigenvalue problem in structural dynamics design is considered. The problem is formulated as an optimization problem. The properties of this problem are analyzed, and the existence of the optimum solution is proved. The directional derivative of the objective function is obtained and a necessary condition for a point to be a local minimum point is given. Then a numerical algorithm for solving the problem is presented and a plane-truss problem is discussed to show the applications of the theories and the algorithm.
基金This work is supported by the Natural Science Foundation of Fujian Province of China(No.Z0511010)the Natural Science Foundation of China(No.10571012).
文摘Let H∈Cn×n be an n×n unitary upper Hessenberg matrix whose subdiagonal elements are all positive.Partition H as H=[H11 H12 H21 H22],(0.1)where H11 is its k×k leading principal submatrix;H22 is the complementary matrix of H11.In this paper,H is constructed uniquely when its eigenvalues and the eigenvalues of(H|^)11 and(H|^)22 are known.Here(H|^)11 and(H|^)22 are rank-one modifications of H11 and H22 respectively.
文摘In this article,we discuss singular Hermitian matrices of rank greater or equal to four for an inverse eigenvalue problem.Specifically,we look into how to generate n by n singular Hermitian matrices of ranks four and five from a prescribed spectrum.Numerical examples are presented in each case to illustrate these scenarios.It was established that given a prescribed spectral datum and it multiplies,then the solubility of the inverse eigenvalue problem for n by n singular Hermitian matrices of rank r exists.
