COMPARISON OF PERTURBATION BOUNDS FOR THE MATRIX. Abstract. The paper deals with the perturbation estimates proposed by Xu[4],Sun,

Size: px
Start display at page:

Download "COMPARISON OF PERTURBATION BOUNDS FOR THE MATRIX. Abstract. The paper deals with the perturbation estimates proposed by Xu[4],Sun,"

Transcription

1 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 by Xu[4],Sun, Xu [3] and Konstantinov et al [] for evaluating the sensitivity of the solution to the complex fractional-ane matrix equation X = A 1 + A H X ;1 A relative to rounding and parameter errors. The eectiveness and reliability of the dierent methods are analyzed by experiments with numerical examples. Key Words: Perturbations, complex fractional-ane matrix equation, sensitivity. MSC 000: 15A4. 1 Introduction Shu-Fang Xu in [4], Ji-gunag Sun in [3] and Konstantinov et al in [] consider the sensitivity of the complex fractional-ane matrix equation X = A 1 + A H X ;1 A (1) where A 1 C nn and the solution X C nn are Hermitian positive denite matrices. Dierent schemes for estimating the sensitivity of the solution relative University ofarchitecture and Civil Engineering, 1 Hr. Smirnenski Blvd., 1046 Soa, Bulgaria, mmk ;fte@uacg.bg y Institute for Information Technologies, Akad. G. Bonchev Str., Bl., 1113 Soa, Bulgaria, verandi@abv.bg z Department of Automatics, Technical University of Soa, 1756 Soa, Bulgaria, php@tusoa.acad.bg x Institute for Information Technologies, Akad. G. Bonchev Str., Bl., 1113 Soa, Bulgaria, ipopchev@iit.bas.bg

2 to rounding and parameter errors are presented in the above papers. Therefore, it is interesting to compare the eectivness and the eld of application of these dierent perturbation results. Perturbation analysis of real equations of type (1) is done in [1]. In this paper, by means of numerical experiments, we present a comparison analysis of the eectiveness and applicability of the perturbation bounds, proposed in [4, 3, ]. Throughout the paper we use the following notation: C nn { the space of n n complex matrices R + =[0 1) H nn { the space of Hermitian matrices A > { the transpose of the matrix A A { the complex conjugate of A A H = A > vec(a) C n { the column-wise vector representation of the matrix A C nn Mat(L) C n n { the matrix representation of the linear matrix operator L : C nn! C nn I n { the identity n n matrix A B =[a pqb] { the Kronecker product of the matrices A =[a pq] and B kk { the Euclidean norm in C n or the spectral (or -) norm in C nn kk F {thefrobenius (or F-) norm in C nn kk { a replacement of either kk or kk F z R R n { the real version of the vector z C n ; R R nn { the real version of the matrix ; C nn (; ) { the matrix of the real version of the operator z! ;z +z n C n n {thevec-permutation matrix such that vec(y > )= n vec(y ) for each Y C nn. The notation `:=' stands for `equal by denition'. The sub-indices k l take values 1,. Statement of the problem Consider the matrix equation (1). The round{o and parameter errors, accompanying the numerical solution of the equation, are represented by equivalent perturbations in the matrix coecients, A k! A ~ k := A k + A k. They lead to a perturbation in the solution X! X ~ = X + X, where A1 X H nn and A C nn and for some k 0wehave ka kk F k. The perturbed equation (1) is ~X = ~ A 1 + ~ A H ~ X ;1 ~ A: () The purpose of the norm-wise perturbation analysis of equation (1) is to derive bounds for X := kxk F as a linear or non-linear function of the perturbations ka kk F in the data. 3 Sensitivity estimates 3.1 The estimate of Xu [4] In [4] Xu proves the following theorem.

3 Theorem 1. Let A ~ A A 1 ~ A 1 C nn with A 1 and ~ A 1 Hermitian positive denite. If ka k ka ;1 1 k < 1 k A ~ ; A k < 1 1 k ~ A 1 ; A 1k ;kakka;1 1 k ka ;1 1 k ;1 (3) 1 ;kakka;1 1 k ka ;1 1 k ;1 then the solutions X and ~ X of the matrix equations (1) and () exist and satisfy that k ~ X ; Xk kxk 1 := 1 1 ;kakka;1 1 k k A ~ ; A k + k ~ A1 ; A 1k : (4) ka k ka 1k 3. The estimate of Sun and Xu [3] Denote Let, in the real case, B := X ;1 A := ka k := kbk := kx ;1 k : L := I ; B > B H = I ; ; X ;1 > ; A X ;1 H A Q := L I ;1 B H +(B > I n) n = L ;1 (I n (X ;1 A) H )+L ;1 (X ;1 A ) > I n n and q := kqk F, l := kl ;1 k ;1 F. Similarly let, in the complex case, L ;1 =: S + i L ;1 I n B H = =: U 1 + i 1 L ;1 B > I n n = =: U + i S ; S c := S U1 + U U c := ; 1 ; 1 + U 1 ; U and q := ku ck F, l := ks ck ;1. Denote F = 1 l ka1kf + qkakf + l kak F = (( + kakf) + ) kakf: l In [3] SunandXuprove the following theorem. Theorem. If (1 ; )( + ) <min 1 l and

4 ( l(1 ; ) <min (l + + l + p (l + )(l + )) (l ; )((1 ; )( + ) ; l) ((1 + )( + )+l) then the perturbed matrix equation () has a solution ~ X, and moreover, k ~ X ; XkF := l l(1 + ; )+ p l (1 + ; ) ; 4l(l + ) : (5) 3.3 The estimate of Konstantinov et al [] Denote := kxk F and := [ 1 ] > = ka 1k F ka k F > R +: In [] the following local bound is derived for the perturbation X in the solution X of equation (1) g() +O(kk )! 0 (6) where n g() := min k[m 0 1 M 0 ]k p o kk > M 0 (7) L := I n ; (X ;1 A ) > (A H X ;1 ) M 1 := ;L ;1 =: ; + i M 1 := +L I ;1 n (A H X ;1 ) =: ; 1 + i 1 M := +L ;1 ((X ;1 A ) > I n) n =: ; + i ; ; M 0 1 := M 0 ;1 +; := ; 1 ; 1 + ; 1 ; ; and M 0 =[m 0 kl] R + Let := kx ;1 k and is a symmetric matrix with elements m 0 kl = Mk 0 > M 0 l : a 0() := g()+c 1 a 1() := a 11 + a 1 a () := a 0 + a 1 + a where a 11 := L ;1 I n A H X ;1 ;X + L ;1 ;1 > A I n P n a 1 := c 1 a 0 := 3 L ;1 A > A H a 1 := 3 L ;1 a := c 1 3 : A > I n n + L ;1 I n A H

5 The following theorem is proved in [] Theorem 3. Let n := R + : a 1 ; a 0 + p o a 0(a + (1 ; a 1)) 1 : (8) Then the non-local perturbation bound kxk F f() := is valid for equation (1). a 0() 1 ; a 1 + a 0 + p d() (9) d() := (1 ; a 1()+a 0()) ; 4a 0()(a ()+(1 ; a 1())) 4 Experimental results Example 1. The model from Example 5.1 in [3] is used. Consider equation (1) 0 a with matrix coecients A 1 = I, A =,wherea =0:5 ; ;k. The solution of the equation is X = diag(1 1 ; a ). The perturbations in the data are taken as: ;0:436 ;0:7701 0:9501 0:6068 A 1 = 10 ;8 A 0:7701 0:877 = 10 ;9 0:311 0:4860 for k = : In Table 1 we give the numerical results for the relative perturbations bounds 1 (4) of Xu [4] =kxk (5) of Sun and Xu the local bound g()=kxk (6) and the non-local bound f()=kxk (9) of Konstantinov et al []. Table 1. k ; ; ; ; =kxk ; ; ; ; ;8 g()=kxk ; ; ; ; ;8 f()=kxk ; ; ; ; ;8. Let now a =0:99 and the perturbations in the matrix coecients be ;0:436 ;0:7701 A 1 = 10 ;k 0:9501 0:6068 A 0:7701 0:877 = 10 ;k 0:311 0:4860 for k =6 ::: 10. For this example the estimate 1 from Xu [4] is not valid, since the conditions (3) from Theorem 1 are not satised. The results for (5) of Sun and Xu, the

6 local bound g() (6) and the non-local bound f() (9) of Konstantinov et al. are listed in Table. The case when the non-local estimate f() is not valid, since the existence condition is violated, is denoted by asterisk. Table. k ; ; ; ; ;10 g() ; ; ; ; ;10 f() * ; ; ; ;10 Example. For this example we use the model from []. Consider the complex fractional-ane matrix equation (1) with matrices 0: :0535i 0: :0077i 0: :4175i 3 A = 4 0: :597i 0: :3834i 0: :6868i 5 0: :6711i 0: :0668i 0: :5890i A 1 = I 3 + A H A : The perturbations in the data are taken as 3 1+i 1+i 1+i A = 10 (;k) 4 1+i 1+i 1+i 5 1+i 1+i 1+i A 1 = A +(A + A ) H (I 3 + A ) ;1 (A + A ) ; A H A for k =10 9 ::: : This problem was designed so as to have solutions X = I 3 and X + X = I 3 + A of the unperturbed and perturbed equations respectively. The perturbation kxk F in the solution is estimated by the bound (5) of Sun and Xu [3], the local bound g() (6) and the non-local bound () (9) of Konstantinov et al []. For this example the bound 1 (see (4)) of Xu [4] is not valid, since the conditions (3) are violeted. The results obtained for dierent values of k are shown at Table 3. When k decreases from 10 to the non-local estimates (5) and () (9) are slightly more pessimistic than the local bound g(). The cases when the non-local estimates are not valid, since the existence conditions are violated, are denoted by asterisk.

7 Table 3. k kxk F g() () ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ;3 * ; ; ; * ;1 * 5 Concluding remarks The results of the experimental analysis show that in the given cases the non{ linear method of Konstantinov et al. [] for estimating the sensitivity ofthe solution to equation(1) is superior to the methods of Xu [4] and Sun and Xu [3] with respect of closeness to the estimated quantity. References [1] M. Konstantinov. Perturbation analysis of a class of real fractional{ane matrix equations. In Proc. Jub. Sci. Conf. Univ. Arch. Civil Eng. Geod., volume 8, pages 489{494, Soa, 00. [] M. Konstantinov, P. Petkov, V. Angelova, and I. Popchev. Sensitivity ofa complex fractional{ane matrix equation. In Proc. Jub. Sci. Conf. Univ. Arch. Civil Eng. Geod., volume 8, pages 495{504, Soa, 00. [3] J.-G. Sun and S. Xu. Perturbation analysis of the maximal solution of the matrix equation X + A X ;1 A = P.II. Linear Algebra Appl., 36:11{8, 003. [4] S. Xu. Perturbation analysis of the maximal solution of the matrix equation X + A X ;1 A = P. Linear Algebra Appl., 336:61{70, 001. Submitted: January 003

8 X = A 1 + A H X ;1 A..,..,..,.. [4], [3].[] - X = A 1 + A H X ;1 A..

9 I X = A 1 + A H X ;1 A..,..,..,.. [4], [3].[] - X = A 1 + A H X ;1 A..

Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system

Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Advances in Computational Mathematics 7 (1997) 295 31 295 Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Mihail Konstantinov a and Vera

More information

Sonderforschungsbereich 393. P. Hr. Petkov M. M. Konstantinov V. Mehrmann. DGRSVX and DMSRIC: Fortran 77. matrix algebraic Riccati equations with

Sonderforschungsbereich 393. P. Hr. Petkov M. M. Konstantinov V. Mehrmann. DGRSVX and DMSRIC: Fortran 77. matrix algebraic Riccati equations with Sonderforschungsbereich 393 Numerische Simulation auf massiv parallelen Rechnern P. Hr. Petkov M. M. Konstantinov V. Mehrmann DGRSVX and DMSRIC: Fortran 77 subroutines for solving continuous{time matrix

More information

then kaxk 1 = j a ij x j j ja ij jjx j j: Changing the order of summation, we can separate the summands, kaxk 1 ja ij jjx j j: let then c = max 1jn ja

then kaxk 1 = j a ij x j j ja ij jjx j j: Changing the order of summation, we can separate the summands, kaxk 1 ja ij jjx j j: let then c = max 1jn ja Homework Haimanot Kassa, Jeremy Morris & Isaac Ben Jeppsen October 7, 004 Exercise 1 : We can say that kxk = kx y + yk And likewise So we get kxk kx yk + kyk kxk kyk kx yk kyk = ky x + xk kyk ky xk + kxk

More information

Norms and Perturbation theory for linear systems

Norms and Perturbation theory for linear systems CHAPTER 7 Norms and Perturbation theory for linear systems Exercise 7.7: Consistency of sum norm? Observe that the sum norm is a matrix norm. This follows since it is equal to the l -norm of the vector

More information

or H = UU = nx i=1 i u i u i ; where H is a non-singular Hermitian matrix of order n, = diag( i ) is a diagonal matrix whose diagonal elements are the

or H = UU = nx i=1 i u i u i ; where H is a non-singular Hermitian matrix of order n, = diag( i ) is a diagonal matrix whose diagonal elements are the Relative Perturbation Bound for Invariant Subspaces of Graded Indenite Hermitian Matrices Ninoslav Truhar 1 University Josip Juraj Strossmayer, Faculty of Civil Engineering, Drinska 16 a, 31000 Osijek,

More information

Institute for Advanced Computer Studies. Department of Computer Science. On the Perturbation of. LU and Cholesky Factors. G. W.

Institute for Advanced Computer Studies. Department of Computer Science. On the Perturbation of. LU and Cholesky Factors. G. W. University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{95{93 TR{3535 On the Perturbation of LU and Cholesky Factors G. W. Stewart y October, 1995

More information

ESTIMATION OF ERROR. r = b Abx a quantity called the residual for bx. Then

ESTIMATION OF ERROR. r = b Abx a quantity called the residual for bx. Then ESTIMATION OF ERROR Let bx denote an approximate solution for Ax = b; perhaps bx is obtained by Gaussian elimination. Let x denote the exact solution. Then introduce r = b Abx a quantity called the residual

More information

Chapter 7. Iterative methods for large sparse linear systems. 7.1 Sparse matrix algebra. Large sparse matrices

Chapter 7. Iterative methods for large sparse linear systems. 7.1 Sparse matrix algebra. Large sparse matrices Chapter 7 Iterative methods for large sparse linear systems In this chapter we revisit the problem of solving linear systems of equations, but now in the context of large sparse systems. The price to pay

More information

4 Linear Algebra Review

4 Linear Algebra Review Linear Algebra Review For this topic we quickly review many key aspects of linear algebra that will be necessary for the remainder of the text 1 Vectors and Matrices For the context of data analysis, the

More information

Department of Mathematics Technical Report May 2000 ABSTRACT. for any matrix norm that is reduced by a pinching. In addition to known

Department of Mathematics Technical Report May 2000 ABSTRACT. for any matrix norm that is reduced by a pinching. In addition to known University of Kentucky Lexington Department of Mathematics Technical Report 2000-23 Pinchings and Norms of Scaled Triangular Matrices 1 Rajendra Bhatia 2 William Kahan 3 Ren-Cang Li 4 May 2000 ABSTRACT

More information

Linear Algebra: Characteristic Value Problem

Linear 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 information

Institute for Advanced Computer Studies. Department of Computer Science. On the Adjoint Matrix. G. W. Stewart y ABSTRACT

Institute for Advanced Computer Studies. Department of Computer Science. On the Adjoint Matrix. G. W. Stewart y ABSTRACT University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{97{02 TR{3864 On the Adjoint Matrix G. W. Stewart y ABSTRACT The adjoint A A of a matrix A

More information

10.34: Numerical Methods Applied to Chemical Engineering. Lecture 2: More basics of linear algebra Matrix norms, Condition number

10.34: Numerical Methods Applied to Chemical Engineering. Lecture 2: More basics of linear algebra Matrix norms, Condition number 10.34: Numerical Methods Applied to Chemical Engineering Lecture 2: More basics of linear algebra Matrix norms, Condition number 1 Recap Numerical error Operations Properties Scalars, vectors, and matrices

More information

UMIACS-TR July CS-TR 2721 Revised March Perturbation Theory for. Rectangular Matrix Pencils. G. W. Stewart.

UMIACS-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 information

I = i 0,

I = i 0, Special Types of Matrices Certain matrices, such as the identity matrix 0 0 0 0 0 0 I = 0 0 0, 0 0 0 have a special shape, which endows the matrix with helpful properties The identity matrix is an example

More information

12 CHAPTER 1. PRELIMINARIES Lemma 1.3 (Cauchy-Schwarz inequality) Let (; ) be an inner product in < n. Then for all x; y 2 < n we have j(x; y)j (x; x)

12 CHAPTER 1. PRELIMINARIES Lemma 1.3 (Cauchy-Schwarz inequality) Let (; ) be an inner product in < n. Then for all x; y 2 < n we have j(x; y)j (x; x) 1.4. INNER PRODUCTS,VECTOR NORMS, AND MATRIX NORMS 11 The estimate ^ is unbiased, but E(^ 2 ) = n?1 n 2 and is thus biased. An unbiased estimate is ^ 2 = 1 (x i? ^) 2 : n? 1 In x?? we show that the linear

More information

Some inequalities for sum and product of positive semide nite matrices

Some inequalities for sum and product of positive semide nite matrices Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,

More information

which is an important tool in measuring invariant subspace sensitivity [10, sec. 7..5], [7, 8]. Here, we are using the Frobenius norm, kak F = ( P i;j

which is an important tool in measuring invariant subspace sensitivity [10, sec. 7..5], [7, 8]. Here, we are using the Frobenius norm, kak F = ( P i;j PERTURBATION THEORY AND BACKWARD ERROR FOR AX? XB = C NICHOLAS J. HIGHAM y Abstract. Because of the special structure of the equations AX?XB = C the usual relation for linear equations \backward error

More information

Absolutely indecomposable symmetric matrices

Absolutely indecomposable symmetric matrices Journal of Pure and Applied Algebra 174 (2002) 83 93 wwwelseviercom/locate/jpaa Absolutely indecomposable symmetric matrices Hans A Keller a; ;1, A Herminia Ochsenius b;1 a Hochschule Technik+Architektur

More information

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin

STABILITY 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 information

QUADRATURES INVOLVING POLYNOMIALS AND DAUBECHIES' WAVELETS *

QUADRATURES INVOLVING POLYNOMIALS AND DAUBECHIES' WAVELETS * QUADRATURES INVOLVING POLYNOMIALS AND DAUBECHIES' WAVELETS * WEI-CHANG SHANN AND JANN-CHANG YAN Abstract. Scaling equations are used to derive formulae of quadratures involving polynomials and scaling/wavelet

More information

Introduction to Scientific Computing

Introduction to Scientific Computing (Lecture 2: Machine precision and condition number) B. Rosić, T.Moshagen Institute of Scientific Computing General information :) 13 homeworks (HW) Work in groups of 2 or 3 people Each HW brings maximally

More information

the Unitary Polar Factor æ Ren-Cang Li Department of Mathematics University of California at Berkeley Berkeley, California 94720

the Unitary Polar Factor æ Ren-Cang Li Department of Mathematics University of California at Berkeley Berkeley, California 94720 Relative Perturbation Bounds for the Unitary Polar Factor Ren-Cang Li Department of Mathematics University of California at Berkeley Berkeley, California 9470 èli@math.berkeley.eduè July 5, 994 Computer

More information

Structured Condition Numbers of Symmetric Algebraic Riccati Equations

Structured 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 information

An algorithm for symmetric generalized inverse eigenvalue problems

An algorithm for symmetric generalized inverse eigenvalue problems Linear Algebra and its Applications 296 (999) 79±98 www.elsevier.com/locate/laa An algorithm for symmetric generalized inverse eigenvalue problems Hua Dai Department of Mathematics, Nanjing University

More information

Numerical Methods I Solving Square Linear Systems: GEM and LU factorization

Numerical Methods I Solving Square Linear Systems: GEM and LU factorization Numerical Methods I Solving Square Linear Systems: GEM and LU factorization Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 18th,

More information

satisfying ( i ; j ) = ij Here ij = if i = j and 0 otherwise The idea to use lattices is the following Suppose we are given a lattice L and a point ~x

satisfying ( i ; j ) = ij Here ij = if i = j and 0 otherwise The idea to use lattices is the following Suppose we are given a lattice L and a point ~x Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem Johan Hastad* MIT Abstract: We prove that given a point ~z outside a given lattice L then there is a dual vector which gives a fairly

More information

Construction ofnew extremal self-dual codes

Construction ofnew extremal self-dual codes Discrete Mathematics 263 (2003) 81 91 www.elsevier.com/locate/disc Construction ofnew extremal self-dual codes T. Aaron Gulliver a;, Masaaki Harada b, Jon-Lark Kim c a Department of Electrical and Computer

More information

DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular

DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix

More information

Lecture 2: Linear Algebra Review

Lecture 2: Linear Algebra Review EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1

More information

Numerical solution of the eigenvalue problem for Hermitian Toeplitz-like matrices

Numerical solution of the eigenvalue problem for Hermitian Toeplitz-like matrices TR-CS-9-1 Numerical solution of the eigenvalue problem for Hermitian Toeplitz-like matrices Michael K Ng and William F Trench July 199 Joint Computer Science Technical Report Series Department of Computer

More information

Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions

Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 Main problem of linear algebra 2: Given

More information

Foundations of Matrix Analysis

Foundations of Matrix Analysis 1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the

More information

the Unitary Polar Factor æ Ren-Cang Li P.O. Box 2008, Bldg 6012

the Unitary Polar Factor æ Ren-Cang Li P.O. Box 2008, Bldg 6012 Relative Perturbation Bounds for the Unitary Polar actor Ren-Cang Li Mathematical Science Section Oak Ridge National Laboratory P.O. Box 2008, Bldg 602 Oak Ridge, TN 3783-6367 èli@msr.epm.ornl.govè LAPACK

More information

G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE

G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE UDREA PÄUN Communicated by Marius Iosifescu The main contribution of this work is the unication, by G method using Markov chains, therefore, a

More information

S.F. Xu (Department of Mathematics, Peking University, Beijing)

S.F. Xu (Department of Mathematics, Peking University, Beijing) Journal of Computational Mathematics, Vol.14, No.1, 1996, 23 31. A SMALLEST SINGULAR VALUE METHOD FOR SOLVING INVERSE EIGENVALUE PROBLEMS 1) S.F. Xu (Department of Mathematics, Peking University, Beijing)

More information

Institute for Advanced Computer Studies. Department of Computer Science. Iterative methods for solving Ax = b. GMRES/FOM versus QMR/BiCG

Institute for Advanced Computer Studies. Department of Computer Science. Iterative methods for solving Ax = b. GMRES/FOM versus QMR/BiCG University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{96{2 TR{3587 Iterative methods for solving Ax = b GMRES/FOM versus QMR/BiCG Jane K. Cullum

More information

Quantum Computing Lecture 2. Review of Linear Algebra

Quantum Computing Lecture 2. Review of Linear Algebra Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces

More information

Phys 201. Matrices and Determinants

Phys 201. Matrices and Determinants Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1

More information

3 a 21 a a 2N. 3 a 21 a a 2M

3 a 21 a a 2N. 3 a 21 a a 2M APPENDIX: MATHEMATICS REVIEW G 12.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers 2 A = 6 4 a 11 a 12... a 1N a 21 a 22... a 2N. 7..... 5 a M1 a M2...

More information

THE MATRIX EIGENVALUE PROBLEM

THE MATRIX EIGENVALUE PROBLEM THE MATRIX EIGENVALUE PROBLEM Find scalars λ and vectors x 0forwhich Ax = λx The form of the matrix affects the way in which we solve this problem, and we also have variety as to what is to be found. A

More information

Fundamental inequalities and Mond-Pe carić method

Fundamental inequalities and Mond-Pe carić method Chapter Fundamental inequalities and Mond-Pecarić method In this chapter, we have given a very brief and rapid review of some basic topics in Jensen s inequality for positive linear maps and the Kantorovich

More information

Kalman Filter Design for a Second-order Model of Anaerobic Digestion

Kalman Filter Design for a Second-order Model of Anaerobic Digestion Kalman Filter Design for a Second-order Model of Anaerobic Digestion Boyko Kalchev 1*, Ivan Simeonov 1, Nicolai Christov 2 1 The Stephan Angeloff Institute of Microbiology Bulgarian Academy of Sciences

More information

On Expected Gaussian Random Determinants

On Expected Gaussian Random Determinants On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose

More information

On matrix equations X ± A X 2 A = I

On matrix equations X ± A X 2 A = I Linear Algebra and its Applications 326 21 27 44 www.elsevier.com/locate/laa On matrix equations X ± A X 2 A = I I.G. Ivanov,V.I.Hasanov,B.V.Minchev Faculty of Mathematics and Informatics, Shoumen University,

More information

Chapter 3 Least Squares Solution of y = A x 3.1 Introduction We turn to a problem that is dual to the overconstrained estimation problems considered s

Chapter 3 Least Squares Solution of y = A x 3.1 Introduction We turn to a problem that is dual to the overconstrained estimation problems considered s Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter

More information

and are based on the precise formulation of the (vague) concept of closeness. Traditionally,

and are based on the precise formulation of the (vague) concept of closeness. Traditionally, LOCAL TOPOLOGY AND A SPECTRAL THEOREM Thomas Jech 1 1. Introduction. The concepts of continuity and convergence pervade the study of functional analysis, and are based on the precise formulation of the

More information

A property of orthogonal projectors

A property of orthogonal projectors Linear Algebra and its Applications 354 (2002) 35 39 www.elsevier.com/locate/laa A property of orthogonal projectors Jerzy K. Baksalary a,, Oskar Maria Baksalary b,tomaszszulc c a Department of Mathematics,

More information

ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1. Department of Mathematics. and Lawrence Berkeley Laboratory

ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1. Department of Mathematics. and Lawrence Berkeley Laboratory ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1 Department of Mathematics and Lawrence Berkeley Laboratory University of California Berkeley, California 94720 edelman@math.berkeley.edu

More information

arxiv: v3 [math.ra] 22 Aug 2014

arxiv: v3 [math.ra] 22 Aug 2014 arxiv:1407.0331v3 [math.ra] 22 Aug 2014 Positivity of Partitioned Hermitian Matrices with Unitarily Invariant Norms Abstract Chi-Kwong Li a, Fuzhen Zhang b a Department of Mathematics, College of William

More information

Pithy P o i n t s Picked I ' p and Patljr Put By Our P e r i p a tetic Pencil Pusher VOLUME X X X X. Lee Hi^h School Here Friday Ni^ht

Pithy P o i n t s Picked I ' p and Patljr Put By Our P e r i p a tetic Pencil Pusher VOLUME X X X X. Lee Hi^h School Here Friday Ni^ht G G QQ K K Z z U K z q Z 22 x z - z 97 Z x z j K K 33 G - 72 92 33 3% 98 K 924 4 G G K 2 G x G K 2 z K j x x 2 G Z 22 j K K x q j - K 72 G 43-2 2 G G z G - -G G U q - z q - G x) z q 3 26 7 x Zz - G U-

More information

9 Linear Interpolation and Estimation using Interval Analysis

9 Linear Interpolation and Estimation using Interval Analysis 9 Linear Interpolation and Estimation using Interval Analysis S. M. Markov and E. D. Popova 1 ABSTRACT This chapter considers interpolation and curve tting using generalized polynomials under bounded measurement

More information

Chater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de

Chater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Deartment of Electrical Engineering and Comuter Science Massachuasetts Institute of Technology c Chater Matrix Norms

More information

2 and bound the error in the ith eigenvector in terms of the relative gap, min j6=i j i? jj j i j j 1=2 : In general, this theory usually restricts H

2 and bound the error in the ith eigenvector in terms of the relative gap, min j6=i j i? jj j i j j 1=2 : In general, this theory usually restricts H Optimal Perturbation Bounds for the Hermitian Eigenvalue Problem Jesse L. Barlow Department of Computer Science and Engineering The Pennsylvania State University University Park, PA 1682-616 e-mail: barlow@cse.psu.edu

More information

Convex analysis on Cartan subspaces

Convex analysis on Cartan subspaces Nonlinear Analysis 42 (2000) 813 820 www.elsevier.nl/locate/na Convex analysis on Cartan subspaces A.S. Lewis ;1 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario,

More information

Reduced Synchronization Overhead on. December 3, Abstract. The standard formulation of the conjugate gradient algorithm involves

Reduced Synchronization Overhead on. December 3, Abstract. The standard formulation of the conjugate gradient algorithm involves Lapack Working Note 56 Conjugate Gradient Algorithms with Reduced Synchronization Overhead on Distributed Memory Multiprocessors E. F. D'Azevedo y, V.L. Eijkhout z, C. H. Romine y December 3, 1999 Abstract

More information

4 Frequent Directions

4 Frequent Directions 4 Frequent Directions Edo Liberty[3] discovered a strong connection between matrix sketching and frequent items problems. In FREQUENTITEMS problem, we are given a stream S = hs 1,s 2,...,s n i of n items

More information

Research Article Stabilization Analysis and Synthesis of Discrete-Time Descriptor Markov Jump Systems with Partially Unknown Transition Probabilities

Research Article Stabilization Analysis and Synthesis of Discrete-Time Descriptor Markov Jump Systems with Partially Unknown Transition Probabilities Research Journal of Applied Sciences, Engineering and Technology 7(4): 728-734, 214 DOI:1.1926/rjaset.7.39 ISSN: 24-7459; e-issn: 24-7467 214 Maxwell Scientific Publication Corp. Submitted: February 25,

More information

1 Vectors. Notes for Bindel, Spring 2017 Numerical Analysis (CS 4220)

1 Vectors. Notes for Bindel, Spring 2017 Numerical Analysis (CS 4220) Notes for 2017-01-30 Most of mathematics is best learned by doing. Linear algebra is no exception. You have had a previous class in which you learned the basics of linear algebra, and you will have plenty

More information

K. NAGY Now, introduce an orthonormal system on G m called Vilenkin-like system (see [G]). The complex valued functions rk n G m! C are called general

K. NAGY Now, introduce an orthonormal system on G m called Vilenkin-like system (see [G]). The complex valued functions rk n G m! C are called general A HARDY{LITTLEWOOD{LIKE INEQUALITY ON TWO{DIMENSIONAL COMPACT TOTALLY DISCONNECTED SPACES K. Nagy Abstract. We prove a Hardy-Littlewood type ineuality with respect to a system called Vilenkin-like system

More information

Applied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic

Applied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of

More information

Maximizing the numerical radii of matrices by permuting their entries

Maximizing the numerical radii of matrices by permuting their entries Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and

More information

CE 601: Numerical Methods Lecture 7. Course Coordinator: Dr. Suresh A. Kartha, Associate Professor, Department of Civil Engineering, IIT Guwahati.

CE 601: Numerical Methods Lecture 7. Course Coordinator: Dr. Suresh A. Kartha, Associate Professor, Department of Civil Engineering, IIT Guwahati. CE 60: Numerical Methods Lecture 7 Course Coordinator: Dr. Suresh A. Kartha, Associate Professor, Department of Civil Engineering, IIT Guwahati. Drawback in Elimination Methods There are various drawbacks

More information

Rank, Trace, Determinant, Transpose an Inverse of a Matrix Let A be an n n square matrix: A = a11 a1 a1n a1 a an a n1 a n a nn nn where is the jth col

Rank, Trace, Determinant, Transpose an Inverse of a Matrix Let A be an n n square matrix: A = a11 a1 a1n a1 a an a n1 a n a nn nn where is the jth col Review of Linear Algebra { E18 Hanout Vectors an Their Inner Proucts Let X an Y be two vectors: an Their inner prouct is ene as X =[x1; ;x n ] T Y =[y1; ;y n ] T (X; Y ) = X T Y = x k y k k=1 where T an

More information

Robust linear optimization under general norms

Robust linear optimization under general norms Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn

More information

Comparing the homotopy types of the components of Map(S 4 ;BSU(2))

Comparing the homotopy types of the components of Map(S 4 ;BSU(2)) Journal of Pure and Applied Algebra 161 (2001) 235 243 www.elsevier.com/locate/jpaa Comparing the homotopy types of the components of Map(S 4 ;BSU(2)) Shuichi Tsukuda 1 Department of Mathematical Sciences,

More information

An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation AXB =C

An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation AXB =C Journal of Computational and Applied Mathematics 1 008) 31 44 www.elsevier.com/locate/cam An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation

More information

Cheng Soon Ong & Christian Walder. Canberra February June 2017

Cheng Soon Ong & Christian Walder. Canberra February June 2017 Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2017 (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 141 Part III

More information

Optimal blocking of two-level fractional factorial designs

Optimal blocking of two-level fractional factorial designs Journal of Statistical Planning and Inference 91 (2000) 107 121 www.elsevier.com/locate/jspi Optimal blocking of two-level fractional factorial designs Runchu Zhang a;, DongKwon Park b a Department of

More information

Matrix Operations. Linear Combination Vector Algebra Angle Between Vectors Projections and Reflections Equality of matrices, Augmented Matrix

Matrix Operations. Linear Combination Vector Algebra Angle Between Vectors Projections and Reflections Equality of matrices, Augmented Matrix Linear Combination Vector Algebra Angle Between Vectors Projections and Reflections Equality of matrices, Augmented Matrix Matrix Operations Matrix Addition and Matrix Scalar Multiply Matrix Multiply Matrix

More information

BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION

BOUNDS 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 information

On the Hermitian solutions of the

On the Hermitian solutions of the Journal of Applied Mathematics & Bioinformatics vol.1 no.2 2011 109-129 ISSN: 1792-7625 (print) 1792-8850 (online) International Scientific Press 2011 On the Hermitian solutions of the matrix equation

More information

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence)

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector

More information

First, we review some important facts on the location of eigenvalues of matrices.

First, we review some important facts on the location of eigenvalues of matrices. BLOCK NORMAL MATRICES AND GERSHGORIN-TYPE DISCS JAKUB KIERZKOWSKI AND ALICJA SMOKTUNOWICZ Abstract The block analogues of the theorems on inclusion regions for the eigenvalues of normal matrices are given

More information

Inner Product and Orthogonality

Inner Product and Orthogonality Inner Product and Orthogonality P. Sam Johnson October 3, 2014 P. Sam Johnson (NITK) Inner Product and Orthogonality October 3, 2014 1 / 37 Overview In the Euclidean space R 2 and R 3 there are two concepts,

More information

A modied Newton method with cubic convergence: the multivariate case

A modied Newton method with cubic convergence: the multivariate case Journal of Computational and Applied Mathematics 169 (2004) 161 169 www.elsevier.com/locate/cam A modied Newton method with cubic convergence: the multivariate case H.H.H. Homeier a;b; a Institut fur Physikalische

More information

ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices

ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex

More information

Generalized Penner models to all genera. The Niels Bohr Institute. Blegdamsvej 17, DK-2100 Copenhagen, Denmark. C. F. Kristjansen NORDITA

Generalized Penner models to all genera. The Niels Bohr Institute. Blegdamsvej 17, DK-2100 Copenhagen, Denmark. C. F. Kristjansen NORDITA NBI-HE-94-14 NORDITA - 94/8 P January 1994 Generalized Penner models to all genera J. Ambjrn The Niels Bohr Institute Blegdamsvej 17, DK-2100 Copenhagen, Denmark C. F. Kristjansen NORDITA Blegdamsvej 17,

More information

Stability of self-adjoint square roots and polar decompositions in inde nite scalar product spaces

Stability of self-adjoint square roots and polar decompositions in inde nite scalar product spaces Linear Algebra and its Applications 302±303 (1999) 77±104 www.elsevier.com/locate/laa Stability of self-adjoint square roots and polar decompositions in inde nite scalar product spaces Cornelis V.M. van

More information

1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5

1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5 J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix

More information

Stochastic Stability of Jump Linear Systems

Stochastic Stability of Jump Linear Systems 1204 IEEE TRASACTIOS O AUTOMATIC COTROL, VOL. 47, O. 7, JULY 2002 III. COCLUDIG REMARKS A continuous-time observer, which converges in finite time, is accomplished by using the redundancy of two standard

More information

deviation of D and D from similarity (Theorem 6.). The bound is tight when the perturbation is a similarity transformation D = D? or when ^ = 0. From

deviation of D and D from similarity (Theorem 6.). The bound is tight when the perturbation is a similarity transformation D = D? or when ^ = 0. From RELATIVE PERTURBATION RESULTS FOR EIGENVALUES AND EIGENVECTORS OF DIAGONALISABLE MATRICES STANLEY C. EISENSTAT AND ILSE C. F. IPSEN y Abstract. Let ^ and ^x be a perturbed eigenpair of a diagonalisable

More information

ETNA Kent State University

ETNA Kent State University Electronic Transactions on Numerical Analysis Volume 38, pp 75-30, 011 Copyright 011, ISSN 1068-9613 ETNA PERTURBATION ANALYSIS FOR COMPLEX SYMMETRIC, SKEW SYMMETRIC, EVEN AND ODD MATRIX POLYNOMIALS SK

More information

On Hadamard and Kronecker Products Over Matrix of Matrices

On Hadamard and Kronecker Products Over Matrix of Matrices General Letters in Mathematics Vol 4, No 1, Feb 2018, pp13-22 e-issn 2519-9277, p-issn 2519-9269 Available online at http:// wwwrefaadcom On Hadamard and Kronecker Products Over Matrix of Matrices Z Kishka1,

More information

Phases of fuzzy eld theories

Phases of fuzzy eld theories Phases of fuzzy eld theories Department of Theoretical Physics Faculty of Mathematics, Physics and Informatics Comenius University, Bratislava Seminar aus Mathematischer Physik, University of Vienna 24.3.2015

More information

Linear Algebra (Review) Volker Tresp 2017

Linear Algebra (Review) Volker Tresp 2017 Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.

More information

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,

More information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 4

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 4 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 4 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 12, 2012 Andre Tkacenko

More information

A Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer. Christian{Albrechts{Universitat zu Kiel

A Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer. Christian{Albrechts{Universitat zu Kiel A Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer Christian{Albrechts{Universitat zu Kiel Institute of Computer Science, Cognitive Systems Preuerstrae 1{9, 24105 Kiel Tel:+49 431

More information

PERTURBATION ANALYSIS OF THE EIGENVECTOR MATRIX AND SINGULAR VECTOR MATRICES. Xiao Shan Chen, Wen Li and Wei Wei Xu 1. INTRODUCTION A = UΛU H,

PERTURBATION ANALYSIS OF THE EIGENVECTOR MATRIX AND SINGULAR VECTOR MATRICES. Xiao Shan Chen, Wen Li and Wei Wei Xu 1. INTRODUCTION A = UΛU H, TAIWAESE JOURAL O MATHEMATICS Vol. 6, o., pp. 79-94, ebruary 0 This paper is available online at http://tjm.math.ntu.edu.tw PERTURBATIO AALYSIS O THE EIGEVECTOR MATRIX AD SIGULAR VECTOR MATRICES Xiao Shan

More information

MATRICES WITH POSITIVE DEFINITE HERMITIAN PART: INEQUALITIES AND LINEAR SYSTEMS ROY MATHIAS

MATRICES WITH POSITIVE DEFINITE HERMITIAN PART: INEQUALITIES AND LINEAR SYSTEMS ROY MATHIAS MATRICES WITH POSITIVE DEFINITE HERMITIAN PART: INEQUALITIES AND LINEAR SYSTEMS ROY MATHIAS Abstract. The Hermitian and skew-hermitian parts of a square matrix A are dened by H(A) (A + A )=2 and S(A) (A?

More information

114 EUROPHYSICS LETTERS i) We put the question of the expansion over the set in connection with the Schrodinger operator under consideration (an accur

114 EUROPHYSICS LETTERS i) We put the question of the expansion over the set in connection with the Schrodinger operator under consideration (an accur EUROPHYSICS LETTERS 15 April 1998 Europhys. Lett., 42 (2), pp. 113-117 (1998) Schrodinger operator in an overfull set A. N. Gorban and I. V. Karlin( ) Computing Center RAS - Krasnoyars 660036, Russia (received

More information

Denition 1 Suppose V is a nonempty set and F is a eld, and that operations of vector addition and scalar multiplication are dened in the following way

Denition 1 Suppose V is a nonempty set and F is a eld, and that operations of vector addition and scalar multiplication are dened in the following way EE0A - MAE 0A - Fall 00 Review of some elements of linear algebra Prof Fernando Paganini September, 00 1 Linear spaces and mappings In this section we will introduce some of the basic ideas in linear algebra

More information

Adaptive Localization: Proposals for a high-resolution multivariate system Ross Bannister, HRAA, December 2008, January 2009 Version 3.

Adaptive Localization: Proposals for a high-resolution multivariate system Ross Bannister, HRAA, December 2008, January 2009 Version 3. Adaptive Localization: Proposals for a high-resolution multivariate system Ross Bannister, HRAA, December 2008, January 2009 Version 3.. The implicit Schur product 2. The Bishop method for adaptive localization

More information

A MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY

A MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,

More information

Stability of neutral delay-diœerential systems with nonlinear perturbations

Stability of neutral delay-diœerential systems with nonlinear perturbations International Journal of Systems Science, 000, volume 1, number 8, pages 961± 96 Stability of neutral delay-diœerential systems with nonlinear perturbations JU H. PARK{ SANGCHUL WON{ In this paper, the

More information

Economics 472. Lecture 10. where we will refer to y t as a m-vector of endogenous variables, x t as a q-vector of exogenous variables,

Economics 472. Lecture 10. where we will refer to y t as a m-vector of endogenous variables, x t as a q-vector of exogenous variables, University of Illinois Fall 998 Department of Economics Roger Koenker Economics 472 Lecture Introduction to Dynamic Simultaneous Equation Models In this lecture we will introduce some simple dynamic simultaneous

More information

Null Controllability of Discrete-time Linear Systems with Input and State Constraints

Null Controllability of Discrete-time Linear Systems with Input and State Constraints Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 2008 Null Controllability of Discrete-time Linear Systems with Input and State Constraints W.P.M.H. Heemels and

More information

Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts 1 and Stephan Matthai 2 3rd Febr

Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts 1 and Stephan Matthai 2 3rd Febr HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts and Stephan Matthai Mathematics Research Report No. MRR 003{96, Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL

More information

Numerical Linear Algebra

Numerical Linear Algebra Numerical Linear Algebra The two principal problems in linear algebra are: Linear system Given an n n matrix A and an n-vector b, determine x IR n such that A x = b Eigenvalue problem Given an n n matrix

More information