Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical differentiation”

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 667 records · Page 37

Exact enforcement of temporal continuity in sequential physics-informed neural networks

The use of deep learning methods in scientific computing represents a potential paradigm shift in engineering problem solving. One of the most prominent developments is Physics-Informed Neural Networks (PINNs), in which neural networks are trained to satisfy partial differential equations (PDEs). While this method shows promise, the standard version has been shown to struggle in accurately predicting the dynamic behavior of time-dependent problems. To address this challenge, methods have been proposed that decompose the time domain into multiple segments, employing a distinct neural network in each segment and directly incorporating continuity between them in the loss function of the minimization problem. In this work we introduce a method to exactly enforce continuity between successive time segments via a solution ansatz. This hard constrained sequential PINN (HCS-PINN) method is simple to implement and eliminates the need for any loss terms associated with temporal continuity. The method is tested for a number of benchmark problems involving both linear and non-linear PDEs. Examples include various first order time dependent problems in which traditional PINNs struggle, namely advection, Allen–Cahn, and Korteweg–de Vries equations. Furthermore, second and third order time-dependent problems are demonstrated via wave and Jerky dynamics examples, respectively. Notably, the Jerky dynamics problem is chaotic, making the problem especially sensitive to temporal accuracy. Finally, the numerical experiments conducted with the proposed method demonstrated superior convergence and accuracy over both traditional PINNs and the soft-constrained counterparts.

42 ENGINEERING↗

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Preferential adsorption of noble gases in zeolitic tuff with variable saturation: A modeling study of counter-intuitive diffusive-adsorptive behavior

Noble gas transport through geologic media has important applications in the prediction and characterization of measured gas signatures related to underground nuclear explosions (UNEs). Retarding processes such as adsorption can cause significant species fractionation of radionuclide gases, which has implications for measured and predicted signatures used to distinguish radioxenon originating from civilian nuclear facilities or from UNEs. Accounting for the effects of variable water saturation in geologic media on tracer transport is one of the most challenging aspects of modeling gas transport because there is no unifying relationship for the associated tortuosity changes between different rock types, and reactive transport processes such as adsorption that are affected by the presence of water likewise behave differently between gas species. In this study, we perform numerical diffusive-adsorptive transport simulations to estimate gas transport parameters associated with bench-scale laboratory diffusion cell experiments measuring breakthrough in zeolitic and non-zeolitic rocks for a gaseous mixture of xenon, krypton, and SF 6 at varying degrees of water saturation (S w ). Counter-intuitive transport behavior was observed in the zeolitic rock experiments whereby breakthrough concentrations were significantly higher when the core was partially saturated (S w = 17 %) than under dry (S w = 0 %) conditions. Breakthrough of xenon was especially retarded in the dry core – likely due to comparatively high affinity of xenon for zeolitic adsorption sites – and estimated effective diffusion coefficients for all gases were approximately an order of magnitude lower than what is predicted by porosity-tortuosity models. We propose the counter-intuitive behavior observed is because water infiltration of zeolite nanopores reduces both the adsorptive capacity of the rock and the tortuosity of connected flow paths. We developed a two-site competitive kinetic Langmuir adsorption reaction for the porous media transport simulator in order to constrain transport parameters within zeolitic tuff, where differential adsorption to zeolite and non-zeolite pores was observed. We determined that liquid saturation-dependent diffusive-adsorptive transport is affected by subtle and at times competing processes that are specific to different gases, which have a significant overall influence on effective transport parameters.

58 GEOSCIENCES↗

Partitioned exponential methods for coupled multiphysics systems

Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes. The partitioned-exponential methods proposed herein evolve each component of the system via an exponential integrator, and information between partitions is exchanged via coupling terms. Here, the traditional approach to constructing exponential methods, based on the variation-of-constants formula, is not directly applicable to partitioned systems. Rather, our approach to developing new partitioned-exponential families is based on a general-structure additive formulation of the schemes. Two method formulations are considered, one based on a linear-nonlinear splitting of the right hand component functions, and another based on approximate Jacobians. The paper develops classical (non-stiff) order conditions theory for partitioned exponential schemes based on particular families of T-trees and B-series theory. Several practical methods of third order are constructed that extend the Rosenbrock-type and EPIRK families of exponential integrators. Several implementation optimizations specific to the application of these methods to reaction-diffusion systems are also discussed. Numerical experiments reveal that the new partitioned-exponential methods can perform better than traditional unpartitioned exponential methods on some problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗

Poisson_CCD: A dedicated simulator for modeling CCDs

A dedicated simulator, Poisson_CCD, has been constructed which models astronomical CCDs by solving Poisson’s equation numerically and simulating charge transport within the CCD. The potentials and free carrier densities within the CCD are self-consistently solved for, giving realistic results for the charge distribution within the CCD storage wells. The simulator has been used to model the CCDs that are being used to construct the LSST digital camera. The simulator output has been validated by comparing its predictions with several different types of CCD measurements, including astrometric shifts, brighter-fatter induced pixel–pixel covariances, saturation effects, and diffusion spreading. The code is open source and freely available.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A 1D–0D–3D coupled model for simulating blood flow and transport processes in breast tissue

In this work, we present mixed dimensional models for simulating blood flow and transport processes in breast tissue and the vascular tree supplying it. These processes are considered, to start from the aortic inlet to the capillaries and tissue of the breast. Large variations in biophysical properties and flow conditions exist in this system necessitating the use of different flow models for different geometries and flow regimes. In total, we consider four different model types. First, a system of 1D nonlinear hyperbolic partial differential equations (PDEs) is considered to simulate blood flow in larger arteries with highly elastic vessel walls. Second, we assign 1D linearized hyperbolic PDEs to model the smaller arteries with stiffer vessel walls. The third model type consists of ODE systems (0D models). It is used to model the arterioles and peripheral circulation. Finally, homogenized 3D porous media models are considered to simulate flow and transport in capillaries and tissue within the breast volume. Sink terms are used to account for the influence of the venous and lymphatic systems. Combining the four model types, we obtain two different 1D–0D–3D coupled models for simulating blood flow and transport processes: The first model results in a fully coupled 1D–0D–3D model covering the complete path from the aorta to the breast combining a generic arterial network with a patient specific breast network and geometry. The second model is a reduced one based on the separation of the generic and patient specific parts. The information from a calibrated fully coupled model is used as inflow condition for the patient specific sub-model allowing a significant computational cost reduction. Several numerical experiments are conducted to calibrate the generic model parameters and to demonstrate realistic flow simulations compared to existing data on blood flow in the human breast and vascular system. Moreover, we use two different breast vasculature and tissue data sets to illustrate the robustness of our reduced sub-model approach.

multiscale blood flow models↗

Bounding irrelevant operators in the 3d Gross-Neveu-Yukawa CFTs

We perform a numerical bootstrap study of scalar operators in the critical 3d Gross-Neveu-Yukawa models, a family of conformal field theories containing N Majorana fermions in the fundamental representation of an O(N) global symmetry. We compute rigorous bounds on the scaling dimensions of the next-to-lowest parity-even and parity-odd singlet scalars at N = 2, 4, and 8. All of these dimensions have lower bounds greater than 3, implying that there are only two relevant singlet scalars and placing constraints on the RG flow structure of these theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning and discovering multiple solutions using physics-informed neural networks with random initialization and deep ensemble

In this work we explore the capability of physics-informed neural networks (PINNs) to discover multiple solutions. Many real-world phenomena governed by nonlinear differential equations (DEs), such as fluid flow, exhibit multiple solutions under the same conditions, yet capturing this solution multiplicity remains a significant challenge. A key difficulty lies in providing appropriate initial conditions or guesses, as widely used time-marching schemes and Newton’s method are highly sensitive to these choices when solving complex computational problems. While machine learning models, particularly PINNs, have shown promise in solving DEs, their ability to capture multiple solutions remains underexplored. In this work, we propose a simple and practical approach using PINNs to learn and discover multiple solutions. We first demonstrate that PINNs, when combined with random initialization and deep ensemble method—originally developed for uncertainty quantification—can effectively uncover multiple solutions to nonlinear ordinary and partial DEs. Although training large ensembles of PINNs may appear computationally demanding, this can be done efficiently using vectorization techniques supported by modern deep learning frameworks, allowing many networks to be trained simultaneously. Our approach highlights the critical role of initialization in shaping solution diversity, addressing an often-overlooked aspect of machine learning for scientific computing. Furthermore, we propose utilizing PINN-generated solutions as initial conditions or initial guesses for conventional numerical solvers to enhance accuracy and efficiency in capturing multiple solutions. Extensive numerical experiments, including the Allen–Cahn equation and cavity flow, where our approach successfully identifies both stable and unstable solutions, validate the effectiveness of our method. These findings establish a general and efficient framework for addressing solution multiplicity in nonlinear DEs.

97 MATHEMATICS AND COMPUTING↗

Disentangling observable dependence in SCET I and SCET II anomalous dimensions: angularities at two loops

The resummation of radiative corrections to collider jet observables using soft collinear effective theory is encoded in differential renormalization group equations (RGEs), with anomalous dimensions depending on the observable under consideration. This observable dependence arises from the ultraviolet (UV) singular structure of real phase space integrals in the effective field theory. We show that the observable dependence of anomalous dimensions in SCET I problems can be disentangled by introducing a suitable UV regulator in real radiation integrals. Resummation in the presence of the new regulator can be performed by solving a two-dimensional system of RGEs in the collinear and soft sectors, and resembles many features of resummation in SCET II theories by means of the rapidity renormalization group. We study the properties of SCET I with the additional regulator and explore the connection with the system of RGEs in SCET II theories, highlighting some universal patterns that can be exploited in perturbative calculations. As an application, we compute the two-loop soft and jet anomalous dimensions for a family of recoil-free angularities and give new analytic results. This allows us to study the relations between the SCET I and SCET II limits for these observables. We also discuss how the extra UV regulator can be exploited to calculate anomalous dimensions numerically, and the prospects for numerical resummation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Voltage Restoration in Microgrids using Temporal Logic Specifications

This paper proposes an energy storage controller synthesis method for voltage restoration in microgrids with respect to temporal logic specifications (TLSs). TLSs is introduced in this paper as a formalism to control the voltage variation of a critical bus against an operational bounds over time. The power system with synchronous generator (SG) connected to a critical load bus is modeled as a set of differential-algebraic equations and a simplified analytical model is derived to describe the voltage variation of this critical bus. The control objective is to schedule an optimal control input signal from a supportive energy storage system (ESS) connected to the critical bus, such that the voltage variation of the latter satisfies the TLSs, such as a finite-time restoration. The proposed control is verified on a lumped distribution system model. With this control diagram, supportive controllers can be designed to make voltage behaviors comply with grid codes and avoid unnecessary relay actions.

Taousser, Fatima Zohra↗

Optimal band selection for target detection with a LWIR multispectral imager

Multispectral imaging can offer many benefits in cost, complexity, resolution, size, weight, and power, relative to hyperspectral imaging. When designing a multispectral system, spectral bandpasses can be selected using optimization algorithms configured to maximally separate target detection scores between target and background regions. A hyperspectral image (HSI) can serve as the source of data from which band groupings can be tested for optimality. The output of an adaptive cosine estimator target detection algorithm is used in an objective function. Three optimization algorithms are compared: particle swarm, dual annealing, and differential evolution. A global optimum is also found using a brute force approach on the Livermore Computing Syrah supercomputer. Three materials are investigated: calcite, gypsum, and limestone. This is done for 3-, 4-, and 5-band systems. The data originate from a longwave infrared HSI of a material display board. The optimization algorithms were run 30 times for every scenario. Performance statistics (maximum, minimum, mean, standard deviation, and median) based on the separation values are given. Additional characterization was performed using receiver operator characteristic (ROC) curves and the area under the ROC curve. While good performance was obtained for the three optimization algorithms, the dual annealing algorithm produced the highest and most consistent detection separation scores on average.

47 OTHER INSTRUMENTATION↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗

Potential Vorticity Mixing in a Tangled Magnetic Field

A theory of potential vorticity (PV) mixing in a disordered (tangled) magnetic field is introduced. The analysis is in the context of β -plane MHD, with a special focus on the physics of momentum transport in the stably stratified, quasi-2D solar tachocline. A physical picture of mean PV evolution by vorticity advection and tilting of magnetic fields is proposed. In the case of weak field perturbations, quasi-linear theory predicts that the Reynolds and magnetic stresses balance as turbulence Alfvénizes for a larger mean magnetic field. Jet formation is explored quantitatively in the mean field–resistivity parameter space. However, since even a modest mean magnetic field leads to large magnetic perturbations for large magnetic Reynolds number, the physically relevant case is that of a strong but disordered field. We show that numerical calculations indicate that the Reynolds stress is modified well before Alfvénization—i.e., before fluid and magnetic energies balance. To understand these trends, a double-average model of PV mixing in a stochastic magnetic field is developed. Calculations indicate that mean-square fields strongly modify Reynolds stress phase coherence and also induce a magnetic drag on zonal flows. The physics of transport reduction by tangled fields is elucidated and linked to the related quench of turbulent resistivity. We propose here a physical picture of the system as a resisto-elastic medium threaded by a tangled magnetic network. Applications of the theory to momentum transport in the tachocline and other systems are discussed in detail.

79 ASTRONOMY AND ASTROPHYSICS↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Unraveling the mechanism of recognition of the 3’ splice site of the adenovirus major late promoter intron by the alternative splicing factor PUF60

Pre-mRNA splicing is critical for achieving required amounts of a transcript at a given time and for regulating production of encoded protein. A given pre-mRNA may be spliced in many ways, or not at all, giving rise to multiple gene products. Numerous splicing factors are recruited to pre-mRNA splice sites to ensure proper splicing. One such factor, the 60 kDa poly(U)-binding splicing factor (PUF60), is recruited to sites that are not always spliced, but rather function as alternative splice sites. In this study, we characterized the interaction of PUF60 with a splice site from the adenovirus major late promoter (the AdML 3' splice site, AdML3’). We found that the PUF60–AdML3’ dissociation constants are in the micromolar range, with the binding affinity predominantly provided by PUF60’s two central RNA recognition motifs (RRMs). A 1.95 Å crystal structure of the two PUF60 RRMs in complex with AdML3’ revealed a dimeric organization placing two stretches of nucleic acid tracts in opposing directionalities, which can cause looping of nucleic acid and explain how PUF60 affects pre-mRNA geometry to effect splicing. Solution characterization of this complex by light-scattering and UV/Vis spectroscopy suggested a potential 2:1 (PUF60 2 :AdML3’) stoichiometry, consistent with the crystal structure. This work defines the sequence specificity of the alternative splicing factor PUF60 at the pre-mRNA 3’ splice site. Our observations suggest that control of pre-mRNA directionality is important in the early stage of spliceosome assembly, and advance our understanding of the molecular mechanism by which alternative and constitutive splicing factors differentiate among 3’ splice sites.

59 BASIC BIOLOGICAL SCIENCES↗