The extended global Lanczos method for matrix function approximation (Q1716855): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On some properties of the extended block and global Arnoldi methods with applications to model reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding matrix functionals via partial global block Lanczos decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of some block Krylov subspace methods for multiple linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadrature on the half-line and two-point Padé approximants to Stieltjes functions. I. Algebraic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of the block GMRES and block Arnoldi methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: GCV for Tikhonov regularization by partial SVD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Arnoldi methods for large low-rank Sylvester matrix equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extended Krylov subspace method and orthogonal Laurent polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global FOM and GMRES algorithms for matrix equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new investigation of the extended Krylov subspace method for matrix function evaluations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Trace Ratio Optimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods for Electronic Structure Calculations of Materials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations / rank
 
Normal rank

Latest revision as of 02:37, 18 July 2024

scientific article
Language Label Description Also known as
English
The extended global Lanczos method for matrix function approximation
scientific article

    Statements

    The extended global Lanczos method for matrix function approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2019
    0 references
    In problems arising in network analysis, machine learning and electronic structure computation among others, there is a need to compute the trace of a large symmetric matrix. In the literature, the global Lanczos method or an extended Lanczos method is applied to compute the trace approximately. The present work describes an extended global Lanczos method and discusses properties of the corresponding Gauss-Laurent quadrature rules. Numerical illustrations are presented, showing that, while the (standard) global Lanczos method is faster, the new procedure requires fewer iterations.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    extended Krylov subspace
    0 references
    extended moment matching
    0 references
    Laurent polynomial
    0 references
    global Lanczos method
    0 references
    matrix function
    0 references
    Gauss quadrature rule
    0 references
    0 references