The extended global Lanczos method for matrix function approximation (Q1716855): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Abdeslem Hafid Bentbib / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Carl Jagels / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Khalide Jbilou / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Lothar Reichel / rank | |||
Normal rank |
Revision as of 12:24, 14 February 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
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
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