A Note on Spectra of Optimal and Superoptimal Preconditioned Matrices

Similar documents
The Best Circulant Preconditioners for Hermitian Toeplitz Systems II: The Multiple-Zero Case Raymond H. Chan Michael K. Ng y Andy M. Yip z Abstract In

BLOCK DIAGONAL AND SCHUR COMPLEMENT PRECONDITIONERS FOR BLOCK TOEPLITZ SYSTEMS WITH SMALL SIZE BLOCKS

Toeplitz-circulant Preconditioners for Toeplitz Systems and Their Applications to Queueing Networks with Batch Arrivals Raymond H. Chan Wai-Ki Ching y

Preconditioners for ill conditioned Toeplitz systems constructed from positive kernels

Singular Value and Norm Inequalities Associated with 2 x 2 Positive Semidefinite Block Matrices

Wavelets and Linear Algebra

Schur Complement Matrix And Its (Elementwise) Approximation: A Spectral Analysis Based On GLT Sequences

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES

Multiplicative Perturbation Bounds of the Group Inverse and Oblique Projection

The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix

PAijpam.eu ON THE BOUNDS FOR THE NORMS OF R-CIRCULANT MATRICES WITH THE JACOBSTHAL AND JACOBSTHAL LUCAS NUMBERS Ş. Uygun 1, S.

Moore Penrose inverses and commuting elements of C -algebras

arxiv: v3 [math.ra] 10 Jun 2016

Approximate Inverse-Free Preconditioners for Toeplitz Matrices

On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs

b jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60

Positive definite preserving linear transformations on symmetric matrix spaces

Multiple eigenvalues

Research Article A Note on Kantorovich Inequality for Hermite Matrices

RITZ VALUE BOUNDS THAT EXPLOIT QUASI-SPARSITY

InequalitiesInvolvingHadamardProductsof HermitianMatrices y

Interpolating the arithmetic geometric mean inequality and its operator version

ELA

MINIMAL NORMAL AND COMMUTING COMPLETIONS

Determinant evaluations for binary circulant matrices

Frame Diagonalization of Matrices

arxiv: v1 [math.nt] 9 May 2017

Banach Journal of Mathematical Analysis ISSN: (electronic)

The Hermitian R-symmetric Solutions of the Matrix Equation AXA = B

arxiv: v1 [math.na] 1 Sep 2018

Preconditioners for ill conditioned (block) Toeplitz systems: facts a

Singular Value Inequalities for Real and Imaginary Parts of Matrices

Notes on matrix arithmetic geometric mean inequalities

Linear Algebra and its Applications

A Smoothing Newton Method for Solving Absolute Value Equations

Key words. GMRES method, convergence bounds, worst-case GMRES, ideal GMRES, field of values

HIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION

Superlinear convergence for PCG using band plus algebra preconditioners for Toeplitz systems

Convexity of the Joint Numerical Range

GENERAL ARTICLE Realm of Matrices

OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY

ON ψ-direct SUMS OF BANACH SPACES AND CONVEXITY

On the Preconditioning of the Block Tridiagonal Linear System of Equations

Trace Inequalities for a Block Hadamard Product

Structured Matrices, Multigrid Methods, and the Helmholtz Equation

Cyclic Vector of the Weighted Mean Matrix Operator

M.A. Botchev. September 5, 2014

Efficient algorithms for finding the minimal polynomials and the

Preconditioning for Nonsymmetry and Time-dependence

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES

On the Hermitian solutions of the

1 Introduction The conjugate gradient (CG) method is an iterative method for solving Hermitian positive denite systems Ax = b, see for instance Golub

Bidiagonal decompositions, minors and applications

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

On matrix equations X ± A X 2 A = I

THE POINT SPECTRUM OF FROBENIUS-PERRON AND KOOPMAN OPERATORS

Two Results About The Matrix Exponential

c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March

Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior Point Methods

ETNA Kent State University

Distribution for the Standard Eigenvalues of Quaternion Matrices

2 Computing complex square roots of a real matrix

AN ALGORITHM FOR COMPUTING FUNDAMENTAL SOLUTIONS OF DIFFERENCE OPERATORS

ELA

Some New Results on Lyapunov-Type Diagonal Stability

University, Fort Lauderdale, FL, USA. Published online: 30 Jun To link to this article:

On marker set distance Laplacian eigenvalues in graphs.

ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS

AN ITERATION. In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b

On the spectral radius of graphs with cut edges

Numerical Methods for Solving Large Scale Eigenvalue Problems

4.3 Eigen-Analysis of Spectral Derivative Matrices 203

DAVIS WIELANDT SHELLS OF NORMAL OPERATORS

642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004

On Powers of General Tridiagonal Matrices

Toeplitz matrices: spectral properties and preconditioning in the CG method

Tensor properties of multilevel Toeplitz and related. matrices.

Generalized Numerical Radius Inequalities for Operator Matrices

Linear Algebra Massoud Malek

Computing the nearest correlation matrix a problem from finance

Note on the normalized Laplacian eigenvalues of signed graphs

Spectra of the generalized edge corona of graphs

Some bounds for the spectral radius of the Hadamard product of matrices

FACTORING MATRICES INTO THE PRODUCT OF CIRCULANT AND DIAGONAL MATRICES

Lecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?

ETNA Kent State University

arxiv: v1 [math.ra] 8 Aug 2016

ACI-matrices all of whose completions have the same rank

Orthogonal similarity of a real matrix and its transpose

MIXED PROBLEM WITH INTEGRAL BOUNDARY CONDITION FOR A HIGH ORDER MIXED TYPE PARTIAL DIFFERENTIAL EQUATION

n Inequalities Involving the Hadamard roduct of Matrices 57 Let A be a positive definite n n Hermitian matrix. There exists a matrix U such that A U Λ

Jae Heon Yun and Yu Du Han

A generalization of the Gauss-Seidel iteration method for solving absolute value equations

arxiv: v2 [math.na] 27 Dec 2016

Two applications of the theory of primary matrix functions

1 Compact and Precompact Subsets of H

Inequalities for the spectra of symmetric doubly stochastic matrices

Matrix functions that preserve the strong Perron- Frobenius property

Cosine transform preconditioners for high resolution image reconstruction

Numerical Linear Algebra And Its Applications

Transcription:

A Note on Spectra of Optimal and Superoptimal Preconditioned Matrices Che-ManCHENG Xiao-QingJIN Seak-WengVONG WeiWANG March 2006 Revised, November 2006 Abstract In this short note, it is proved that given any positive definite Hermitian matrix, the eigenvalues of the superoptimal preconditioned matrix do not exceed the corresponding eigenvalues of the optimal preconditioned matrix. Key Words: optimal preconditioner, superoptimal preconditioner, spectrum, preconditioned matrix. AMS subject classifications: 65F10, 65F15. In 1988, T. Chan[2] proposed a circulant preconditioner for Toeplitz systems. For any Toeplitz matrix T n, T. Chan s circulant preconditioner c F (T n ) is defined to be the minimizer of T n W n F where F is the Frobenius norm and W n runs over all circulant matrices. Thec F (T n )iscalledtheoptimalcirculantpreconditioner. In1992,Tyrtyshnikov [6] proposed another circulant preconditioner t F (T n ) which is defined to be the minimizer of I n Wn 1 T n F where W n runs over all nonsingular circulant matrices. Recently this preconditioner (also called superoptimal preconditioner) has been found to be a good approximation in signal processing when there exists a noise[4]. Since the optimal and superoptimal preconditioners are defined not just for Toeplitz matricesbutforgeneralmatricesaswell,webeginwiththegeneralcase. Givenaunitary DepartmentofMathematics,UniversityofMacau,Macao,China. Email: fstcmc@umac.mo. DepartmentofMathematics,UniversityofMacau,Macao,China. E-mail: xqjin@umac.mo. Theresearch of this author is supported by the Grant 050/2005/A from FDCT. DepartmentofMathematics,UniversityofMacau,Macao,China. E-mail: swvong@umac.mo. DepartmentofMathematics,UniversityofMacau,Macao,China. 1

matrixu C n n,let M U {U Λ n U Λ n isanyn ndiagonalmatrix}. (1) Wenotethatin(1),whenU =F,theFouriermatrix,M F isthesetofallcirculantmatrices [3]. Let δ(e n ) denote the diagonal matrix whose diagonal is equal to the diagonal of the matrixe n. Wehavethefollowinglemma. Lemma 1 [1]ForanyA n C n n,letc U (A n )betheminimizerof W n A n F overallw n M U. Thenc U (A n )isuniquelydeterminedbya n andisgivenby c U (A n ) U δ(ua n U )U. WhenA n ishermitianpositivedefinite,thenc U (A n )isalsohermitianpositivedefinite. Let t U (A n )betheminimizerof I n W 1 n A n F over all nonsingular W n M U. If both A n and c U (A n ) are invertible, then t U (A n ) is uniquelydeterminedbya n andisgivenby t U (A n )=c U (A n A n )[c U(A n )] 1. IfA n ishermitianpositivedefinite,wethenhavebylemma1, [c U (A n )] 1 A n = U [δ(ua n U )] 1 UA n [δ(ua n U )] 1 2(UA n U )[δ(ua n U )] 1 2 where means issimilarto,and [t U (A n )] 1 A n = c U (A n )[c U (A 2 n)] 1 A n M, (2) = U δ(ua n U )[δ(ua 2 n U )] 1 UA n δ(ua n U )[δ(ua 2 nu )] 1 UA n U (δ(ua n U )[δ(ua 2 nu )] 1 ) 1 2UA n U (δ(ua n U )[δ(ua 2 nu )] 1 ) 1 2 N. (3) 2

Wethereforehaveby(2)and(3), N = [δ(ua 2 nu )] 1 2 [δ(uan U )] 1 2 (UAn U ) [δ(ua n U )] 1 2 [δ(ua 2 n U )] 1 2 = [δ(ua 2 n U )] 1 2δ(UA n U ) M δ(ua n U )[δ(ua 2 n U )] 1 2 = DMD, (4) where D [δ(ua 2 n U )] 1 2δ(UA n U )=diag(d 1,...,d n ). Nowletusshowthefollowinglemmafirst. Lemma 2 ForanymatrixA n C n n,wehave δ(ua n A nu ) δ(ua n U ) δ(ua nu ) 0. Proof: Foreachk=1,...,n,wehave [δ(ua n A n U )] kk = [δ(ua n U UA n U )] kk = n (UA n U ) kt (UA n U ) tk = t=1 n (UA n U ) kt (UA n U ) kt t=1 (UA n U ) kk (UA n U ) kk =[δ(ua n U )] kk [δ(ua nu )] kk 0. Thus, δ(ua n A nu ) δ(ua n U ) δ(ua nu ) 0. We immediately have the following result. Corollary 1 LetA n beahermitianpositivedefinitematrix. Thenthediagonalentriesof satisfy0<d i 1fori=1,...,n. D [δ(ua 2 nu )] 1 2 δ(uan U )=diag(d 1,...,d n ) We have the following theorem about the spectra of optimal and superoptimal preconditioned matrices by using Corollary 1 and Courant-Fischer Theorem[5]. 3

Theorem 1 LetA n beahermitianpositivedefinite matrix. If the eigenvaluesareordered in the following decreasing way, λ 1 λ 2 λ n, thenwehave fork=1,2,...,n. λ k ([t U (A n )] 1 A n ) λ k ([c U (A n )] 1 A n ), Proof: Wehaveby(2)-(4),Courant-FischerTheoremandCorollary1thatfork=1,...,n, λ k ([t U (A n )] 1 A n ) = λ k (N)=λ k (DMD) = min max x DMDx y 1,...,y k 1 C n x 1, x y 1,...,y k 1 = min max (Dx) M(Dx) y 1,...,y k 1 C n x 1, (Dx) D 1 y 1,...,D 1 y k 1 min max (Dx) M(Dx) y 1,...,y k 1 C n Dx 1, (Dx) D 1 y 1,...,D 1 y k 1 z=dx y 1,...,y k 1 C n z 1, z D 1 y 1,...,D 1 y k 1 D 1 y 1,...,D 1 y k 1 C n z 1, z D 1 y 1,...,D 1 y k 1 u i =D 1 y i u 1,...,u k 1 C n z 1, z u 1,...,u k 1 = λ k (M)=λ k ([c U (A n )] 1 A n ). Hereweremark that{y 1,...,y k 1 }runsthroughallpossiblechoicesofk 1vectorsinC n ifandonlyif{d 1 y 1,...,D 1 y k 1 }runsthroughallpossiblechoicesofk 1vectorsinC n. Also,theouterminimizationisomittedwhenk=1. Remark. LetD=diag(d 1,...,d n )begivenasincorollary1. Suppose α=max{d 1,...,d n } 1. Since x 1implies Dx α,onecaneasilymodifytheproofoftheorem1tohave λ k ([t U (A n )] 1 A n ) α 2 λ k ([c U (A n )] 1 A n ), k=1,...,n. 4

This α may of theoretical interests for further analysis. However, the computation of its valueisnoteasyingeneral. References [1] R. Chan, X. Jin and M. Yeung, The Circulant Operator in the Banach Algebra of Matrices, Linear Algebra Appl., Vol. 149(1991), pp. 41 53. [2] T. Chan, An Optimal Circulant Preconditioner for Toeplitz Systems, SIAM J. Sci. Statist. Comput., Vol. 9(1988), pp. 766 771. [3] P. Davis, Circulant Matrices, 2nd edition, Chelsea Publishing, New York, 1994. [4] C. Estatico and S. Serra-Capizzano, The Superoptimal Approximation: the Case of Unbounded Symbols, submitted. [5] R. Horn and C. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985. [6] E. Tyrtyshnikov, Optimal and Superoptimal Circulant Preconditioners, SIAM J. Matrix Anal. Appl., 13(1992), pp. 459 473. 5