Computing the Field of Values and Pseudospectra Using the Lanczos Method with Continuation*

نویسنده

  • THIERRY BRACONNIER
چکیده

The field of values and pseudospectra are useful tools for understanding the behaviour of various matrix processes . To compute these subsets of the complex plane it is necessary to estimate one or two eigenvalues of a large number of parametrized Hermitian matrices; these computations are prohibitively expensive for large, possibly sparse, matrices, if done by use of the QR algorithm . We describe an approach based on the Lanczos method with selective reorthogonalization and Chebyshev acceleration that, when combined with continuation and a shift and invert technique, enables efficient and reliable computation of the field of values and pseudospectra for large matrices . The idea of using the Lanczos method with continuation to compute pseudospectra is not new, but in experiments reported here our algorithm is faster and more accurate than existing algorithms of this type . AMS subject classification : 65F15 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fvpspack: a Fortran and Pvm Package to Compute the Field of Values and Pseudospectra of Large Matrices Departments of Mathematics Fvpspack: a Fortran and Pvm Package to Compute the Field of Values and Pseudospectra of Large Matrices

The eld of values and pseudospectra are tools which yield insight into the spectral behavior of a matrix. For large sparse matrices, both sets can be eeciently computed using a Lanczos type method. Since both computations can be done in a natural parallel way, we have developed a package including Fortran and PVM routines. Experiments show that the PVM codes achieve excellent speed-ups and eeci...

متن کامل

Complete Iterative Method for Computing Pseudospectra

EEcient codes for computing pseudospectra of large sparse matrices usually use a Lanczos type method with the shift and invert technique and a shift equal to zero. Then, these codes are very eecient for computing pseudospectra on regions where the matrix is nonnormal (because k(A ? zI) ?1 k2 is large) but they lose their eeciency when they compute pseudospectra on regions where the spectrum of ...

متن کامل

On the computation of structured singular values and pseudospectra

Structured singular values and pseudospectra play an important role in assessing the properties of a linear system under structured perturbations. This paper discusses computational aspects of structured pseudospectra for structures that admit an eigenvalue minimization characterization, including the classes of real, skew-symmetric, Hermitian, and Hamiltonian perturbations. For all these struc...

متن کامل

Computation of Pseudospectra by Continuation

The concept of pseudospectrum was introduced by L. N. Trefethen to explain the behavior of nonnormal operators. Many phenomena (for example, hydrodynamic instability and convergence of iterative methods for linear systems) cannot be accounted for by eigenvalue analysis but are more understandable by examining the pseudospectra. The straightforward way to compute pseudospectra involves many appl...

متن کامل

Pseudospectra of rectangular matrices

Pseudospectra of rectangular matrices vary continuously with the matrix entries, a feature that eigenvalues of these matrices do not have. Some properties of eigenvalues and pseudospectra of rectangular matrices are explored, and an efficient algorithm for the computation of pseudospectra is proposed. Applications are given in (square) eigenvalue computation (Lanczos iteration), square pseudosp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996