TRLan
TRLan software package This software package implements the thick-restart Lanczos method. It can be used on either a single address space machine or a distributed parallel machine. The user can choose to implement or use a matrix-vector multiplication routine in any form convenient. Most of the arithmetic computations in the software are done through calls to BLAS and LAPACK. The software is written in Fortran 90. Because Fortran 90 offers many utility functions such functions such as dynamic memory management, timing functions, random number generator and so on, the program is easily portable to different machines without modifying the source code. It can also be easily accessed from other language such as C or C++. Since the software is highly modularized, it relatively easy to adopt it for different type of situation. For example if the eigenvalue problem may have some symmetry and only a portion of the physical domain is discretized, then the dot-product routine needs to be modified. In this software, this modification is limited to one subroutine. It also can be instructed to write checkpoint files so that it can be restarted is a later time.
Keywords for this software
References in zbMATH (referenced in 68 articles )
Showing results 1 to 20 of 68.
Sorted by year (- Feng, Bo; Wu, Gang: On a new variant of Arnoldi method for approximation of eigenpairs (2022)
- Baglama, James; Bella, Tom; Picucci, Jennifer: Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix (2021)
- Baglama, James; Bella, Tom; Picucci, Jennifer: Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix (2021)
- Beinert, Robert; Steidl, Gabriele: Robust PCA via regularized \textscReaperwith a matrix-free proximal algorithm (2021)
- Hashemian, Ali; Pardo, David; Calo, Victor M.: Refined isogeometric analysis for generalized Hermitian eigenproblems (2021)
- Hu, Qian-Ying; Wen, Chun; Huang, Ting-Zhu; Shen, Zhao-Li; Gu, Xian-Ming: A variant of the Power-Arnoldi algorithm for computing PageRank (2021)
- Ishikawa, Ken-Ichi; Sogabe, Tomohiro: A thick-restart Lanczos type method for Hermitian (J)-symmetric eigenvalue problems (2021)
- Dax, Achiya: A cross-product approach for low-rank approximations of large matrices (2020)
- Andersen, Christian; Bulava, John; Hörz, Ben; Morningstar, Colin: The (I= 1) pion-pion scattering amplitude and timelike pion form factor from (N_f=2+1) lattice QCD (2019)
- Dax, Achiya: Computing the smallest singular triplets of a large matrix (2019)
- Goldenberg, Steven; Stathopoulos, Andreas; Romero, Eloy: A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices (2019)
- Ju, S. H.; Hsu, H. H.: An out-of-core eigen-solver with OpenMP parallel scheme for large spare damped system (2019)
- Li, Ruipeng; Xi, Yuanzhe; Erlandson, Lucas; Saad, Yousef: The eigenvalues slicing library (EVSL): algorithms, implementation, and software (2019)
- Wu, Lingfei; Xue, Fei; Stathopoulos, Andreas: TRPL+K: thick-restart preconditioned Lanczos+K method for large symmetric eigenvalue problems (2019)
- Alfonso Iodice D’Enza, Angelos Markos, Davide Buttarazzi: The idm Package: Incremental Decomposition Methods in R (2018) not zbMATH
- Rahman, Sharif: A Galerkin isogeometric method for Karhunen-Loève approximation of random fields (2018)
- Aishima, Kensuke: On convergence of iterative projection methods for symmetric eigenvalue problems (2017)
- Bosch, Jessica; Greif, Chen: Numerical solution of linear eigenvalue problems (2017)
- Dax, Achiya: The numerical rank of Krylov matrices (2017)
- Dong, Yongxin; Gu, Chuanqing; Chen, Zhibing: An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank (2017)