Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system
|
|
- Adela Austin
- 5 years ago
- Views:
Transcription
1 Advances in Computational Mathematics 7 (1997) Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Mihail Konstantinov a and Vera Angelova b a University of Architecture and Civil Engineering, 1 Hr. Smirnenski Blv., 1421 Sofia, Bulgaria mmk fte@bgace5.uacg.acad.bg b Institute of Information Technologies, Akad. G. Bontchev Str., Bl.2, 1113 Sofia, Bulgaria vera@bgcict.acad.bg Received February 1995; revised December 1996 Communicated by S. Hammarling Perturbation bounds are given for the solution of the nth order differential matrix Riccati equation using the associated linear 2nth order differential system. The new bounds are alternative to those existing in the literature and are sharper in some cases. Keywords: differential matrix Riccati equation, matrix exponential, sensitivity analysis, linear quadratic optimization, optimal filtering AMS subject classification: 93B35, 93B4 1. Introduction The solution of the differential matrix Riccati equation (DMRE) arising in the theory of linear quadratic optimization and optimal filtering is usually contaminated with rounding and parameter errors. This may lead to significant loss of accuracy and, in particular, to breaking of symmetry and divergence of the numerical procedure, carried out in floating-point computing environment. In turn, the actual error in the computed solution depends on the sensitivity of the solution of DMRE to perturbations in its matrix coefficients. Hence obtaining perturbation bounds for DMRE is important from both the theoretical and computational point of view. The sensitivity of the solution to DMRE is studied in several papers, see, e.g., [3] and [4]. However, these estimates may be pessimistic in some cases. In [6] a new approach is presented to estimate the sensitivity of the solution of DMRE. It is based on the sensitivity analysis of the associated linear differential system and exploits the existing sensitivity estimates [1,2,5,8,9] for the matrix exponential. This paper was partially supported by the National Scientific Research Foundation under Grants TH 44/94 and I 612/96. J.C. Baltzer AG, Science Publishers
2 296 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation In this paper we propose an improved sensitivity estimate for DMRE in 2-norm, based on the approach from [6]. An experimental analysis is made to compare the effectiveness of the different approaches. It is shown that in some cases the new bound is superior relative to the known ones [3,4], i.e., all these bounds are complementary. In what follows we denote by R m n the space of real m n matrices, R + = [, ), is the 2- (or spectral) norm in R m n, A T R n m is the transpose of the matrix A R m n, I n is the unit n n matrix, and the symbol := stands for equal by definition. 2. Statement of the problem Consider the DMRE P (t) = P (t)sp(t) + A T P(t) + P(t)A + Q, t R +, P () = F, where A, S, Q, F, P (t) R n n and the matrices S, Q, F, P (t) are symmetric and nonnegative definite. The linear 2n-dimensional differential equation associated to (1) is Ψ (t) = MΨ(t), Ψ() = I 2n ; M := [ ] A S Q A T := (1) [ ] M11 M 12. (2) M 21 M 22 The solution of (2) is [ ] Ψ(t) = e Mt Ψ11 (t) Ψ := 12 (t). (3) Ψ 21 (t) Ψ 22 (t) If the inverse of the matrix J (t) :=Ψ 11 (t) + Ψ 12 (t)f exists, then the solution of the initial value problem (1) is represented as P (t) = ( Ψ 21 (t) + Ψ 22 (t)f )( Ψ 11 (t) + Ψ 12 (t)f ) 1 := H(t)J 1 (t). (4) Let the round-off and parameter errors accompanying the numerical computations be represented by equivalent perturbations in the data: A A = A + A, S S = S + S, Q Q = Q + Q, F F = F + F, where Z (Z = A, S, Q, F ) is a matrix perturbation in Z with Z Z. Usually only a bound Z on the norm of the perturbation Z is known. When Z is the equivalent perturbation caused by the implementation of a numerically stable method for the solution of (1), then Z eps ϕ(n) Z, where eps is the round-off unit of the machine arithmetic and ϕ(n) is a low order polynomial in n. Denote by P = P + P the solution of the perturbed equation (1) in which Z is replaced by Z (Z = A, S, Q, F ). Then knowing the sensitivity of Ψ(t)
3 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation 297 to perturbations in A, S, Q, F we may estimate the sensitivity of P (t) which is measured by the quantity P (t). The main problems to be solved in this paper are: (i) Find an interval T = [, t ) such that for each t T the matrix J (t) + J (t) :=Ψ 11 (t) + Ψ 11 (t) + ( Ψ 12 (t) + Ψ 12 (t) ) (F + F ) is invertible and a representation of type (4) holds for the perturbed solution where P (t) + P (t) = ( H(t) + H(t) )( J (t) + J (t) ) 1, (5) H(t):= Ψ 21 (t) + Ψ 22 (t) F + Ψ 22 (t)f + Ψ 22 (t) F, J (t):= Ψ 11 (t) + Ψ 12 (t) F + Ψ 12 (t)f + Ψ 12 (t) F. (ii) Find a domain Ω R 4 +, Ω, and an estimate P (t) f(t, ), := [ A, S, Q, F ] T, (6) where the function f : T Ω R + is real analytic, non-decreasing in each component of and f(t,)=. 3. Main results From (3) we have that Ψ 11 () = I n, Ψ 12 () = and(ψ 11 ()+Ψ 12 ()F ) 1 = I n. Denote by σ 1 (t) σ 2 (t) σ n (t) the singular values of the matrix Ψ 11 (t) and let Ψ(t) be the perturbation in Ψ(t), which results from the data perturbations when solving the perturbed system (2), i.e., Ψ(t) = e (M+ M)t e Mt. Then the interval T = [, t ) may be chosen from t := sup { t: Ψ11 (t) + ( Ψ12 (t) + Ψ12 (t) )( F + F ) σn (t) }. (7) Using (5) we get P (t) = ( H(t) + H(t) )( J (t) + J (t) ) 1 H(t)J 1 (t) = ( H(t) P(t) J(t) ) (J(t)+ J(t) ) 1. (8) It is known [7] that for any matrices X, Y R n n such that X 1 exists and X 1 Y <1 the quantity (I n + X 1 Y ) 1 may be estimated as ( I n + X 1 Y ) X 1 Y.
4 298 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation Hence (8) yields the following bound for the norm of P (t) ( ) P (t) H(t) + P (t) J (t) J 1 (t) 1 J 1 (t) J (t) provided J 1 (t) J (t) < 1. (9) To obtain bounds for J (t) and H(t) we use the fact that for M = [M ij ] R 2n 2n it is fulfilled M ij f M f ( M f := tr(m T M) is the Frobenius norm of M) and M M f r M, r := rank(m).hencewehave J(t) Ψ 11 (t) f + Ψ 12 (t) F + ( F + F ) Ψ 12 (t) f ( 1 + F + F ) Ψ(t) f + Ψ12 (t) F r ( 1 + F + F ) Ψ(t) + Ψ12 (t) F := ω 1 (t, ). (1) Similarly, H(t) r ( 1 + F + F ) Ψ(t) + Ψ22 (t) F := ω 2 (t, ). (11) Since J () = I n and ω 1 (t,)= the quantity τ := sup { t T : ω 1 (t, ) J 1 (t) < 1 } is correctly defined. Hence, as a corollary of (9) (11) we can formulate the following perturbation result: Theorem 1. For t [, τ) the spectral norm of the perturbation P (t) satisfies the estimate P (t) (ω 2 (t, )+ω 1 (t, ) P(t) ) J 1 (t) f(t, ) := 1 ω 1 (t, ) J 1. (12) (t) To represent the norm Ψ(t) of the perturbation Ψ(t) involved in the expressions for ω i by the known quantities A, S, Q, F consider the perturbed system (2) Ψ (t) + Ψ (t) = (M + M) ( Ψ(t) + Ψ(t) ), [ A M := Q ] S A T. We have Ψ(t) = t e M(t s) M e (M+ M)s ds
5 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation 299 Table 1 Power series Log norm Jordan (1) Jordan (2) Schur c 1 1 cond(y ) cond(y ) 1 β M µ(m) α(m) α(m)+d m α(m) γ 1 ν p m l and t Ψ(t) M e M(t s) e (M+ M)s ds t M g(t s) ( ) Ψ(s) + g(s) ds, (13) where M := M and g(t) is an upper bound for e Mt, i.e., e Mt g(t). There are several bounds g for the norm of the matrix exponential based on the power series for e Mt, the logarithmic norm of M, the Jordan form and the Schur decompositions of M, see [8]: p 1 g(t) = c e βt (γt) k /k!, k= where the values of the constants c, β, γ and p are given in table 1. Here µ(m) is the maximum eigenvalue of the matrix (M + M H )/2, J = Y 1 MY is the Jordan canonical form of M and m 1 is the dimension of the maximum block in J (the matrix Y is chosen so that the condition number cond(y ) = Y Y 1 is minimized), α(m) is the spectral abscissa of M, i.e., the maximum real part of the eigenvalues of M, d m := cos(π/(m + 1)), and T = U H MU = Λ + N is the Schur decomposition of M, where U is unitary, Λ is diagonal and N is strictly upper triangular matrix (the matrix U is chosen so that the norm ν = N of the matrix N is minimized), and l = min{s: N s = } is the index of nilpotency of N. For each estimate g we have Ψ(t) u(t), where u is the solution to the majorant integral equation corresponding to (13): t u(t) = M g(t s) ( g(s) + u(s) ) ds. 4. Numerical example Consider the third order matrix differential Riccati equation of type (1) with matrices A = VA V, F = VF V, S = VS V, Q = VQ V, where V is the
6 3 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation Table 2 t δ P δ P1 δ P2 δ P Table 3 k δ P1 δ P2 δ P3 of same order as δ P of same order as δ P of same order as δ P 1 exceeds δ P by 1 order of same order as δ P of same order as δ P 2 exceeds δ P by 3 orders exceeds δ P by 1 order exceeds δ P by 1 order 3 exceeds δ P by 5 orders exceeds δ P by 2 orders exceeds δ P by 2 orders elementary reflection V = I 3 2vv T /3, v := [1,1,1] T and the matrices A, F, S, Q are chosen as A = diag ( 1 1 k, 2, 3 1 k), F = diag(,,), S =diag ( 1 k,1,1 k), Q =diag ( 3 1 k,5,7 1 k) for some positive integer k. The sensitivity of this equation increases with increasing k. The perturbations in the data are taken as: A = V A V, F = V F V, S = V S V, Q = V Q V,where A =diag(3 1 k,2,1 k )1 j,forj=1, 8,...,2, and F =, S =, Q =. The exact relative perturbation P (t) δ P := P (t) in the solution of DMRE is compared with the estimate f(t, ) δ P3 := P (t) following from the above given estimate (12), the estimate δ P1 following from the linear estimate K L of Kenney and Hewer [3] and the estimate δ P2 resulting from the non-linear bound proposed by Konstantinov and Pelova [4]. In table 2 the results
7 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation 31 for k = 1, j = 6 are presented and in table 3 the results for k =, 1, 2, 3 and j = 1, 8, 6, 4, 2 are generalized. The results show that with the deterioration of the conditioning of the system (i.e., of the matrix A) the estimate δ P3 from (12) is superior to the other two methods with respect to the closeness to the estimated quantity and size of the domain of validity. Moreover the estimate proposed in this paper has the advantage that it is not related with the solution of the DMRE and hence with the problem of possible loss of symmetry and divergence of the numerical procedure. References [1] G. Golub and C. Van Loan, Matrix Computations (Johns Hopkins University Press, Baltimore, MD, 1983). [2] B. Kågström, Bounds and perturbation bounds for the matrix exponential, BIT 17 (1977) [3] C. Kenney and G. Hewer, The sensitivity of the algebraic and differential Riccati equation, SIAM J. Control Optim. 28 (199) [4] M. Konstantinov and G. Pelova, Sensitivity of the solution to differential matrix Riccati equations, IEEE Trans. Autom. Control 36 (1991) [5] M. Konstantinov, P. Petkov, D. Gu and I. Postlethwaite, Perturbation techniques for linear control problems, Report 95-7, Department of Engineering, Leicester University (February 1995). [6] M. Konstantinov, I. Popchev and V. Angelova, A new approach to the sensitivity analysis of differential matrix Riccati equation, in: National Conference Automatica 94, Sofia, Bulgaria (1994). [7] P. Lancaster, Theory of Matrices (Academic Press, New York, 1969). [8] P. Petkov, N. Christov and M. Konstantinov, Computational Methods for Linear Control Systems (Prentice-Hall, Hemel Hempstead, 1991). [9] C. Van Loan, The sensitivity of the matrix exponential, SIAM J. Numer. Anal. 14 (1977)
COMPARISON OF PERTURBATION BOUNDS FOR THE MATRIX. Abstract. The paper deals with the perturbation estimates proposed by Xu[4],Sun,
COMPARISON OF PERTURBATION BOUNDS FOR THE MATRIX EQUATION X = A 1 + A H X;1 A M.M. Konstantinov V.A. Angelova y P.H. Petkov z I.P. Popchev x Abstract The paper deals with the perturbation estimates proposed
More informationTwo Results About The Matrix Exponential
Two Results About The Matrix Exponential Hongguo Xu Abstract Two results about the matrix exponential are given. One is to characterize the matrices A which satisfy e A e AH = e AH e A, another is about
More informationMatrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein
Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,
More informationNumerical Methods in Matrix Computations
Ake Bjorck Numerical Methods in Matrix Computations Springer Contents 1 Direct Methods for Linear Systems 1 1.1 Elements of Matrix Theory 1 1.1.1 Matrix Algebra 2 1.1.2 Vector Spaces 6 1.1.3 Submatrices
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationAutomatica, 33(9): , September 1997.
A Parallel Algorithm for Principal nth Roots of Matrices C. K. Koc and M. _ Inceoglu Abstract An iterative algorithm for computing the principal nth root of a positive denite matrix is presented. The algorithm
More informationExponentials of Symmetric Matrices through Tridiagonal Reductions
Exponentials of Symmetric Matrices through Tridiagonal Reductions Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A simple and efficient numerical algorithm
More informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More informationc 2005 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 27, No. 2, pp. 305 32 c 2005 Society for Industrial and Applied Mathematics JORDAN CANONICAL FORM OF THE GOOGLE MATRIX: A POTENTIAL CONTRIBUTION TO THE PAGERANK COMPUTATION
More informationQuadratic Matrix Polynomials
Research Triangularization Matters of Quadratic Matrix Polynomials February 25, 2009 Nick Françoise Higham Tisseur Director School of of Research Mathematics The University of Manchester School of Mathematics
More informationHere is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J
Class Notes 4: THE SPECTRAL RADIUS, NORM CONVERGENCE AND SOR. Math 639d Due Date: Feb. 7 (updated: February 5, 2018) In the first part of this week s reading, we will prove Theorem 2 of the previous class.
More informationComputation of a canonical form for linear differential-algebraic equations
Computation of a canonical form for linear differential-algebraic equations Markus Gerdin Division of Automatic Control Department of Electrical Engineering Linköpings universitet, SE-581 83 Linköping,
More informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationOn rank one perturbations of Hamiltonian system with periodic coefficients
On rank one perturbations of Hamiltonian system with periodic coefficients MOUHAMADOU DOSSO Université FHB de Cocody-Abidjan UFR Maths-Info., BP 58 Abidjan, CÔTE D IVOIRE mouhamadou.dosso@univ-fhb.edu.ci
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationSTRUCTURE PRESERVING DEFLATION OF INFINITE EIGENVALUES IN STRUCTURED PENCILS
Electronic Transactions on Numerical Analysis Volume 44 pp 1 24 215 Copyright c 215 ISSN 168 9613 ETNA STRUCTURE PRESERVING DEFLATION OF INFINITE EIGENVALUES IN STRUCTURED PENCILS VOLKER MEHRMANN AND HONGGUO
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationDefinite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra
Definite versus Indefinite Linear Algebra Christian Mehl Institut für Mathematik TU Berlin Germany 10th SIAM Conference on Applied Linear Algebra Monterey Bay Seaside, October 26-29, 2009 Indefinite Linear
More informationResearch CharlieMatters
Research CharlieMatters Van Loan and the Matrix Exponential February 25, 2009 Nick Nick Higham Director Schoolof ofresearch Mathematics The School University of Mathematics of Manchester http://www.maths.manchester.ac.uk/~higham
More informationA Note on Simple Nonzero Finite Generalized Singular Values
A Note on Simple Nonzero Finite Generalized Singular Values Wei Ma Zheng-Jian Bai December 21 212 Abstract In this paper we study the sensitivity and second order perturbation expansions of simple nonzero
More informationA Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Squares Problem
A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Suares Problem Hongguo Xu Dedicated to Professor Erxiong Jiang on the occasion of his 7th birthday. Abstract We present
More informationN. J. Higham. Numerical Analysis Report No January Manchester Centre for Computational Mathematics Numerical Analysis Reports
UMIST ISSN 1360-1725 A New sqrtm for Matlab N. J. Higham Numerical Analysis Report No. 336 January 1999 Manchester Centre for Computational Mathematics Numerical Analysis Reports DEPARTMENTS OF MATHEMATICS
More informationLarge-scale eigenvalue problems
ELE 538B: Mathematics of High-Dimensional Data Large-scale eigenvalue problems Yuxin Chen Princeton University, Fall 208 Outline Power method Lanczos algorithm Eigenvalue problems 4-2 Eigendecomposition
More informationA Note on Eigenvalues of Perturbed Hermitian Matrices
A Note on Eigenvalues of Perturbed Hermitian Matrices Chi-Kwong Li Ren-Cang Li July 2004 Let ( H1 E A = E H 2 Abstract and à = ( H1 H 2 be Hermitian matrices with eigenvalues λ 1 λ k and λ 1 λ k, respectively.
More informationarxiv: v1 [math.na] 1 Sep 2018
On the perturbation of an L -orthogonal projection Xuefeng Xu arxiv:18090000v1 [mathna] 1 Sep 018 September 5 018 Abstract The L -orthogonal projection is an important mathematical tool in scientific computing
More informationAN ESTIMATE OF GREEN S FUNCTION OF THE PROBLEM OF BOUNDED SOLUTIONS IN THE CASE OF A TRIANGULAR COEFFICIENT
AN ESTIMATE OF GREEN S FUNCTION OF THE PROBLEM OF BOUNDED SOLUTIONS IN THE CASE OF A TRIANGULAR COEFFICIENT V. G. KURBATOV AND I.V. KURBATOVA arxiv:90.00792v [math.na] 3 Jan 209 Abstract. An estimate of
More informationThe Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix
The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix Chun-Yueh Chiang Center for General Education, National Formosa University, Huwei 632, Taiwan. Matthew M. Lin 2, Department of
More information2 Computing complex square roots of a real matrix
On computing complex square roots of real matrices Zhongyun Liu a,, Yulin Zhang b, Jorge Santos c and Rui Ralha b a School of Math., Changsha University of Science & Technology, Hunan, 410076, China b
More informationStructured Condition Numbers of Symmetric Algebraic Riccati Equations
Proceedings of the 2 nd International Conference of Control Dynamic Systems and Robotics Ottawa Ontario Canada May 7-8 2015 Paper No. 183 Structured Condition Numbers of Symmetric Algebraic Riccati Equations
More informationUMIACS-TR July CS-TR 2721 Revised March Perturbation Theory for. Rectangular Matrix Pencils. G. W. Stewart.
UMIAS-TR-9-5 July 99 S-TR 272 Revised March 993 Perturbation Theory for Rectangular Matrix Pencils G. W. Stewart abstract The theory of eigenvalues and eigenvectors of rectangular matrix pencils is complicated
More informationarxiv: v3 [math.ra] 10 Jun 2016
To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles
More informationIndex. for generalized eigenvalue problem, butterfly form, 211
Index ad hoc shifts, 165 aggressive early deflation, 205 207 algebraic multiplicity, 35 algebraic Riccati equation, 100 Arnoldi process, 372 block, 418 Hamiltonian skew symmetric, 420 implicitly restarted,
More informationMath Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
More informationError estimates for the ESPRIT algorithm
Error estimates for the ESPRIT algorithm Daniel Potts Manfred Tasche Let z j := e f j j = 1,..., M) with f j [ ϕ, 0] + i [ π, π) and small ϕ 0 be distinct nodes. With complex coefficients c j 0, we consider
More informationA Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case
A Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case ATARU KASE Osaka Institute of Technology Department of
More informationOn the closures of orbits of fourth order matrix pencils
On the closures of orbits of fourth order matrix pencils Dmitri D. Pervouchine Abstract In this work we state a simple criterion for nilpotentness of a square n n matrix pencil with respect to the action
More informationTHE nth POWER OF A MATRIX AND APPROXIMATIONS FOR LARGE n. Christopher S. Withers and Saralees Nadarajah (Received July 2008)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 38 (2008), 171 178 THE nth POWER OF A MATRIX AND APPROXIMATIONS FOR LARGE n Christopher S. Withers and Saralees Nadarajah (Received July 2008) Abstract. When a
More informationLecture 2: Computing functions of dense matrices
Lecture 2: Computing functions of dense matrices Paola Boito and Federico Poloni Università di Pisa Pisa - Hokkaido - Roma2 Summer School Pisa, August 27 - September 8, 2018 Introduction In this lecture
More informationDiagonalizing Matrices
Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B
More informationBackground Mathematics (2/2) 1. David Barber
Background Mathematics (2/2) 1 David Barber University College London Modified by Samson Cheung (sccheung@ieee.org) 1 These slides accompany the book Bayesian Reasoning and Machine Learning. The book and
More informationNotes on matrix arithmetic geometric mean inequalities
Linear Algebra and its Applications 308 (000) 03 11 www.elsevier.com/locate/laa Notes on matrix arithmetic geometric mean inequalities Rajendra Bhatia a,, Fuad Kittaneh b a Indian Statistical Institute,
More informationMultiplicative Perturbation Analysis for QR Factorizations
Multiplicative Perturbation Analysis for QR Factorizations Xiao-Wen Chang Ren-Cang Li Technical Report 011-01 http://www.uta.edu/math/preprint/ Multiplicative Perturbation Analysis for QR Factorizations
More informationA Divide-and-Conquer Algorithm for Functions of Triangular Matrices
A Divide-and-Conquer Algorithm for Functions of Triangular Matrices Ç. K. Koç Electrical & Computer Engineering Oregon State University Corvallis, Oregon 97331 Technical Report, June 1996 Abstract We propose
More informationScientific Computing
Scientific Computing Direct solution methods Martin van Gijzen Delft University of Technology October 3, 2018 1 Program October 3 Matrix norms LU decomposition Basic algorithm Cost Stability Pivoting Pivoting
More informationGENERAL ARTICLE Realm of Matrices
Realm of Matrices Exponential and Logarithm Functions Debapriya Biswas Debapriya Biswas is an Assistant Professor at the Department of Mathematics, IIT- Kharagpur, West Bengal, India. Her areas of interest
More informationWe first repeat some well known facts about condition numbers for normwise and componentwise perturbations. Consider the matrix
BIT 39(1), pp. 143 151, 1999 ILL-CONDITIONEDNESS NEEDS NOT BE COMPONENTWISE NEAR TO ILL-POSEDNESS FOR LEAST SQUARES PROBLEMS SIEGFRIED M. RUMP Abstract. The condition number of a problem measures the sensitivity
More informationIndex. book 2009/5/27 page 121. (Page numbers set in bold type indicate the definition of an entry.)
page 121 Index (Page numbers set in bold type indicate the definition of an entry.) A absolute error...26 componentwise...31 in subtraction...27 normwise...31 angle in least squares problem...98,99 approximation
More informationStable iterations for the matrix square root
Numerical Algorithms 5 (997) 7 4 7 Stable iterations for the matrix square root Nicholas J. Higham Department of Mathematics, University of Manchester, Manchester M3 9PL, England E-mail: higham@ma.man.ac.u
More informationELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n
Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this
More informationBOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION
K Y BERNETIKA VOLUM E 46 ( 2010), NUMBER 4, P AGES 655 664 BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION Guang-Da Hu and Qiao Zhu This paper is concerned with bounds of eigenvalues of a complex
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationETNA Kent State University
C 8 Electronic Transactions on Numerical Analysis. Volume 17, pp. 76-2, 2004. Copyright 2004,. ISSN 1068-613. etnamcs.kent.edu STRONG RANK REVEALING CHOLESKY FACTORIZATION M. GU AND L. MIRANIAN Abstract.
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationSome Notes on Least Squares, QR-factorization, SVD and Fitting
Department of Engineering Sciences and Mathematics January 3, 013 Ove Edlund C000M - Numerical Analysis Some Notes on Least Squares, QR-factorization, SVD and Fitting Contents 1 Introduction 1 The Least
More informationNumerical methods for matrix functions
Numerical methods for matrix functions SF2524 - Matrix Computations for Large-scale Systems Lecture 13 Numerical methods for matrix functions 1 / 26 Reading material Lecture notes online Numerical methods
More informationAn error estimate for matrix equations
Applied Numerical Mathematics 50 (2004) 395 407 www.elsevier.com/locate/apnum An error estimate for matrix equations Yang Cao, Linda Petzold 1 Department of Computer Science, University of California,
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationMATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006
MATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006 Sherod Eubanks HOMEWORK 2 2.1 : 2, 5, 9, 12 2.3 : 3, 6 2.4 : 2, 4, 5, 9, 11 Section 2.1: Unitary Matrices Problem 2 If λ σ(u) and U M n is unitary, show that
More informationELA MATRIX FUNCTIONS PRESERVING SETS OF GENERALIZED NONNEGATIVE MATRICES
MATRIX FUNCTIONS PRESERVING SETS OF GENERALIZED NONNEGATIVE MATRICES ABED ELHASHASH AND DANIEL B. SZYLD Abstract. Matrix functions preserving several sets of generalized nonnegative matrices are characterized.
More informationBasic Calculus Review
Basic Calculus Review Lorenzo Rosasco ISML Mod. 2 - Machine Learning Vector Spaces Functionals and Operators (Matrices) Vector Space A vector space is a set V with binary operations +: V V V and : R V
More informationNotes on Eigenvalues, Singular Values and QR
Notes on Eigenvalues, Singular Values and QR Michael Overton, Numerical Computing, Spring 2017 March 30, 2017 1 Eigenvalues Everyone who has studied linear algebra knows the definition: given a square
More informationLecture 4: Analysis of MIMO Systems
Lecture 4: Analysis of MIMO Systems Norms The concept of norm will be extremely useful for evaluating signals and systems quantitatively during this course In the following, we will present vector norms
More informationMS&E 318 (CME 338) Large-Scale Numerical Optimization
Stanford University, Management Science & Engineering (and ICME MS&E 38 (CME 338 Large-Scale Numerical Optimization Course description Instructor: Michael Saunders Spring 28 Notes : Review The course teaches
More informationOn (T,f )-connections of matrices and generalized inverses of linear operators
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 33 2015 On (T,f )-connections of matrices and generalized inverses of linear operators Marek Niezgoda University of Life Sciences
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More informationOn the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination
On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination J.M. Peña 1 Introduction Gaussian elimination (GE) with a given pivoting strategy, for nonsingular matrices
More informationBlock Lanczos Tridiagonalization of Complex Symmetric Matrices
Block Lanczos Tridiagonalization of Complex Symmetric Matrices Sanzheng Qiao, Guohong Liu, Wei Xu Department of Computing and Software, McMaster University, Hamilton, Ontario L8S 4L7 ABSTRACT The classic
More informationHands-on Matrix Algebra Using R
Preface vii 1. R Preliminaries 1 1.1 Matrix Defined, Deeper Understanding Using Software.. 1 1.2 Introduction, Why R?.................... 2 1.3 Obtaining R.......................... 4 1.4 Reference Manuals
More informationWEIGHTED LIMITS FOR POINCARÉ DIFFERENCE EQUATIONS. Rotchana Chieocan
WEIGHTED LIMITS FOR POINCARÉ DIFFERENCE EQUATIONS Rotchana Chieocan Department of Mathematics, Faculty of Science, Khon Kaen University, 40002 Khon Kaen, Thail rotchana@kku.ac.th Mihály Pituk* Department
More informationMATH 581D FINAL EXAM Autumn December 12, 2016
MATH 58D FINAL EXAM Autumn 206 December 2, 206 NAME: SIGNATURE: Instructions: there are 6 problems on the final. Aim for solving 4 problems, but do as much as you can. Partial credit will be given on all
More informationTHE RELATION BETWEEN THE QR AND LR ALGORITHMS
SIAM J. MATRIX ANAL. APPL. c 1998 Society for Industrial and Applied Mathematics Vol. 19, No. 2, pp. 551 555, April 1998 017 THE RELATION BETWEEN THE QR AND LR ALGORITHMS HONGGUO XU Abstract. For an Hermitian
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationOctober 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable
International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität
More informationWHEN MODIFIED GRAM-SCHMIDT GENERATES A WELL-CONDITIONED SET OF VECTORS
IMA Journal of Numerical Analysis (2002) 22, 1-8 WHEN MODIFIED GRAM-SCHMIDT GENERATES A WELL-CONDITIONED SET OF VECTORS L. Giraud and J. Langou Cerfacs, 42 Avenue Gaspard Coriolis, 31057 Toulouse Cedex
More informationNumerical Methods I Eigenvalue Problems
Numerical Methods I Eigenvalue Problems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 2nd, 2014 A. Donev (Courant Institute) Lecture
More informationNumerical Methods for Solving Large Scale Eigenvalue Problems
Peter Arbenz Computer Science Department, ETH Zürich E-mail: arbenz@inf.ethz.ch arge scale eigenvalue problems, Lecture 2, February 28, 2018 1/46 Numerical Methods for Solving Large Scale Eigenvalue Problems
More informationKey words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.
May 7, DETERMINING WHETHER A MATRIX IS STRONGLY EVENTUALLY NONNEGATIVE LESLIE HOGBEN 3 5 6 7 8 9 Abstract. A matrix A can be tested to determine whether it is eventually positive by examination of its
More informationNumerically Stable Cointegration Analysis
Numerically Stable Cointegration Analysis Jurgen A. Doornik Nuffield College, University of Oxford, Oxford OX1 1NF R.J. O Brien Department of Economics University of Southampton November 3, 2001 Abstract
More informationJordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS
Jordan Journal of Mathematics and Statistics JJMS) 53), 2012, pp.169-184 A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS ADEL H. AL-RABTAH Abstract. The Jacobi and Gauss-Seidel iterative
More informationQR-decomposition. The QR-decomposition of an n k matrix A, k n, is an n n unitary matrix Q and an n k upper triangular matrix R for which A = QR
QR-decomposition The QR-decomposition of an n k matrix A, k n, is an n n unitary matrix Q and an n k upper triangular matrix R for which In Matlab A = QR [Q,R]=qr(A); Note. The QR-decomposition is unique
More informationFinite dimensional indefinite inner product spaces and applications in Numerical Analysis
Finite dimensional indefinite inner product spaces and applications in Numerical Analysis Christian Mehl Technische Universität Berlin, Institut für Mathematik, MA 4-5, 10623 Berlin, Germany, Email: mehl@math.tu-berlin.de
More informationLinear Algebra: Characteristic Value Problem
Linear Algebra: Characteristic Value Problem . The Characteristic Value Problem Let < be the set of real numbers and { be the set of complex numbers. Given an n n real matrix A; does there exist a number
More informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES
Volume 10 (2009), Issue 4, Article 91, 5 pp. ON THE HÖLDER CONTINUITY O MATRIX UNCTIONS OR NORMAL MATRICES THOMAS P. WIHLER MATHEMATICS INSTITUTE UNIVERSITY O BERN SIDLERSTRASSE 5, CH-3012 BERN SWITZERLAND.
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationAbed Elhashash, Uriel G. Rothblum, and Daniel B. Szyld. Report August 2009
Paths of matrices with the strong Perron-Frobenius property converging to a given matrix with the Perron-Frobenius property Abed Elhashash, Uriel G. Rothblum, and Daniel B. Szyld Report 09-08-14 August
More informatione jk :=< e k, e j >, e[t ] e = E 1 ( e [T ] e ) h E.
onjb.tex 14.02.23 Orthonormal Jordan bases in finite dimensional Hilbert spaces 1. Introduction and terminology The aim of this paper is twofold: first, we give a necessary and sufficient condition for
More informationSingular Value Decompsition
Singular Value Decompsition Massoud Malek One of the most useful results from linear algebra, is a matrix decomposition known as the singular value decomposition It has many useful applications in almost
More informationLecture notes: Applied linear algebra Part 2. Version 1
Lecture notes: Applied linear algebra Part 2. Version 1 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 First, some exercises: xercise 0.1 (2 Points) Another least
More informationA fast randomized algorithm for overdetermined linear least-squares regression
A fast randomized algorithm for overdetermined linear least-squares regression Vladimir Rokhlin and Mark Tygert Technical Report YALEU/DCS/TR-1403 April 28, 2008 Abstract We introduce a randomized algorithm
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationTHE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR
THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationforms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms
Christopher Engström November 14, 2014 Hermitian LU QR echelon Contents of todays lecture Some interesting / useful / important of matrices Hermitian LU QR echelon Rewriting a as a product of several matrices.
More informationMathematical foundations - linear algebra
Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationInvertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices
Geršgorin circles Lecture 8: Outline Chapter 6 + Appendix D: Location and perturbation of eigenvalues Some other results on perturbed eigenvalue problems Chapter 8: Nonnegative matrices Geršgorin s Thm:
More informationMathematical Methods for Engineers and Scientists 1
K.T. Tang Mathematical Methods for Engineers and Scientists 1 Complex Analysis, Determinants and Matrices With 49 Figures and 2 Tables fyj Springer Part I Complex Analysis 1 Complex Numbers 3 1.1 Our Number
More information