A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
Not provided.
Computer Science↗
SEARCH · Search NASA
Results for “MATHEMATICS - CALCUS, OPERATIONAL”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Parallel and distributed asynchronous adaptive stochastic gradient methods
Not provided.
Computer Science↗
Nonintrusive projection-based reduced order modeling using stable learned differential operators
Nonintrusive projection-based reduced order models (ROMs) are essential for dynamics prediction in multi-query applications where underlying governing equations are known but the access to the source of the underlying full order model (FOM) is unavailable; that is, FOM is a glass-box. This article proposes a learn-then-project approach for nonintrusive model reduction. In the first step of this approach, high-dimensional stable sparse learned differential operators (S-LDOs) are determined using the generated data. In the second step, the ordinary differential equations, comprising these S-LDOs, are used with suitable dimensionality reduction and low-dimensional subspace projection methods to provide equations for the evolution of reduced states. This approach allows easy integration into the existing intrusive ROM framework to enable nonintrusive model reduction while allowing the use of Petrov–Galerkin projections. The applicability of the proposed approach is demonstrated for Galerkin and LSPG projection-based ROMs through four numerical experiments: 1-D scalar advection, 1-D Burgers, 2-D scalar advection and 1-D scalar advection–diffusion–reaction equations. In conclusion, the results indicate that the proposed nonintrusive ROM strategy provides accurate and stable dynamics prediction.
42 ENGINEERING↗
Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods
Not provided.
Computer Science↗
Derivative-free bound-constrained optimization for solving structured problems with surrogate models
Not provided.
Computer Science↗
Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs
Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.
Data refactoring↗
ASCEND: Asymptotically compatible strong form foundations for nonlocal discretization
Nonlocal models naturally handle a range of physics of interest to SNL, but discretization of their underlying integral operators poses mathematical challenges to realize the accuracy and robustness commonplace in discretization of local counterparts. This project focuses on the concept of asymptotic compatibility, namely preservation of the limit of the discrete nonlocal model to a corresponding well-understood local solution. We address challenges that have traditionally troubled nonlocal mechanics models primarily related to consistency guarantees and boundary conditions. For simple problems such as diffusion and linear elasticity we have developed complete error analysis theory providing consistency guarantees. We then take these foundational tools to develop new state-of-the-art capabilities for: lithiation-induced failure in batteries, ductile failure of problems driven by contact, blast-on-structure induced failure, brittle/ductile failure of thin structures. We also summarize ongoing efforts using these frameworks in data-driven modeling contexts. This report provides a high-level summary of all publications which followed from these efforts.
97 MATHEMATICS AND COMPUTING↗
Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs
Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.
Chen, Jieyang↗
Data-Centric Approach to Capture Non-Polynomial Nonlinear Dynamics
We propose an analytical construction of observable functions in the extended dynamic mode decomposition (EDMD) algorithm. EDMD is a numerical method for approximating the spectral properties of the Koopman operator. The choice of observable functions is fundamental for applying EDMD to nonlinear problems arising in systems and control. Existing methods either start from a set of dictionary functions and look for the subset that best fits the underlying nonlinear dynamics or rely on machine learning algorithms to “learn” observable functions. Conversely, in this paper, we start from the dynamical system model and lift it through the Lie derivatives, rendering it into a polynomial form. This proposed transformation into a polynomial form is exact and provides an adequate set of observable functions. The strength of the proposed approach is its applicability to a broader class of nonlinear dynamical systems, particularly those with nonpolynomial functions and compositions thereof. Moreover, it retains the physical interpretability of the underlying dynamical system and can be readily integrated into existing numerical libraries. We demonstrate the proposed approach with an application to electric power systems. The modeled system consists of a single generator connected to an infinite bus, where nonlinear terms include sine and cosine functions. The results demonstrate the effectiveness of the proposed procedure in off-attractor nonlinear dynamics for estimation and prediction; the observable functions obtained from the proposed construction outperform methods that use dictionary functions comprising monomials or radial basis functions.
extended dynamic mode decomposition↗
Perturbation theory for the logarithm of a positive operator
In various contexts in mathematical physics, such as out-of-equilibrium physics and the asymptotic information theory of many-body quantum systems, one needs to compute the logarithm of a positive unbounded operator. Examples include the von Neumann entropy of a density matrix and the flow of operators with the modular Hamiltonian in the Tomita-Takesaki theory. Often, one encounters the situation where the operator under consideration, which we denote by ∆, can be related by a perturbative series to another operator ∆ 0 , whose logarithm is known. We set up a perturbation theory for the logarithm log ∆. It turns out that the terms in the series possess a remarkable algebraic structure, which enables us to write them in the form of nested commutators plus some “contact terms”.
97 MATHEMATICS AND COMPUTING↗
Radiological Safety Analysis Computer (RSAC) Program Version 7.4 Users’ Manual
The Radiological Safety Analysis Computer (RSAC) Program Version 7.4 (RSAC-7) is the newest version of the RSAC legacy code. RSAC-7 calculates the consequences of a release of radionuclides to the atmosphere. Users generates a fission product inventory from either reactor operating history or a nuclear criticality event. RSAC-7 models the effects of high-efficiency particulate air filters or other cleanup systems and calculates the decay and ingrowth during transport through processes, facilities, and the environment. Doses are calculated for inhalation, air immersion, ground surface, ingestion, and cloud gamma pathways. RSAC-7 is used as a tool to evaluate accident conditions in emergency response scenarios, radiological sabotage events, and safety basis accident consequences. This users’ manual contains the mathematical models and operating instructions for RSAC-7. Instructions, screens, and examples are provided to guide the user through the functions provided by RSAC-7. This program is designed for users who are familiar with radiological dose assessment methods.
73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Self-duality under gauging a non-invertible symmetry
Abstract We discuss two-dimensional conformal field theories (CFTs) which are invariant under gauging a non-invertible global symmetry. At every point on the orbifold branch ofc= 1 CFTs, it is known that the theory is self-dual under gauging a ℤ 2 × ℤ 2 symmetry, and has Rep(H 8 ) and Rep(D 8 ) fusion category symmetries as a result. We find that gauging the entire Rep(H 8 ) fusion category symmetry maps the orbifold theory at radiusRto that at radius 2/R. AtR=$$ \sqrt{2} $$ 2 , which corresponds to two decoupled Ising CFTs (Ising 2 in short), the theory is self-dual under gauging the Rep(H 8 ) symmetry. This implies the existence of a topological defect line in the Ising 2 CFT obtained from half-space gauging of the Rep(H 8 ) symmetry, which commutes with thec= 1 Virasoro algebra but does not preserve the fully extended chiral algebra. We bootstrap its action on thec= 1 Virasoro primary operators, and find that there are no relevant or marginal operators preserving it. Mathematically, the new topological line combines with the Rep(H 8 ) symmetry to form a bigger fusion category which is a ℤ 2 -extension of Rep(H 8 ). We solve the pentagon equations including the additional topological line and find 8 solutions, where two of them are realized in the Ising 2 CFT. Finally, we show that the torus partition functions of the Monster 2 CFT and Ising×Monster CFT are also invariant under gauging the Rep(H 8 ) symmetry.
Physics↗