Exasim: Generating discontinuous Galerkin codes for numerical solutions of partial differential equations on graphics processors
Not Available
97 MATHEMATICS AND COMPUTING↗
SEARCH · Engineering Papers
Results for “numerical mathematics”
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.
Computational Physics Overview [Slides]
Computational physics is an important part of the overall investment in National Security Science at LANL. Computational physics is the study and implementation of numerical analysis to solve problems in physics for which a quantitative theory already exists. Historically, computational physics was the first application of modern computers in science. There are three key elements to computational physics: mathematical models of physical phenomena and conservation equations, computer codes that implement these models, and computer platforms that execute the code instructions and manipulate the data.
45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
Theory and Implementation of the Spectacular Nonlinear Viscoelastic Constitutive Model
This report is a comprehensive guide to the nonlinear viscoelastic Spectacular model, which is an isotropic, thermo-rheologically simple constitutive model for glass-forming materials, such as amorphous polymers. Spectacular is intermediate in complexity to the previous PEC and SPEC models (Potential Energy Clock and Simplified Potential Energy Clock models, respectively). The model form consists of two parts: a Helmholtz free energy functional and a nonlinear material clock that controls the rate of viscoelastic relaxation. The Helmholtz free energy is derived from a series expansion about a reference state. Expressions for the stress and entropy functionals are derived from the Helmholtz free energy following the Rational Mechanics approach. The material clock depends on a simplified expression for the potential energy, which itself is a functional of the temperature and strain histories. This report describes the thermo-mechanical theory of Spectacular, the numerical methods for time-integrating the model, model verification for its implementation in LAMÉ, a user guide for its implementation in LAMÉ, and ideas for future work. A number of appendices provide supplementary mathematical details and a description of the procedure used to derive the simplified potential energy from the full expression for the potential energy. The goal of this report is create a convenient point-of-entry for engineers who wish to learn more about Spectacular, but also to serve as a reference manual for advanced users of the model.
36 MATERIALS SCIENCE↗
Towards Use of Mixed Precision in ECP Math Libraries
The use of multiple types of precision in mathematical software has the potential to increase its performance on new heterogeneous architectures. The xSDK project focuses both on the investigation and development of multiprecision algorithms as well as their inclusion into xSDK member libraries. This report summarizes current efforts on including and/or using mixed precision capabilities in the math libraries Ginkgo, heFFTe, hypre, MAGMA, PETSc/TAO, SLATE, SuperLU, and Trilinos, including KokkosKernels. It contains both numerical results from libraries that already provide mixed precision capabilities, as well as descriptions of the strategies to incorporate multiprecision into established libraries.
97 MATHEMATICS AND COMPUTING↗
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians
In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.
97 MATHEMATICS AND COMPUTING↗
Solving inverse problems in stochastic models using deep neural networks and adversarial training
Inverse problems associated with stochastic models constitute a significant portion of scientific and engineering applications. In such cases the unknown quantities are distributions. The applicability of traditional methods is limited because of their demanding assumptions or prohibitive computational consumption; for example, maximum likelihood methods require closed-form density functions, and Markov Chain Monte Carlo needs a large number of simulations. We propose a new method that estimates the unknown distribution by matching the statistical properties between observed and simulated random processes. We leverage the expressive power of neural networks to approximate the unknown distribution and use a discriminative neural network for computing the statistical discrepancies between the observed and simulated random processes. Here we demonstrated numerically that the proposed methods can estimate both the model parameters and learn complicated unknown distributions.
42 ENGINEERING↗
Jas4pp — A data-analysis framework for physics and detector studies
This paper describes the Jas4pp framework for exploring physics cases and for detector-performance studies of future particle collision experiments. Jas4pp is a multi-platform Java program for numeric calculations, scientific visualization in 2D and 3D, storing data in various file formats and displaying collision events and detector geometries. It also includes complex data-analysis algorithms for function minimization, regression analysis, event reconstruction (such as jet reconstruction), limit settings and other libraries widely used in particle physics. The framework can be used with several scripting languages, such as Python/Jython, Groovy and JShell. Several benchmark tests discussed in the paper illustrate significant improvements in the performance of the Groovy and JShell scripting languages compared to the standard Python implementation in C. Furthermore, the improvements for numeric computations in Java are attributed to recent enhancements in the Java Virtual Machine.
97 MATHEMATICS AND COMPUTING↗
Weighted Composition Operators for Learning Nonlinear Dynamics
Operator theoretic methods in dynamical system have been dominated by the use of Koopman operators and their continuous time counterparts, such as Koopman Generators and Liouville Operators. The advantage gained from their use primarily stems from the ability to extract subspaces and eigenfunctions within a space of observables that are invariant with respect to the Koopman operator over that space. When this occurs, a dynamic mode decomposition of the systems state provides a linear model for the dynamical system. Not all Koopman operators have eigenfunctions that may be exploited in this manner. However, the framework can still be leveraged for approximations using other operators. In this setting, we present a different operator for the study of dynamical systems, the weighted composition operator. These operators are compact for a wide range of dynamics and spaces, and through their interactions with occupation kernels and vector valued kernels, they admit an estimation of the underlying dynamics. Here, this manuscript presents a new algorithm for the data driven study of dynamical systems from data, and also provides two numerical experiments where convergence is achieved as a proof of concept.
97 MATHEMATICS AND COMPUTING↗
Efficient hybrid explicit-implicit learning for multiscale problems
Splitting method is a powerful method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. Here, in this paper, our goal is to use temporal splitting concepts in designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. We propose a machine learning assisted splitting scheme which improves the efficiency of the scheme meanwhile preserves the accuracy. We consider a recently introduced multiscale splitting algorithms, where the multiscale problem is solved on a coarse grid. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. This splitting concept allows identifying degrees of freedom that need implicit treatment. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation of the splitting scheme successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection between them. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem which approximates the target. Our machine learning model can incorporate and encode the given information from two different problems and then solve the target problems. We conduct four numerical examples and the results show that our method is stable and accurate.
97 MATHEMATICS AND COMPUTING↗
Local Lagrangian reduced-order modeling for the Rayleigh-Taylor instability by solution manifold decomposition
The Rayleigh-Taylor instability is a classical hydrodynamic instability of great interest in various disciplines of science and engineering, including astrophysics, atmospheric sciences and climate, geophysics, and fusion energy. Analytical methods cannot be applied to explain the long-time behavior of the Rayleigh-Taylor instability, and therefore, numerical simulation of the full problem is required. However, in order to capture the growth of amplitude of perturbations accurately, both the spatial and temporal discretizations need to be extremely fine for traditional numerical methods, and long-time simulation may become prohibitively expensive. In this paper, we propose efficient reduced order model techniques to accelerate the simulation of the Rayleigh-Taylor instability in compressible gas dynamics. Here, we introduce a general framework for decomposing the solution manifold to construct the temporal domain partition and temporally-local reduced order model construction with varying Atwood number. We propose two practical approaches in this framework, namely decomposition by physical time and by penetration distance. Numerical results are presented to examine the performance of the proposed approaches.
97 MATHEMATICS AND COMPUTING↗
An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation
In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.
97 MATHEMATICS AND COMPUTING↗
Three-Phase Modeling in Sockeye
The heat pipe simulation tool Sockeye is given the capability to allow the presence of the solid phase of the heat pipe working fluid, which is necessary for modeling transients to and from room temperature, since microreactor designs feature high-temperature heat pipes employing metal working fluids. The liquid phase equations are converted to equations for the mixture of liquid and solid phases, with a simple latent heat relation determining the fractions of these phases. This capability is introduced while preserving equivalent solutions for the liquid-vapor regime. Theory is presented, along with numerical examples to illustrate the propagation of a melt front and startup from the solid state.
97 MATHEMATICS AND COMPUTING↗
Evaluating Space Object Conjunction Probabilities Using Characteristic Function Inversion
This report discusses an approach to computing the probability of a conjunction between two space objects in the short-term encounter scenario. A conjunction is defined here as an event where the miss distance between the objects is less than some specified value. The scenario assumptions are that the motion of the objects is linear, their positions are Gaussian distributed, and their velocities are known and constant. Under these assumptions, the squared-miss distance is shown to have the generalized chi-square distribution. An established statistical technique called characteristic function inversion is employed to evaluate the distribution and obtain conjunction probabilities. The method is closely related to a recent approach based on moment generating function inversion, and a qualitative comparison of the approaches is provided. Last, the method is tested on several benchmark test cases where it agrees with numerical integration on the cases with conjunction probabilities above 10 –12 . However, the exact probability in these cases is usually not needed and this probability can be bounded above using an independent Gaussian approximation. Overall, the report shows how to compute conjunction probabilities using a standard statistical method, though numerical integration seems to perform equally well.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Energy conserving quadrature based dimensionality reduction for nonlinear hydrodynamics problems
Projection based dimensionality reduction is used to approximate the full discretiza tion of a PDE problem in order to reduce the cost of its numerical simulation while staying faithful to the full dynamics. For nonlinear problems, hyperreduction methods are additionally needed to remove the dependence of the nonlinear terms on the full problem’s size. In this project, we develop an energy conserving hyperreduction method and apply it to Eulerian-Lagrangian hydrodynamics problems, demonstrating that the reduced model successfully accelerates the numerical simulations while conserving the problem’s total energy with high accuracy.
97 MATHEMATICS AND COMPUTING↗
Cooperative Systems in Presence of Cyber-Attacks: A Unified Framework for Resilient Control and Attack Identification
Here, this paper considers a cooperative control problem in presence of unknown attacks. The attacker aims at destabilizing the consensus dynamics by intercepting the system’s communication network and corrupting its local state feedback. We first revisit the virtual network based resilient control proposed in our previous work and provide a new interpretation and insights into its implementation. Based on these insights, a novel distributed algorithm is presented to detect and identify the compromised communication links. It is shown that it is not possible for the adversary to launch a harmful and stealthy attack by only manipulating the physical states being exchanged via the network. In addition, a new virtual network is proposed which makes it more difficult for the adversary to launch a stealthy attack even though it is also able to manipulate information being exchanged via the virtual network. A numerical example demonstrates that the proposed control framework achieves simultaneously resilient operation and real-time attack identification.
97 MATHEMATICS AND COMPUTING↗
Constructing a conforming Voronoi mesh for an arbitrarily-shaped enclosed geometric domain
A computing system is described herein, where the computing system includes a processor and memory storing instructions that, when executed by the processor, cause the processor to perform the following acts: 1) receiving a computer-implemented definition of an enclosed geometric domain, wherein the geometric domain is two-dimensional; 2) determining locations of seeds for the enclosed geometric domain; 3) decomposing the enclosed geometric domain into a conforming Voronoi mesh based on the locations of the seeds, wherein the conforming Voronoi mesh comprises Voronoi cells, and further wherein the conforming Voronoi mesh is bounded by the enclosed domain; and 4) performing a numerical simulation to generate simulation results, wherein the numerical simulation is based on at least one Voronoi cell in the Voronoi cells of the conforming Voronoi mesh.
97 MATHEMATICS AND COMPUTING↗
Constructing a conforming voronoi mesh for an arbitrarily-shaped enclosed geometric domain
A computing system is described herein, where the computing system includes a processor and memory storing instructions that, when executed by the processor, cause the processor to perform the following acts: 1) receiving a computer-implemented definition of an enclosed geometric domain, wherein the geometric domain is three-dimensional; 2) determining locations of seeds for the enclosed geometric domain; 3) decomposing the enclosed geometric domain into a conforming Voronoi mesh based on the locations of the seeds, wherein the conforming Voronoi mesh comprises Voronoi cells, and further wherein the conforming Voronoi mesh is bounded by the enclosed domain; and 4) performing a numerical simulation to generate simulation results, wherein the numerical simulation is based on at least one Voronoi cell in the Voronoi cells of the conforming Voronoi mesh.
97 MATHEMATICS AND COMPUTING↗
NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations
In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.
97 MATHEMATICS AND COMPUTING↗