Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithm (1)
- Algorithms (1)
- Backward stability (1)
- Conjugate gradient (1)
- Eigenpairs (1)
-
- Explicit external deflation (1)
- Factorization framework (1)
- Fixed-point (1)
- Integral operator (1)
- Iterative methods (1)
- Kernal matrices (1)
- Krylov subspace (1)
- Linear systems (1)
- Low-rank compression (1)
- Matrices (1)
- Matrix powers kernal (1)
- Parallel (1)
- Precondition (1)
- Scalability (1)
- Semi-iterative (1)
- Symmetric matrix (1)
Articles 1 - 3 of 3
Full-Text Articles in Mathematics
Lecture 08: Partial Eigen Decomposition Of Large Symmetric Matrices Via Thick-Restart Lanczos With Explicit External Deflation And Its Communication-Avoiding Variant, Zhaojun Bai
Mathematical Sciences Spring Lecture Series
There are continual and compelling needs for computing many eigenpairs of very large Hermitian matrix in physical simulations and data analysis. Though the Lanczos method is effective for computing a few eigenvalues, it can be expensive for computing a large number of eigenvalues. To improve the performance of the Lanczos method, in this talk, we will present a combination of explicit external deflation (EED) with an s-step variant of thick-restart Lanczos (s-step TRLan). The s-step Lanczos method can achieve an order of s reduction in data movement while the EED enables to compute eigenpairs in batches along with a number …
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Mathematical Sciences Spring Lecture Series
Factorization based preconditioning algorithms, most notably incomplete LU (ILU) factorization, have been shown to be robust and applicable to wide ranges of problems. However, traditional ILU algorithms are not amenable to scalable implementation. In recent years, we have seen a lot of investigations using low-rank compression techniques to build approximate factorizations.
A key to achieving lower complexity is the use of hierarchical matrix algebra, stemming from the H-matrix research. In addition, the multilevel algorithm paradigm provides a good vehicle for a scalable implementation. The goal of this lecture is to give an overview of the various hierarchical matrix formats, such …
Lecture 10: Preconditioned Iterative Methods For Linear Systems, Edmond Chow
Lecture 10: Preconditioned Iterative Methods For Linear Systems, Edmond Chow
Mathematical Sciences Spring Lecture Series
Iterative methods for the solution of linear systems of equations – such as stationary, semi-iterative, and Krylov subspace methods – are classical methods taught in numerical analysis courses, but adapting these methods to run efficiently at large-scale on high-performance computers is challenging and a constantly evolving topic. Preconditioners – necessary to aid the convergence of iterative methods – come in many forms, from algebraic to physics-based, are regularly being developed for linear systems from different classes of problems, and similarly are evolving with high-performance computers. This lecture will cover the background and some recent developments on iterative methods and preconditioning …