Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear equations”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

MAPPRAISER: A massively parallel map-making framework for multi-kilo pixel CMB experiments

Forthcoming cosmic microwave background (CMB) polarized anisotropy experiments have the potential to revolutionize our understanding of the Universe and fundamental physics. The sought-after, tale-telling signatures will be however distributed over voluminous data sets which these experiments will collect. These data sets will need to be efficiently processed and unwanted contributions due to astrophysical, environmental, and instrumental effects characterized and efficiently mitigated in order to uncover the signatures. This poses a significant challenge to data analysis methods, techniques, and software tools which will not only have to be able to cope with huge volumes of data but to do so with unprecedented precision driven by the demanding science goals posed for the new experiments. A keystone of efficient CMB data analysis is solvers of very large linear systems of equations. Such systems appear in very diverse contexts throughout CMB data analysis pipelines, however they typically display similar algebraic structures and can therefore be solved using similar numerical techniques. Linear systems arising in the so-called map-making problem are one of the most prominent and common ones. In this work we present a massively parallel, flexible and extensible framework, comprised of a numerical library, MIDAPACK, and a high level code, MAPPRAISER, which provide tools for solving efficiently such systems. Here, the framework implements iterative solvers based on conjugate gradient techniques: enlarged and preconditioned using different preconditioners. We demonstrate the framework on simulated examples reflecting basic characteristics of the forthcoming data sets issued by ground-based and satellite-borne instruments, executing it on as many as 16,384 compute cores. The software is developed as an open source project freely available to the community at: https://github.com/B3Dcmb/midapack.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Eigenmode analysis of the sheared-flow Z-pinch

Experiments have demonstrated that a Z-pinch can persist for thousands of times longer than the growth time of global magnetohydrodynamic (MHD) instabilities such as the m=0 sausage and m=1 kink modes. These modes have growth times on the order of ta=a/vi, where vi is the ion thermal speed and a is the pinch radius. Axial flows with duz/dr ≲ vi/a have been measured during the stable period, and the commonly accepted theory is that this amount of shear is sufficient to stabilize these modes as predicted by numerical studies using the ideal MHD equations. However, these studies only consider specific equilibrium profiles that typically have a modest magnitude for the logarithmic pressure gradient, qP≡d ln P/d ln r, and may not represent experimental conditions. Linear stability of the sheared-flow Z-pinch is studied here via a direct eigen-decomposition of the matrix operator obtained from the linear ideal MHD equations. Several equilibrium profiles with a large variation of qP are examined. Considering a practical range of k, 1/3 ≲ ka ≲ 10, it is shown that the shear required to stabilize m=0 modes can be expressed as duz/dr≥Cγ0/(ka)α. Here, γ0=γ0(ka) is the profile-specific growth rate in the absence of shear, which scales approximately with |qP|. Both C and α are profile-specific constants, but C is order unity and α≈1. It is further demonstrated that even a large value of shear, duz/dr=3vi/a, is not sufficient to provide linear stabilization of the m=1 kink mode for all profiles considered. This result is in contrast to the currently accepted theory predicting stabilization at much lower shear, duz/dr=0.1vi/a, and suggests that the experimentally observed stability cannot be explained within the linear ideal-MHD model.

Angus, J. R. (ORCID:0000000314740002)↗
DOE OSTI2021

Alluvial fan morphology: A self-similar free boundary problem description

In this work, we examine approximate geometrically self-similar solutions to a parabolic free boundary value problem applied to alluvial fan surface morphology and growth. Alluvial fans are fan- or cone-shaped sedimentary deposits caused by the rapid deposition of sediment from a canyon discharging onto a flatter plain. Longitudinal, topographic profiles of fans can be readily described by a seemingly time independent dimensionless profile (DeChant et al., 1999). However, because an alluvial fan can be expected to grow over time, it is clear that this “steady” profile is certainly time dependent and can be described using a space-time self-similar solution. In an experimental and theory-based study, Guerit et al. (2014) developed a self-similar (or as they describe it a self-affine) linear solution based upon an approximate first order small parameter expansion solution for a 1-d homogeneous nonlinear diffusion equation. Direct substitution of this result into a linear diffusion equation suggests that this first order expression may not fully satisfy the associated governing equation. In contrast, we develop a more complete solution based upon a modeled approximation for the axi-symmetric formulation such that the associated temporal behavior is consistent with a 1/3 time power-law as described by Reitz and Jerolmack (2014). The resulting expression is an exact solution to a linear heat equation. Furthermore, we emphasize that a small parameter is not inherent to the resulting profile result and is not included in our model development. Though developed using rather different approaches, the formal solution developed here is in good agreement with the simple polynomial described by DeChant et al. (1999) suggesting that this self-similar solution is a suitable time dependent representation of alluvial fan longitudinal profile form and improves on earlier work.

58 GEOSCIENCES↗
DOE OSTI2023

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

CP decomposition for tensors via alternating least squares with QR decomposition

The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Revisiting the gluon density from the Balitsky-Kovchegov equation with kinematical constraints and large 𝑥 terms

We perform analysis of the small 𝑥 nonlinear evolution equation formulated in momentum space supplemented by higher order terms. The equation is defined in the wide range of transverse momentum and longitudinal momentum fractions extending previous studies performed in Kutak and Kwiecinski [Screening effects in the ultrahigh-energy neutrino interactions, Eur. Phys. J. C 29, 521 (2003).] and in Kutak and Stasto [Unintegrated gluon distribution from modified BK equation, Eur. Phys. J. C 41, 343 (2005).]. The linear part of the equation is motivated by the renormalization group improved small 𝑥 approach, which accounts for resummation of higher orders, and includes collinear splitting functions and kinematical constraints. The solution to the equation is then used to perform the fit to deep inelastic scattering reduced cross section data.

Perturbative QCD↗
DOE OSTI2022

Numerical fluid dynamics for FRG flow equations: Zero-dimensional QFTs as numerical test cases. II. Entropy production and irreversibility of RG flows

Herein we demonstrate that the reformulation of renormalization group (RG) flow equations as nonlinear heat equations has severe implications on the understanding of RG flows in general. We demonstrate by explicitly constructing an entropy function for a zero-dimensional Z 2 -symmetric model that the dissipative character of generic nonlinear diffusion equations is also hard-coded in the functional RG equation. This renders RG flows manifestly irreversible, revealing the semigroup property of RG transformations on the level of the flow equation itself. Additionally, we argue that the dissipative character of RG flows, its irreversibility and the entropy production during the RG flow may be linked to the existence of a so-called C– / A-function. In total, this introduces an asymmetry in the so-called RG time—in complete analogy to the thermodynamic arrow of time—and allows for an interpretation of infrared actions as equilibrium solutions of dissipative RG flows equations. The impossibility of resolving microphysics from macrophysics is evident in this framework. Furthermore, we directly link the irreversibility and the entropy production in RG flows to an explicit numerical entropy production, which is manifest in diffusive and non-linear partial differential equations (PDEs) and a standard mathematical tool for the analysis of PDEs. Using exactly solvable zero-dimensional Z 2 -symmetric models, we explicitly compute the (numerical) entropy production related to the total variation nonincreasing property of the PDE during RG flows toward the infrared limit. Finally, we discuss generalizations of our findings and relations to the C– / A-theorem as well as how our work may help to construct truncations of RG flow equations in the future, including numerically stable schemes for solving the corresponding PDEs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗
DOE OSTI2022

Comparison of exponential integrators and traditional time integration schemes for the shallow water equations

We report the time integration scheme is probably one of the most fundamental choices in the development of an ocean model. In this paper, we investigate several time integration schemes when applied to the shallow water equations. This set of equations is accurate enough for the modeling of a shallow ocean and is also relevant to study as it is the one solved for the barotropic (i.e. vertically averaged) component of a three dimensional ocean model. We analyze different time stepping algorithms for the linearized shallow water equations. High order explicit schemes are accurate but the time step is constrained by the Courant-Friedrichs-Lewy stability condition. Implicit schemes can be unconditionally stable but, in practice lack accuracy when used with large time steps. In this paper we propose a detailed comparison of such classical schemes with exponential integrators. The accuracy and the computational costs are analyzed in different configurations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Batched Sparse Linear Algebra (Final Report for Subcontract B648960)

This report finalizes design specifications for developing batched kernels for small tensor operations for unassembled matrix-free iterative solvers, batched solvers for partially assembled operators, and batched solvers with support for various sparse formats. The outcome of the project milestones is a set of interfaces to Batched Sparse LA solvers running on hardware accelerators for use in ECP Libraries and Applications. It is part of the development of sparse batched kernels, solvers/preconditioners as well as creating interoperability in xSDK libraries with sparse and dense batched functions to benefit ECP applications. The participants included representatives from ECP libraries (not limited to the xSDK project), applications, and vendors (AMD, Intel, and NVIDIA). Batched sparse linear algebra solvers form the new frontier for algorithmic development and performance engineering. Many applications (ECP and non-ECP alike) require simultaneous solutions of small linear systems of equations that are structurally sparse. To move towards high hardware utilization, it is important to provide these applications with appropriate interfaces to efficient batched sparse solvers running on modern hardware accelerators. We present interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the software portable between the major hardware accelerators from AMD, Intel, and NVIDIA. The presented interface specifications includes batched band, sparse iterative, and sparse direct solvers. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, SUNDIALS, and SuperLU_dist.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Sound propagation in realistic interactive 3D scenes with parameterized sources using deep neural operators

We address the challenge of acoustic simulations in three-dimensional (3D) virtual rooms with parametric source positions, which have applications in virtual/augmented reality, game audio, and spatial computing. The wave equation can fully describe wave phenomena such as diffraction and interference. However, conventional numerical discretization methods are computationally expensive when simulating hundreds of source and receiver positions, making simulations with parametric source positions impractical. To overcome this limitation, we propose using deep operator networks to approximate linear wave-equation operators. This enables the rapid prediction of sound propagation in realistic 3D acoustic scenes with parametric source positions, achieving millisecond-scale computations. By learning a compact surrogate model, we avoid the offline calculation and storage of impulse responses for all relevant source/listener pairs. Our experiments, including various complex scene geometries, show good agreement with reference solutions, with root mean squared errors ranging from 0.02 to 0.10 Pa. Notably, our method signifies a paradigm shift as—to our knowledge—no prior machine learning approach has achieved precise predictions of complete wave fields within realistic domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Coupling to rotational manifolds to improve gas-phase pump–probe spectroscopic models

The physical picture of gas-phase optical transitions is normally presented as an isolated two-level system balanced by upward and downward processes. Isolated models assume a phenomenological treatment of collisional dephasing but do not strictly account for collisional population exchange with the rotational baths. While this assumption is valid under low-intensity conditions, where excitation is rate-limiting, isolated models can deviate from Beer’s Law at sufficient pressures and monochromatic intensities when both collisional broadening and power broadening are comparable to (or greater than) lifetime broadening, which are not uncommon conditions for cavity enhanced spectroscopies in the mid-IR spectral range. Although this problem has been addressed by rate-equation models for linear absorption measurements, a general treatment for multi-level quantum mechanical models suitable for non-linear absorption measurements (two-photon/two-color/pump–probe) is lacking. Isolated models require physical parameter inputs that disagree with expected values by at least an order of magnitude. These non-physical models undermine the ability to predict non-linear signal strengths under untested conditions and thereby limit the potential to optimize the sensitivity of non-linear spectroscopies and to expand their analytical applications (e.g., new analytes and/or buffer gases, changes in cavity free-spectral-range, changes in intracavity powers or wavelengths, and accurate investigation of physical phenomena). In this study, we derive bath-coupled models for gaseous pump–probe spectroscopy by application of the quantum Lindblad equation and detailed balance. Bath-coupled models are shown to fit data consistently across variations in intensity and agree with all physically expected values.

Cavity ring-down spectroscopy↗
DOE OSTI2024

Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems

The rapid integration of renewable energy resources presents formidable challenges in managing power grids. While advanced computing and machine learning techniques offer some solutions for accelerating grid modeling and simulation, there remain complex problems that classical computers cannot effectively address. Quantum computing, a promising technology, has the potential to fundamentally transform how we manage power systems, especially in scenarios with a higher proportion of renewable energy sources. One critical aspect is solving linear systems of equations, crucial for power system applications like power flow analysis, for which the Harrow-Hassidim-Lloyd (HHL) algorithm is a well-known quantum solution. However, HHL quantum circuits often exhibit excessive depth, making them impractical for current Noisy-Intermediate-Scale-Quantum (NISQ) devices. In this paper, we introduce a versatile framework, powered by NWQSim, that bridges the gap between power system applications and quantum linear solvers available in Qiskit. This framework empowers researchers to efficiently explore power system applications using quantum linear solvers. Through innovative gate fusion strategies, reduced circuit depth, and GPU acceleration, our simulator significantly enhances resource efficiency. Power flow case studies have demonstrated up to a eight-fold speedup compared to Qiskit Aer, all while maintaining comparable levels of accuracy.

quantum computing, Harrow-Hassidim-Lloyd, high-per↗
DOE OSTI2021

Non-intrusive data-driven model reduction for differential–algebraic equations derived from lifting transformations

In this paper we present a non-intrusive data-driven approach for model reduction of nonlinear systems. The approach considers the particular case of nonlinear partial differential equations (PDEs) that form systems of partial differential–algebraic equations (PDAEs) when lifted to polynomial form. Such systems arise, for example, when the governing equations include Arrhenius reaction terms (e.g., in reacting flow models) and thermodynamic terms (e.g., the Helmholtz free energy terms in a phase-field solidification model). Using the known structured form of the lifted algebraic equations, the approach computes the reduced operators for the algebraic equations explicitly, using straightforward linear algebra operations on the basis matrices. The reduced operators for the differential equations are inferred from lifted snapshot data using operator inference, which solves a linear least squares regression problem. The approach is illustrated for the nonlinear model of solidification of a pure material. The lifting transformations reformulate the solidification PDEs as a system of PDAEs that have cubic structure. The operators of the lifted system for this solidification example have affine dependence on key process parameters, permitting us to learn a parametric reduced model with operator inference. Numerical experiments show the effectiveness of the resulting reduced models in capturing key aspects of the solidification dynamics.

42 ENGINEERING↗
DOE OSTI2022

Towards sharp error analysis of extended Lagrangian molecular dynamics

The extended Lagrangian molecular dynamics (XLMD) method provides a useful framework for reducing the computational cost of a class of molecular dynamics simulations with constrained latent variables. The XLMD method relaxes the constraints by introducing a fictitious mass ε for the latent variables and solving a set of singularly perturbed ordinary differential equations. While favorable numerical performance of XLMD has been demonstrated in several different contexts in the past decade, mathematical analysis of the method remains scarce. Here, we propose the first error analysis of the XLMD method in the context of a classical polarizable force field model. While the dynamics with respect to the atomic degrees of freedom are general and nonlinear, the key mathematical simplification of the polarizable force field model is that the constraints on the latent variables are given by a linear system of equations. We prove that when the initial value of the latent variables is compatible in a sense that we define, XLMD converges as the fictitious mass ε is made small with $\mathscr{O}$(ε) error for the atomic degrees of freedom and with $\mathscr{O}$($\sqrt{ε}$) error for the latent variables, when the dimension of the latent variable d' is 1. Furthermore, when the initial value of the latent variables is improved to be optimally compatible in a certain sense, we prove that the convergence rate can be improved to $\mathscr{O}$(ε) for the latent variables as well. Numerical results verify that both estimates are sharp not only for d'=1, but also for arbitrary d'. In the setting of general d', we do obtain convergence, but with the non-sharp rate of $\mathscr{O}$($\sqrt{ε}$) for both the atomic and latent variables.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Equations of Motion for the Vertical Rigid-Body Rotor: Linear and Nonlinear Cases

Centuries ago, the prolific mathematician Leonhard Euler (1707–1783) wrote down the equations of motion (EOM) for the heavy symmetrical top with one point fixed. The resulting set of equations turned out to be nonlinear and had a limited number of closed-form solutions.Today, tools such as transfer matrix and finite elements enable the calculation of the rotordynamic properties for rotor-bearing systems. Some of these tools rely on the “linearized” version of the EOM to calculate the eigenvalues, unbalance response, or transients in these systems.In fact, industry standards mandate that rotors be precisely balanced to have safe operational characteristics. However, in some cases, the nonlinear aspect of the EOM should be considered.The purpose of this chapter is to show examples of how the linear vs. nonlinear formulations differ. This chapter also shows how excessive unbalance is capable of dramatically altering the behavior of the system and can produce chaotic motions associated with the “jump” phenomenon.

Laos, Hector↗
DOE OSTI2021

Equations of Motion for the Vertical Rigid-Body Rotor: Linear and Nonlinear Cases

Centuries ago, the prolific mathematician Leonhard Euler (1707–1783) wrote down the equations of motion (EOM) for the heavy symmetrical top with one point fixed. The resulting set of equations turned out to be nonlinear and had a limited number of closed-form solutions. Today, tools such as transfer matrix and finite elements enable the calculation of the rotor dynamic properties for rotor-bearing systems. Some of these tools rely on the “linearized” version of the EOM to calculate the eigenvalues, unbalance response, or transients in these systems. In fact, industry standards mandate that rotors be precisely balanced to have safe operational characteristics. However, in some cases, the nonlinear aspect of the EOM should be considered. The purpose of this paper is to show examples of how the linear vs. nonlinear formulations differ. This paper will also show how excessive unbalance is capable of dramatically altering the behavior of the system and can produce chaotic motions associated with the “jump” phenomenon.

42 ENGINEERING↗