Approximating the weighted pseudospectra of large matrices

被引：1
|
作者：
Astudillo, R. [1 ]
Castillo, Z. [1 ]
机构：
[1] Cent Univ Venezuela, Escuela Comp, Ctr Calculo Cient & Tecnol, Caracas, Venezuela
来源：
MATHEMATICAL AND COMPUTER MODELLING | 2013年 / 57卷 / 9-10期
关键词：
Spectrum; Pseudospectrum; Weighted pseudospectrum; Arnoldi method; Weighted Arnoldi factorization; COMPUTATION;
D O I：
10.1016/j.mcm.2011.03.029
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In different applications it is necessary to compute the pseudospectra of matrices in an energy or weighted norm. In this work we develop a practical method to convert an Arnoldi factorization based on the Euclidean inner product into another Arnoldi factorization in a weighted inner product. We also propose how to use this approach to find a portion of the weighted pseudospectra of large matrices. Numerical results on different test problems are presented. (c) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码：2169 / 2176
页数：8
相关论文
共 50 条
  • [31] A method for approximating pairwise comparison matrices by consistent matrices
    Fulop, Janos
    JOURNAL OF GLOBAL OPTIMIZATION, 2008, 42 (03) : 423 - 442
  • [32] LOCALIZATION AND PSEUDOSPECTRA OF TWISTED TOEPLITZ MATRICES WITH APPLICATIONS TO ION CHANNELS
    Burrage, Kevin
    Burrage, Pamela
    MacNamara, Shev
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2021, 42 (04) : 1656 - 1679
  • [33] A method for approximating symmetrically reciprocal matrices by transitive matrices
    Dahl, G
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 403 : 207 - 215
  • [34] Approximating Runge-Kutta matrices by triangular matrices
    W. Hoffmann
    J. J. B. De Swart
    BIT Numerical Mathematics, 1997, 37 : 346 - 354
  • [35] APPROXIMATING SPECTRAL SUMS OF LARGE-SCALE MATRICES USING STOCHASTIC CHEBYSHEV APPROXIMATIONS
    Han, Insu
    Malioutov, Dmitry
    Avron, Haim
    Shin, Jinwoo
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2017, 39 (04): : A1558 - A1585
  • [36] Approximating sparse Hessian matrices using large-scale linear least squares
    Fowkes, Jaroslav M.
    Gould, Nicholas I. M.
    Scott, Jennifer A.
    NUMERICAL ALGORITHMS, 2024, 96 (04) : 1675 - 1698
  • [37] The Projection Methods for Computing the Pseudospectra of Large Matrix
    Wang, Zhengsheng
    Shen, Xing
    PROCEEDINGS OF THE THIRD INTERNATIONAL WORKSHOP ON MATRIX ANALYSIS AND APPLICATIONS, VOL 3, 2009, : 321 - 324
  • [38] On the hardness of approximating the permanent of structured matrices
    Codenotti, B
    Shparlinski, IE
    Winterhof, A
    COMPUTATIONAL COMPLEXITY, 2002, 11 (3-4) : 158 - 170
  • [39] ON THE COMPLEXITY OF APPROXIMATING EXTREMAL DETERMINANTS IN MATRICES
    KHACHIYAN, L
    JOURNAL OF COMPLEXITY, 1995, 11 (01) : 138 - 153
  • [40] On the hardness of approximating the permanent of structured matrices
    Bruno Codenotti
    John D. Shparlinski
    Arne Winterhof
    computational complexity, 2002, 11 : 158 - 170
12345