Publications

Journal of Computational and Applied Mathematics

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

Climate impacts have broad economic, health, political, and national security ramifications. Societally relevant impacts are typically farther downstream, are the product of multiple interacting processes, and can arise over small regions and timeframes because their sources are short-term and localized. Short-term forcings (as can be seen in volcanic eruptions, climatic tipping points (e.g., the collapse of rainforests or the disappearance of sea ice), or in increasingly plausible climate interventions) fundamentally possess low signal-to-noise and could benefit from accounting for the multiple conditional processes through which a downstream impact arises. Under the Grand Challenge LDRD CLDERA (CLimate impacts: Discovering Etiology thRough pAthways), we have developed tools to enable downstream impact attribution from geographically and temporally localized source forcings in the climate. CLDERA developed methods that can distinguish how a localized source drives the climate system to respond with particular impacts. The how is embodied in pathways – the spatio-temporally evolving chain of physical processes that connects a source to a series of increasingly distant impacts. Novel analytic methods in pursuit of downstream impact attribution were developed and demonstrated on simulations and observations of the 1991 eruption of Mt. Pinatubo in the Philippines. As described within this report we have • developed stratospheric expertise and aerosol modeling capabilities in E3SM, • created original methods to detect and model pathways from source-to-impact, and • advanced climate attribution through novel methods, cases, and approaches. Further, CLDERA developed a tiered verification process consisting of controlled datasets to prototype, verify, and refine the original method development. CLDERA increased Sandia’s footprint in the climate analytics community and developed new climate collaborations whilst also creating a cadre of climate analysts at Sandia. The products from CLDERA have been extensive with a total of 9 journal articles published, 12 articles submitted and under review, and an additional 8 articles in preparation. We have produced 1750 simulated years and developed 9 code-bases. This report details these accomplishments and serves as a summary of the work completed during the CLDERA Grand Challenge.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational domain. The two most common families of patch-based methods are block-Jacobi and Schwarz methods, where the former typically corresponds to non-overlapping domains and the later implies some overlap. We focus on cases where each patch consists of the degrees of freedom on a finite element method mesh cell. Patch methods often capture complex local physics much more effectively than simpler point-smoothers such as Jacobi; however, forming, inverting, and applying each patch can be prohibitively expensive in terms of both storage and computation time. To this end, we propose several approaches for performing analysis on these patches and constructing a reduced representation. The compression techniques rely on either matrix norm comparisons or unsupervised learning via a clustering approach. We illustrate how it is frequently possible to retain/factor less than 5% of all patches and still develop a method that converges only a little slower than when all patches are stored/factored.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.