On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods

1980 ◽  
Vol 17 (5) ◽  
pp. 687-706 ◽  
Author(s):  
Y. Saad
Keyword(s):  
Rates Of Convergence ◽  
Block Lanczos ◽  
Lanczos Methods

scholarly journals Indefinite Ruhe’s Variant of the Block Lanczos Method for Solving the Systems of Linear Equations

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
M. Ghasemi Kamalvand ◽  
K. Niazi Asil
Keyword(s):  
Scalar Product ◽  
Hermitian Matrix ◽  
Linear Equations ◽  
Lanczos Method ◽  
Krylov Methods ◽  
Block Arnoldi ◽  
Systems Of Linear Equations ◽  
Block Lanczos ◽  
Lanczos Methods ◽  
Block Lanczos Method

In this paper, we equip Cn with an indefinite scalar product with a specific Hermitian matrix, and our aim is to develop some block Krylov methods to indefinite mode. In fact, by considering the block Arnoldi, block FOM, and block Lanczos methods, we design the indefinite structures of these block Krylov methods; along with some obtained results, we offer the application of this methods in solving linear systems, and as the testifiers, we design numerical examples.

scholarly journals Iterative Methods for the Computation of the Perron Vector of Adjacency Matrices

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1522
Author(s):  
Anna Concas ◽  
Lothar Reichel ◽  
Giuseppe Rodriguez ◽  
Yunzi Zhang
Keyword(s):  
Iterative Methods ◽  
Adjacency Matrix ◽  
Lanczos Method ◽  
Power Method ◽  
Arnoldi Method ◽  
Multiple Eigenvalues ◽  
Computer Storage ◽  
Adjacency Matrices ◽  
Lanczos Methods ◽  
Perron Vector

The power method is commonly applied to compute the Perron vector of large adjacency matrices. Blondel et al. [SIAM Rev. 46, 2004] investigated its performance when the adjacency matrix has multiple eigenvalues of the same magnitude. It is well known that the Lanczos method typically requires fewer iterations than the power method to determine eigenvectors with the desired accuracy. However, the Lanczos method demands more computer storage, which may make it impractical to apply to very large problems. The present paper adapts the analysis by Blondel et al. to the Lanczos and restarted Lanczos methods. The restarted methods are found to yield fast convergence and to require less computer storage than the Lanczos method. Computed examples illustrate the theory presented. Applications of the Arnoldi method are also discussed.

Parallel computation of arbitrarily shaped waveguide modes using BI-RME and Lanczos methods

2006 ◽  
Vol 23 (4) ◽  
pp. 273-284
Author(s):  
A. M. Vidal ◽  
A. Vidal ◽  
V. E. Boria ◽  
V. M. García
Keyword(s):  
Parallel Computation ◽  
Waveguide Modes ◽  
Lanczos Methods
Sign in / Sign up

Export Citation Format

Share Document