Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Dynamical Systems
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 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 …
An Update On The Computational Theory Of Hamiltonian Period Functions, Bradley Joseph Klee
An Update On The Computational Theory Of Hamiltonian Period Functions, Bradley Joseph Klee
Graduate Theses and Dissertations
Lately, state-of-the-art calculation in both physics and mathematics has expanded to include the field of symbolic computing. The technical content of this dissertation centers on a few Creative Telescoping algorithms of our own design (Mathematica implementations are given as a supplement). These algorithms automate analysis of integral period functions at a level of difficulty and detail far beyond what is possible using only pencil and paper (unless, perhaps, you happen to have savant-level mental acuity). We can then optimize analysis in classical physics by using the algorithms to calculate Hamiltonian period functions as solutions to ordinary differential equations. The simple …
Equations Of Variation For Ordinary Differential Equations On Manifolds, J. B. Bennett
Equations Of Variation For Ordinary Differential Equations On Manifolds, J. B. Bennett
Journal of the Arkansas Academy of Science
No abstract provided.