Tight frames, also known as general Welch-bound-equality sequences, generalize orthonormal systems. Numerous applications-including communications, coding, and …
Inverse eigenvalue problems arise in a remarkable variety of applications and associated with any inverse eigenvalue problem are two fundamental questions—the theoretical issue …
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 …
An inverse eigenvalue problem concerns the reconstruction of a structured matrix from prescribed spectral data. Such an inverse problem arises in many applications where …
R Orsi, U Helmke, JB Moore - Automatica, 2006 - Elsevier
This paper presents a Newton-like algorithm for solving systems of rank constrained linear matrix inequalities. Though local quadratic convergence of the algorithm is not a priori …
Y Wang, X Xu, Y Luo - Computers & Structures, 2021 - Elsevier
This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained …
MT Chu - Fields Institute Communications, 1994 - Citeseer
Many mathematical problems, such as existence questions, are studied by using an appropriate realization process, either iteratively or continuously. This article is a collection …
The Cayley transform method is a Newton-like method for solving inverse eigenvalue problems. If the problem is large, one can solve the Jacobian equation by iterative methods …
We propose and analyze a pseudotransient continuation algorithm for dynamics on subsets of R^N. Examples include certain flows on manifolds and the dynamic formulation of bound …