 Perturbation Analysis of Matrix Equations and DecompositionsMihail M. Konstantinov () and
Petko H. Petkov ()
Chapter Chapter 7 in Numerical Algebra, Matrix Theory, Differential-Algebraic Equations and Control Theory, 2015, pp 161-197 from Springer Abstract: Abstract A matrix computational problem is a function which maps a set of data (usually in the form of a collection of matrices) into a matrix space whose elements are the desired solutions. If a particular data is perturbed then the corresponding solution is also perturbed. The goal of the norm-wise perturbation analysis is to estimate the norm of the perturbation in the solution as a function of the norms of the perturbations in the data. In turn, in the component-wise perturbation analysis the modules of the elements of the solution are estimated as functions of the modules of the perturbations in the data. The perturbation analysis can be local and nonlocal. In the local analysis it is supposed that the perturbations in the data are asymptotically small and a local bound for the perturbation in the solution is constructed which is valid for first order (small) perturbations. A disadvantage of the local analysis is that normally it does not have a priori measure on how ‘small’ the data perturbations must be in order to guarantee the results from the local estimates being correct. A desirable property of the local bounds is formulated as follows: a perturbation bound is asymptotically exact when for some perturbations it is arbitrarily close to the actual perturbed quantity. On the other hand the nonlocal perturbation analysis produces perturbation estimates which are rigorously valid in a certain set of data perturbations. The price of this advantage is that the nonlocal perturbation bounds may be too pessimistic in certain cases and/or the domain of validity of these bounds may be relatively small. However, a desirable property of the nonlocal bounds is that within first order perturbations they coincide with the improved local bounds. In this chapter we consider the basic methods for perturbation analysis of matrix algebraic equations and unitary (orthogonal in particular) matrix decompositions. The nonlocal perturbation analysis of matrix equations includes several steps: (a) reformulation of the perturbed problem as an equivalent operator equation with respect to the perturbation in the solution; (b) construction of a Lyapunov majorant for the corresponding operator; (c) application of fixed point principles in order to prove that the perturbed equation has a solution; (d) estimation of the solution of the associated majorant equation. The latter estimate gives the desired nonlocal perturbation bound. The nonlocal perturbation analysis of unitary matrix decompositions is based on a systematic use of the method of splitting operators and vector Lyapunov majorants. In this way nonlocal perturbation bounds are derived for the basic unitary decompositions of matrices (QR decomposition and Schur decomposition in particular) and for important problems in the theory of linear time-invariant control systems: transformation into unitary canonical form and synthesis of closed-loop systems with desired equivalent form. Keywords: Local Perturbation Analysis; Algebraic Matrix Equation; Major Lyapunov; Majorant Equation; Schur Decomposition (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-15260-8_7 Ordering information: This item can be ordered from DOI: 10.1007/978-3-319-15260-8_7 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.