We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value optimization characterization for this problem and illustrate its usefulness for two applications. First, the characterization yields a singular value formula for determining the nearest pencil whose eigenvalues lie in a specified region in the complex plane. For instance, this enables the numerical computation of the nearest stable descriptor system in control theory. Second, the characterization partially solves the problem posed in Boutry et al. (2005, SIAM J. Matrix Anal. Appl., 27, 582–601) regarding the distance from a general rectangular pencil to the nearest pencil with a complete set of eigenvalues. The involved singular value optimization problems are solved by means of Broyden-Fletcher-Goldfarb-Shanno and Lipschitz-based global optimization algorithms.
3 May 2015 in ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik
In this paper, we present the Sherman–Morrison–Woodbury-type formula for the solution of the Sylvester equation of the form as well as for the solution of the T-Sylvester equation of the form where U1, U2, V1, V2 are low-rank matrices. Although the matrix version of this formula for the Sylvester equation has been used in several different applications (but not for the case of a T-Sylvester equation), we present a novel approach using a proper operator representation. This novel approach allows us to derive a matrix version of the Sherman–Morrison–Woodbury-type formula for the Sylvester equation as well as for the T-Sylvester equation which seems to be new. We also present algorithms for the efficient calculation of the solution of structured Sylvester and T-Sylvester equations by using these formulas and illustrate their application in several examples.
1 April 2019 in Applied Mathematics and Computation