Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “differential equation solver”

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.

At least 55 records · Page 3

Identifying Differential Equations in Fourier Domain (FourierIdent)

We investigate identifying differential equations in the frequency domain. Fourier analysis is an important tool in theoretical analysis and numerical solvers of differential equations, yet there is limited work in exploring this connection in the identification of differential equations. This paper aims to identify the underlying differential equation in the frequency domain, from a given single realization of the differential equation perturbed by noise. Such setting imposes difficulties which are different from other identification methods where computation is carried out in the physical domain. We propose several ways to mitigate the challenges arising from noise in data and large differences in the magnitudes of frequency responses. The main takeaways are that identifying differential equations solely in the frequency domain is challenging, the method we propose is based on a form of domain partitions in the frequency domain, and this method shows benefits for complex data even with high level of noise. We introduce a Fourier feature denoising, and define the meaningful data region and the core regions of features to reduce the effect of noise in the frequency domain and to enhance the accuracy in coefficient identification. The proposed method is tested on various differential equations with linear, nonlinear, and high-order derivative feature terms, and shows advantages on complex data with many frequency modes, even under high level of noise.

97 MATHEMATICS AND COMPUTING↗

Integrating deep neural networks with full-waveform inversion: Reparameterization, regularization, and uncertainty quantification

Full-waveform inversion (FWI) is an accurate imaging approach for modeling the velocity structure by minimizing the misfit between recorded and predicted seismic waveforms. However, the strong nonlinearity of FWI resulting from fitting oscillatory waveforms can trap the optimization in local minima. We have adopted a neural-network-based full-waveform inversion (NNFWI) method that integrates deep neural networks with FWI by representing the velocity model with a generative neural network. Neural networks can naturally introduce spatial correlations as regularization to the generated velocity model, which suppresses noise in the gradients and mitigates local minima. Furthermore, the velocity model generated by neural networks is input to the same partial differential equation (PDE) solvers used in conventional FWI. The gradients of the neural networks and PDEs are calculated using automatic differentiation, which back propagates gradients through the acoustic PDEs and neural network layers to update the weights of the generative neural network. Experiments on 1D velocity models, the Marmousi model, and the 2004 BP model determine that NNFWI can mitigate local minima, especially for imaging high-contrast features such as salt bodies, and it significantly improves the inversion in the presence of noise. Adding dropout layers to the neural network model also allows analyzing the uncertainty of the inversion results through Monte Carlo dropout. NNFWI opens a new pathway to combine deep learning and FWI for exploiting the characteristics of deep neural networks and the high accuracy of PDE solvers. Because NNFWI does not require extra training data and optimization loops, it provides an attractive and straightforward alternative to conventional FWI.

58 GEOSCIENCES↗

Multigrid solvers on parallel computers

Massively parallel computers, as considered in this investigation, are not yet available. However, a large-scale parallel computer cannot usefully be designed before the hypothetical algorithms which will employ it are studied. Most of the studies of parallel partial differential equations (PDE) solvers are based on solution techniques much slower (on sequential machines) than multigrid methods. Multigrid methods are highly parallelizable. Each of their processes can simultaneously be performed at all grid points. The present investigation is concerned with a preliminary exploration of the potential of multigrid, or, more generally, Multi-Level Adaptive Techniques (MLAT) on computers with many processors. Basic processes are considered, taking into account coarse-grid approximation, relaxation, coarse-grid corrections, full multigrid algorithms, nonlinear problems and eigenvalue problems, fine-to-coarse correction, and chains of problems. Details of parallel multigrid processing are also examined.

Brandt, A.↗

Numerical simulation of RHIC polarized proton run 17 spin flipper experiments

RHIC nine-magnet spin flipper has been operated successfully during RHIC polarized proton Run 17, with 97% spin flip efficiency achieved. The results show the importance of mirror resonance removal, small spin tune spread, and proper spin flipper driving tune sweep speed. Detailed spin tracking simulations, based on a Lorentz force and Thomas-BMT differential equation numerical solver code for accuracy, have been carried out to understand the experimental results. Agreement within measurement accuracy is obtained at injection energy, 23.8 GeV. It is not as tight at 255 GeV, reasons for that are exposed. These measurements and numerical studies allow to determine the sensitivity of spin-flip efficiency to the dispersion slopes at the two Siberian snakes and to the ac dipole frequency sweep speed. They also provide guidance for future developments at BNL’s electron-ion collider. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Bringing Trimmed Serendipity Methods to Computational Practice in Firedrake

We present an implementation of the trimmed serendipity finite element family, using the open-source finite element package Firedrake. The new elements can be used seamlessly within the software suite for problems requiring H 1 , H (curl), or H (div)-conforming elements on meshes of squares or cubes. To test how well trimmed serendipity elements perform in comparison to traditional tensor product elements, we perform a sequence of numerical experiments including the primal Poisson, mixed Poisson, and Maxwell cavity eigenvalue problems. Overall, we find that the trimmed serendipity elements converge, as expected, at the same rate as the respective tensor product elements, while being able to offer significant savings in the time or memory required to solve certain problems.

97 MATHEMATICS AND COMPUTING↗

DRACO: An Overview [Slides]

DRACO (Diffusion ReACtiOn) is a diffusion and chemistry code designed to: 1) Operate on 3D with an unstructured grid defining an arbitrary geometry of interacting parts. 2) Generate its own meshes and use meshes created by other software. 3)Model the transport of any number of diffusing quantities: Concentrations, pressures, temperature, etc. 4) Allow diffusion coefficients to depend in an arbitrary way on concentration, temperature, position, time, etc. 5) Model general chemistry between concentrations with arbitrary reaction rates. 6) Allow arbitrary initial conditions, boundary conditions, and sources/sinks. 7) Allow all of the above to be specified by the user.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards a Verifiable Domain-Specific Language for Hardware-Accelerated Stencils

Defining a domain-specific language (DSL) that supports vector-calculus abstractions eases the porting of partial differential equation (PDE) solvers to specialized architectures. Sufficiently high-level abstractions empower users to express universal laws with sufficient generality that the laws must always hold true within their domain of validity. A broad class of PDE solvers employs stencil-based algorithms, the target domain of Berkeley Lab's stencil accelerator chip co-design project. First released as open-source in January 2026, the Formal software framework lays a foundation for defining an embedded DSL based on composable operators that implement mimetic numerical methods -- stencil algorithms that guarantee satisfaction of discrete versions of important vector calculus theorems. The Formal DSL will be the frontend to a new class of stencil-PDE accelerators developed jointly by LBNL, UHCL, and UC Berkeley through the DOE Competitive Portfolios for Computer Science Project. This offers the potential of an order of magnitude acceleration for this important category of computational methods to serve the DOE mission. Future work on the Formal DSL will facilitate software verification via type-safe templates that enable problem-specific correctness proofs relying upon generic function theory and carefully crafted unit tests.

Rouson, Damian↗

A numerical procedure for analysis of finite rate reacting flows

Combustion processes in rocket propulsion systems are characterized by the existence of multiple, vastly differing time and length scales, as well as flow-speeds at wide variation of Mach numbers. The chemical kinetics processes in the highly active reaction zone are characterized by much smaller scales compared to fluid convective and diffusive time scales. An operator splitting procedure for transient finite rate chemistry problems has been developed using a pressure based method, which can be applied to all speed flows without difficulties. The splitting of chemical kinetics terms formed the fluid-mechanical terms of the species equation ameliorated the difficulties associated with the disparate time scales and stiffness in the set of equations which describes highly exothermic combustion. A combined efficient ordinary differential equations (ODE) solver was used to integrate the effective chemical source terms over the residence time at each grid cell. One and two dimensional reacting flow situations were carried out to demonstrate and verify the current procedure. Different chemical kinetics with different degrees of nonlinearity have also been incorporated to test the robustness and generality of the proposed method.

Shang, H. M.↗

Developing CORBA-Based Distributed Scientific Applications from Legacy Fortran Programs

Recent progress in distributed object technology has enabled software applications to be developed and deployed easily such that objects or components can work together across the boundaries of the network, different operating systems, and different languages. A distributed object is not necessarily a complete application but rather a reusable, self-contained piece of software that co-operates with other objects in a plug-and-play fashion via a well-defined interface. The Common Object Request Broker Architecture (CORBA), a middleware standard defined by the Object Management Group (OMG), uses the Interface Definition Language (IDL) to specify such an interface for transparent communication between distributed objects. Since IDL can be mapped to any programming language, such as C++, Java, Smalltalk, etc., existing applications can be integrated into a new application and hence the tasks of code re-writing and software maintenance can be reduced. Many scientific applications in aerodynamics and solid mechanics are written in Fortran. Refitting these legacy Fortran codes with CORBA objects can increase the codes reusability. For example, scientists could link their scientific applications to vintage Fortran programs such as Partial Differential Equation(PDE) solvers in a plug-and-play fashion. Unfortunately, CORBA IDL to Fortran mapping has not been proposed and there seems to be no direct method of generating CORBA objects from Fortran without having to resort to manually writing C/C++ wrappers. In this paper, we present an efficient methodology to integrate Fortran legacy programs into a distributed object framework. Issues and strategies regarding the conversion and decomposition of Fortran codes into CORBA objects are discussed. The following diagram shows the conversion and decomposition mechanism we proposed. Our goal is to keep the Fortran codes unmodified. The conversion- aided tool takes the Fortran application program as input and helps programmers generate C/C++ header file and IDL file for wrapping the Fortran code. Programmers need to determine by themselves how to decompose the legacy application into several reusable components based on the cohesion and coupling factors among the functions and subroutines. However, programming effort still can be greatly reduced because function headings and types have been converted to C++ and IDL styles. Most Fortran applications use the COMMON block to facilitate the transfer of large amount of variables among several functions. The COMMON block plays the similar role of global variables used in C. In the CORBA-compliant programming environment, global variables can not be used to pass values between objects. One approach to dealing with this problem is to put the COMMON variables into the parameter list. We do not adopt this approach because it requires modification of the Fortran source code which violates our design consideration. Our approach is to extract the COMMON blocks and convert them into a structure-typed attribute in C++. Through attributes, each component can initialize the variables and return the computation result back to the client. We have tested successfully the proposed conversion methodology based on the f2c converter. Since f2c only translates Fortran to C, we still needed to edit the converted code to meet the C++ and IDL syntax. For example, C++/IDL requires a tag in the structure type, while C does not. In this paper, we identify the necessary changes to the f2c converter in order to directly generate the C++ header and the IDL file. Our future work is to add GUI interface to ease the decomposition task by simply dragging and dropping icons.

Sang, Janche↗

Towards an Enhanced Droplet Activation Scheme for Multi-Moment Bulk Microphysics Schemes

Initial droplet spectra produced upon activation impact the ensuing chain of microphysical processes andtherefore play a crucial role in cloud evolution. This work re-examines dependencies of newly formed clouddroplet size distribution (CDSD) characteristics on environmental and aerosol properties via parcel model simulationsthat serve as the basis for a multi-moment bulk microphysics droplet activation scheme suitable for acloud-resolving model (CRM). It is found that applying a fixed size threshold to define activated droplets versusemploying physical considerations can lead to erroneous activation and overly broad CDSDs for high aerosolconcentration and weak updraft conditions. Aerosol distributions characterized by larger median sizes and/orincreased solubility can result in greater activated droplet numbers, whereas impacts of these parameters onCDSD spectral width depend on both aerosol number concentration and updraft velocity. An expansion of theactivation scheme to include CDSD spectral width is proposed to aid efforts to extend high-order momentprediction to cloud droplet categories in CRMs as well as better represent variability in the activation process onthe cloud scale.simulations to investigate the regime dependence of the relative dispersion(d)1 of newly activated CDSDs, where d is the ratio of dropletradius standard deviation (σ) to the mean radius (r ). C16 demonstratedthat increasing Na resulted in increasing (decreasing) d values via reducedcondensational narrowing (spectral broadening) rates within theAL (UL) regime, with d values peaking in the TR regime. Their findingssuggest a similar regime dependence for d as R09 noted for Nc and helpexplain reportedly conflicting relationships between Na and CDSDspectral characteristics (cf. Hudson and Noble, 2014; Liu et al., 2014),although the applicability of these results within bulk microphysicalschemes was not addressed.Simulating aerosol-cloud interactions with CRMs employing bulkmicrophysics requires that the scheme minimally predict two CDSDparameters, namely mass and number concentrations, and represent thedroplet activation process. Various activation schemes aim to determineNc from aerosol and environmental properties and include analyticalexpressions (e.g., Abdul-Razzak et al., 1998; Morrison et al., 2005) aswell as lookup tables (LUTs) based on detailed parcel model calculations(e.g., Saleeby and Cotton, 2004, hereafter SC04; Segal and Khain,2006; Thompson and Eidhammer, 2014). Expressions to diagnose CDSDspectral width from Nc (Grabowski, 1998; Liu et al., 2006; Morrison andGrabowski, 2007) or cloud water content (Geoffroy et al., 2010) havealso been developed, although more robust methods to obtain CDSDspectral width upon activation are presently lacking. This latter point isrelevant for triple-moment (3 M) bulk microphysics that aim to predictdistribution spectral width alongside number and mass concentrations(e.g., Loftus et al., 2014; Milbrandt and Yau, 2005).The current work extends the findings of C16 to the current LUTbasedaerosol activation scheme used in the Regional AtmosphericModeling System (RAMS) (Cotton et al., 2003; SC04; Saleeby and vanden Heever, 2013, hereafter SvdH13) and additionally examinesaerosol size and solubility impacts on newly activated CDSD properties.Because early cloud development processes such as condensationalgrowth, evaporation, and droplet self-collection depend on and impactCDSD spectral width (Hudson and Yum, 1997; Seifert and Beheng 2001;Lu and Seinfeld, 2006; Igel and van den Heever, 2017), an expansion ofthe activation LUTs to include CDSD spectral width is proposed as apreliminary step for extending 3M prediction to CDSDs in CRMs forimproved simulations of aerosol-cloud interactions.2. MethodologyThe current RAMS two-moment microphysics module determinesthe fractional number of aerosol particles that activate to cloud dropletsfrom five-dimensional LUTs based on model predicted air temperature(T), w, Na, and the geometric median radius (rg) and soluble fraction (ε)of the aerosol size distribution (SvdH13). These LUTs are created offlineusing a one-dimensional Lagrangian adiabatic parcel model (Feingoldand Heymsfield, 1992; Heymsfield and Sabin, 1989; SC04) to simulateexplicit droplet activation and initial CDSD growth for a range of ambientatmospheric conditions [T, w] and binned lognormal aerosol sizedistributions given by= ⎡⎣ ⎢− ⎤⎦ ⎥N r Nr π σr rσ( )2 lnexp[ln( / )]2(ln )aggg22 (1)where r is the dry aerosol particle bin radius and σg is the geometricstandard deviation of the distribution. As the parcel model simulationsfocus on the activation process, other processes such as coalescence,sedimentation, and mixing are not considered. Details of the parcelmodel can be found in SC04 and SvdH13, and only a brief description isprovided here. At the onset of parcel model calculations, the initiallydry aerosol particles in all bins first deliquesce and reach theirequilibrium diameters in a sub-saturated environment based on theKöhler equation for solution droplets. The parcel is then lifted at a fixedupward velocity w, and particle growth by vapor diffusion, along withconcurrent changes in the ambient environment, are iteratively computedusing the Variable-coefficient Ordinary Differential Equation(VODE) solver (Brown et al., 1989). The time resolution of these calculationsis determined within the VODE solver, and the frequency atwhich the solver is called is controlled by a longer model time stepbased on fixed upward parcel displacement increments (Δz) at thespecified w (Δt=Δz/w). Model calculations proceed until the parcelreaches a height 50m beyond the level of maximum saturation ratio(Smax) or total parcel displacement exceeds 2 km. Upon model termination,Smax and the fractional number of aerosols (factv) resulting innewly formed cloud droplets, defined as particles having diameters of atleast 2 μm, are cataloged in the LUTs according to the specified T, w, Na,rg, and ε parameter values.A critical point regarding the creation of these LUTs is the use of afixed minimum diameter (Dmin) to define cloud droplets in the parcelmodel, which can produce erroneous CDSD characteristics, particularlywithin the UL regime. For aerosol distributions with large rg valuesunder low SS conditions, for example, deliquesced aerosols within thelarge tail of the distribution can exceed 2 μm in diameter yet remainunactivated as ‘haze’ particles (Levin and Cotton, 2009; McFigganset al., 2006). For this study, aerosol particles activate to cloud dropletsbased on the critical diameter Dcrit as a function of parcel supersaturationratio (Sr) as in R09:D = σ MS RTρ83 ln( ) critsol wr w (2)where σsol is the surface tension of a solution droplet, Mw and ρw are themolar mass and density of liquid water, respectively, and R is theuniversal gas constant. Additionally, at relatively large w values withinthe AL regime, Nc stabilizes shortly after reaching supersaturation.However, parcel ascent and condensational growth continue beyondthe level of Smax, potentially causing additional narrowing of the CDSD.In the current work, model calculations terminate upon reaching Smaxas changes in Nc are negligible with continued ascent (Peng et al., 2007;R09).Parcel model simulations are performed to examine the sensitivitiesof CDSD characteristics to w, Na, rg, and ε, with the ranges for theseparameters listed in Table 1. Aerosols are assumed to be a mix of solubleand insoluble material of equal density, specified by ε, where fullysoluble aerosols correspond to ammonium sulfate with hygroscopicityparameter κ=0.61 (Petters and Kreidenweis, 2007). FollowingSvdH13, aerosol geometric standard deviation is fixed at σg=1.8, andaerosol distributions (Eq. 1) are partitioned into 100 logarithmicallyspacedbins spanning a size range specific to each rg value. For all simulations,Δz=1 m, and initial values of relative humidity, air temperatureand pressure are set to RH=0.99, T=10 °C and p=900 hPa,respectively.

Loftus, Adrian M.↗

CHEMNODE: CHEMICAL KINETICS SOLVER APPROACH BASED ON NEURAL ORDINARY DIFFERENTIAL EQUATIONS

This software contains an algorithm to model and predict the time evolution of chemical kinetics in reacting flow simulations using neural ordinary differential equations (NODEs). The approach works by using artificial neural networks to predict the chemical source terms. It achieves this by using forward-mode automatic differentiation and the Levenberg-Marquardt algorithm to adjust the neural network parameters, such that the discrepancies between the actual and predicted species profiles are minimized.

OWOYELE, OPEOLUWA↗

RE-INTEGRATE EMT Simulation Software: DAE Solvers and Automation

Existing electromagnetic transient (EMT) simulation tools face challenges in accelerating EMT simulations, especially for very large-scale power networks. To tackle this issue, next generation EMT simulation tools such as RE-INTEGRATE EMT are being researched upon. Such tools should be equipped with automation capabilities and advanced numerical differential-algebraic equation (DAE) solvers. In this paper, the DAE solvers incorporated within the RE-INTEGRATE EMT simulation tool are discussed. In particular, a modified ODEINT-based DAE solver and the ARKODE solver from SUN-DIALS are leveraged within RE-INTEGRATE EMT. In addition, the automation implemented within RE-INTEGRATE EMT to automate the DAE generation (replacing the need of manual discretization and assembling DAEs) is discussed. Different use cases were implemented using the RE-INTEGRATE EMT tool and were validated with respect to baseline simulations.

Marthi, Phani Ratna Vanamali [ORNL] (ORCID:0000000↗

An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

Lemke, Max↗

Reliable extrapolation of deep neural operators informed by physics or sparse observations

Deep neural operators can learn nonlinear mappings between infinite-dimensional function spaces via deep neural networks. As promising surrogate solvers of partial differential equations (PDEs) for real-time prediction, deep neural operators such as deep operator networks (DeepONets) provide a new simulation paradigm in science and engineering. Pure data-driven neural operators and deep learning models, in general, are usually limited to interpolation scenarios, where new predictions utilize inputs within the support of the training set. However, in the inference stage of real-world applications, the input may lie outside the support, i.e., extrapolation is required, which may result to large errors and unavoidable failure of deep learning models. Here, we address this challenge of extrapolation for deep neural operators. First, we systematically investigate the extrapolation behavior of DeepONets by quantifying the extrapolation complexity, via the 2-Wasserstein distance between two function spaces and propose a new strategy of bias–variance trade-off for extrapolation with respect to model capacity. Subsequently, we develop a complete workflow, including extrapolation determination, and we propose five reliable learning methods that guarantee a safe prediction under extrapolation by requiring additional information—the governing PDEs of the system or sparse new observations. The proposed methods are based on either fine-tuning a pre-trained DeepONet or multifidelity learning. We demonstrate the effectiveness of the proposed framework for various types of parametric PDEs. Furthermore, our systematic comparisons provide practical guidelines for selecting a proper extrapolation method depending on the available information, desired accuracy, and required inference speed.

42 ENGINEERING↗

A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling

Numerical solvers of partial differential equations (PDEs) have been widely employed for simulating physical systems. However, the computational cost remains a major bottleneck in various scientific and engineering applications, which has motivated the development of reduced-order models (ROMs). Recently, machine-learning-based ROMs have gained significant popularity and are promising for addressing some limitations of traditional ROM methods, especially for advection dominated systems. In this chapter, we focus on a particular framework known as Latent Space Dynamics Identification (LaSDI), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional latent-space data, governed by ordinary differential equations (ODEs). These ODEs can be learned and subsequently interpolated to make ROM predictions. Each building block of LaSDI can be easily modulated depending on the application, which makes the LaSDI framework highly flexible. In particular, we present strategies to enforce the laws of thermodynamics into LaSDI models (tLaSDI), enhance robustness in the presence of noise through the weak form (WLaSDI), select high-fidelity training data efficiently through active learning (gLaSDI, GPLaSDI), and quantify the ROM prediction uncertainty through Gaussian processes (GPLaSDI). We demonstrate the performance of different LaSDI approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that LaSDI algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.

Computational Engineering, Finance, and Science (c↗