Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithm (2)
- Exascale (2)
- Algebraic multigrid (1)
- Backward stability (1)
- Classical memory (1)
-
- Coarsening algorithm (1)
- Commodity processors (1)
- Computer architecture (1)
- Dynamic scheduling (1)
- Eigenpairs (1)
- Exascale algorithms (1)
- Exascale computing (1)
- Explicit external deflation (1)
- Fused multiply-add (1)
- Heterogeneity (1)
- High performance computing (1)
- Innovations (1)
- Integrators (1)
- Linear algebra (1)
- Linear systems (1)
- Math software (1)
- Mathematical sciences (1)
- Matrices (1)
- Matrix (1)
- Matrix powers kernal (1)
- Memory model (1)
- Multigrid (1)
- Multiphysics (1)
- Multirate (1)
- Off-node data (1)
Articles 1 - 6 of 6
Full-Text Articles in Engineering
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 12: Recent Advances In Time Integration Methods And How They Can Enable Exascale Simulations, Carol S. Woodward
Lecture 12: Recent Advances In Time Integration Methods And How They Can Enable Exascale Simulations, Carol S. Woodward
Mathematical Sciences Spring Lecture Series
To prepare for exascale systems, scientific simulations are growing in physical realism and thus complexity. This increase often results in additional and changing time scales. Time integration methods are critical to efficient solution of these multiphysics systems. Yet, many large-scale applications have not fully embraced modern time integration methods nor efficient software implementations. Hence, achieving temporal accuracy with new and complex simulations has proved challenging. We will overview recent advances in time integration methods, including additive IMEX methods, multirate methods, and parallel-in-time approaches, expected to help realize the potential of exascale systems on multiphysics simulations. Efficient execution of these methods …
Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra
Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra
Mathematical Sciences Spring Lecture Series
In this talk, we will look at the current state of high performance computing and look at the next stage of extreme computing. With extreme computing, there will be fundamental changes in the character of floating point arithmetic and data movement. In this talk, we will look at how extreme-scale computing has caused algorithm and software developers to change their way of thinking on implementing and program-specific applications.
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Mathematical Sciences Spring Lecture Series
Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Mathematical Sciences Spring Lecture Series
Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …
Lecture 01: Scalable Solvers: Universals And Innovations, David Keyes
Lecture 01: Scalable Solvers: Universals And Innovations, David Keyes
Mathematical Sciences Spring Lecture Series
As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …