A collection of inverse eigenvalue problems are identified and classified according to their characteristics. Current developments in both the theoretic and the algorithmic aspects are summarized and reviewed in this paper. This exposition also reveals many open questions that deserve further study. An extensive bibliography of pertinent literature is attached.
An inverse eigenvalue problem concerns the reconstruction of a structured matrix from prescribed spectral data. Such an inverse problem arises in many applications where parameters of a certain physical system are to be determined from the knowledge or expectation of its dynamical behaviour. Spectral information is entailed because the dynamical behaviour is often governed by the underlying natural frequencies and normal modes. Structural stipulation is designated because the physical system is often subject to some feasibility constraints. The spectral data involved may consist of complete or only partial information on eigenvalues or eigenvectors. The structure embodied by the matrices can take many forms. The objective of an inverse eigenvalue problem is to construct a matrix that maintains both the specific structure as well as the given spectral property. In this expository paper the emphasis is to provide an overview of the vast scope of this intriguing problem, treating some of its many applications, its mathematical properties, and a variety of numerical techniques.
The basic goal of an inverse eigenvalue problem is to reconstruct the physical parameters of a certain system from the knowledge or desire of its dynamical behavior. Depending on the application, inverse eigenvalue problems appear in many different forms. This book discusses the fundamental questions, some known results, many applications, mathematical properties, a variety of numerical techniques, as well as several open problems.
1 June 2003 in Linear Algebra and its Applications
The problems of computing least squares approximations for various types of real and symmetric matrices subject to spectral constraints share a common structure. This paper describes a general procedure in using the projected gradient method. It is shown that the projected gradient of the objective function on the manifold of constraints usually can be formulated explicitly. This gives rise to the construction of a descent flow that can be followed numerically. The explicit form also facilitates the computation of the second-order optimality conditions. Examples of applications are discussed. With slight modifications, the procedure can be extended to solve least squares problems for general matrices subject to singular-value constraints.
Any logical procedure that is used to reason or to infer either deductively or inductively, so as to draw conclusions or make decisions, can be called, in a broad sense, a realization process. A realization process usually assumes the recursive form that one state develops into another state by following a certain specific rule. Such an action is generally formalized as a dynamical system. In mathematics, especially for existence questions, a realization process often appears in the form of an iterative procedure or a differential equation. For years researchers have taken great effort to describe, analyse, and modify realization processes for various applications.The thrust in this exposition is to exploit the notion of dynamical systems as a special realization process for problems arising from the field of linear algebra. Several differential equations whose solutions evolve in submanifolds of matrices are cast in fairly general frameworks, of which special cases have been found to afford unified and fundamental insights into the structure and behaviour of existing discrete methods and, now and then, suggest new and improved numerical methods. In some cases, there are remarkable connections between smooth flows and discrete numerical algorithms. In other cases, the flow approach seems advantageous in tackling very difficult open problems. Various aspects of the recent development and application in this direction are discussed in this paper.