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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Global weak solutions for a nonlocal multispecies Fokker–Planck–Landau system

The global-in-time existence of weak solutions to a spatially homogeneous multispecies Fokker–Planck–Landau system for plasmas in the three-dimensional whole space is shown. The Fokker–Planck–Landau system is a simplification of the Landau equations assuming a linearized, velocity-independent, and isotropic kernel. The resulting equations depend nonlocally and nonlinearly on the moments of the distribution functions via the multispecies local Maxwellians. Furthermore, the existence proof is based on a three-level approximation scheme, energy and entropy estimates, as well as compactness results, and it holds for both soft and hard potentials.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗
DOE OSTI2023

Evaluation of dual-weighted residual and machine learning error estimation for projection-based reduced-order models of steady partial differential equations

Projection-based reduced-order models (pROMs) show great promise as a means to accelerate many-query applications such as forward error propagation, solving inverse problems, and design optimization. In order to deploy pROMs in the context of high-consequence decision making, accurate error estimates are required to determine the region(s) of applicability in the parameter space. The following paper considers the dual-weighted residual (DWR) error estimate for pROMs and compares it to another promising pROM error estimate, machine learned error models (MLEM). Here, we show how DWR can be applied to ROMs and then evaluate DWR on two partial differential equations (PDEs): a two-dimensional linear convection–reaction–diffusion equation, and a three-dimensional static hyper-elastic beam. It is shown that DWR is able to estimate errors for pROMs extrapolating outside of their training set while MLEM is best suited for pROMs used to interpolate within the pROM training set.

42 ENGINEERING↗
DOE OSTI2022

Reciprocal swimming at intermediate Reynolds number

In Stokes flow, Purcell's scallop theorem forbids objects with time-reversible (reciprocal) swimming strokes from moving. In the presence of inertia, this restriction is eased and reciprocally deforming bodies can swim. A number of recent works have investigated dimer models that swim reciprocally at intermediate Reynolds numbers Re≈1–1000. These show interesting results (e.g. switches of the swim direction as a function of inertia) but the results vary and seem to be case specific. Here, in this work, we introduce a general model and investigate the behaviour of an asymmetric spherical dimer of oscillating length for small-amplitude motion at intermediate Re. In our analysis we make the important distinction between particle and fluid inertia, both of which need to be considered separately. We asymptotically expand the Navier–Stokes equations in the small-amplitude limit to obtain a system of linear partial differential equations. Using a combination of numerical (finite element) and analytical (reciprocal theorem, method of reflections) methods we solve the system to obtain the dimer's swim speed and show that there are two mechanisms that give rise to motion: boundary conditions (an effective slip velocity) and Reynolds stresses. Each mechanism is driven by two classes of sphere–sphere interactions, between one sphere's motion and (1) the oscillating background flow induced by the other's motion, and (2) a geometric asymmetry induced by the other's presence. We can thus unify and explain behaviours observed in other works. Our results show how sensitive, counterintuitive and rich motility is in the parameter space of finite inertia of particles and fluid.

42 ENGINEERING↗
DOE OSTI2021

A most misunderstood conditionally-solvable quantum-mechanical model

Highlights: • The Schrödinger equation for some quantum-mechanical models is separable in cylindrical coordinates. • The radial equation exhibits harmonic, linear and Coulomb-like interactions. • The Frobenius method leads to three-term recurrence relations. • Some particular energies are obtained from truncation of the recurrence relation. • Many authors misunderstood these results. In this paper we show that several authors have derived wrong physical conclusions from a gross misunderstanding of the exact eigenvalues and eigenfunctions of a conditionally-solvable quantum-mechanical model. It consists of an eigenvalue equation with seemingly Coulomb, linear and harmonic terms. Here we compare the results derived by those authors with the actual eigenvalues of the models calculated by means of the Ritz variational method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Metrics and extrapolation of resonant magnetic perturbation thresholds for ELM suppression

This large database study of resonant magnetic perturbation (RMP) edge localized mode (ELM) suppression thresholds in the AUG, DIII-D, EAST, and KSTAR tokamaks details the key strengths and weaknesses of RMP metrics. The RMP ELM suppression database used for this work contains plasma information at the time of transition from ELMing to ELM suppressed states where a clear experimental threshold is identified. The experimental threshold distributions are compared for five metrics: (1) the island overlap width, (2) pedestal top Chirikov overlap, (3) peeling edge displacement, (4) pedestal top resonant drive, and (5) edge dominant mode overlap. The distributions, the regularity of the dependence on RMP coil currents, and the sensitivities of a given metric to equilibrium reconstruction details are compared. The overlap metric proves to be a good compromise between including the appropriate plasma response physics and maintaining a numerical robustness. This quantity does not exhibit clear power-law scalings for projection, but machine learning can assist in predicting thresholds within the existing parameter ranges and providing uncertainty quantification of those predictions. Two new first-principles models, one utilizing a threshold from the non-linear Modified Rutherford equation evaluated at the pedestal top and one utilizing the SLAYER code to calculate the linear tearing threshold from torque balance, offer possible paths to extrapolation beyond the existing database parameter space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

NCCS High Performance GMRES Mixed Precision

HPG-MxP is a software package that performs a fixed number of multigrid preconditioned (using a Gauss-Seidel smoother) Generalized minimal residual (PGMRES) iterations in order to solve a possibly nonsymmetric large sparse linear system of equations. It is designed to be a benchmark to measure a computer's performance for sparse linear algebra workloads typical in scientific computing while allowing the use of mixed precision methods. The solution is required to have convergence characteristics and accuracy similar to double precision GMRES. It is based on the High Performance Conjugate Gradient Benchmark (HPCG) which restricts all implementations to use only the IEEE double precision format (FP64). The original implementation (https://github.com/hpg-mxp/hpg-mxp) was written by Ichitaro Yamazaki, Jennifer Loe, Christian Glusa, Sivasankaran Rajamanickam, Piotr Luszczek, and Jack Dongarra. Please refer to that repository for documentation on the original implementation. This version is maintained by the National Center for Computational Sciences at Oak Ridge National Laboratory. It is highly scalable and optimized for Oak Ridge Leadership Computing Facility (OLCF) systems, particularly Frontier.

Kashi, Aditya [Oak Ridge National Laboratory (ORNL↗
DOE OSTI2021

IMEX Runge-Kutta Parareal for Non-diffusive Equations

Parareal is a widely studied parallel-in-time method that can achieve meaningful speedup on certain problems. However, it is well known that the method typically performs poorly on non-diffusive equations. This paper analyzes linear stability and convergence for IMEX Runge-Kutta Parareal methods on non-diffusive equations. By combining standard linear stability analysis with a simple convergence analysis, we find that certain Parareal configurations can achieve parallel speedup on non-diffusive equations. These stable configurations all posses low iteration counts, large block sizes, and a large number of processors. Numerical examples using the nonlinear Schrodinger equation demonstrate the analytical conclusions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Forward Analytic Model of Neutron Time-of-Flight Signals for Inferring Ion Temperatures from MagLIF Experiments

A forward analytic model is required to rapidly simulate the neutron time-of-flight (nToF) signals that result from magnetized liner inertial fusion (MagLIF) experiments at Sandia’s Z Pulsed Power Facility. Various experimental parameters, such as the burn-weighted fuel-ion temperature and liner areal density, determine the shape of the nToF signal and are important for characterizing any given MagLIF experiment. Extracting these parameters from measured nToF signals requires an appropriate analytic model that includes the primary deuterium-deuterium neutron peak, once-scattered neutrons in the beryllium liner of the MagLIF target, and direct beamline attenuation. Here, mathematical expressions for this model were derived from the general-geometry time- and energy-dependent neutron transport equation with anisotropic scattering. Assumptions consistent with the time-of-flight technique were used to simplify this linear Boltzmann transport equation into a more tractable form. Models of the uncollided and once-collided neutron scalar fluxes were developed for one of the five nToF detector locations at the Z-Machine. Numerical results from these models were produced for a representative MagLIF problem and found to be in good agreement with similar neutron transport simulations. Twenty experimental MagLIF data sets were analyzed using the forward models, which were determined to only be significantly sensitive to the ion temperature. The results of this work were also found to agree with values obtained separately using a zero scatter analytic model and a high-fidelity Monte Carlo simulation. Finally, inherent difficulties in this and similar techniques are identified, and a new approach forward is suggested.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Chapter 4 - Recent Advances in Identification of Differential Equations from Noisy Data: IDENT Review

Differential equations and numerical methods are extensively used to model various real-world phenomena in science and engineering. With modern developments, we aim to find the underlying differential equation from a single observation of time-dependent data. If we assume that the differential equation is a linear combination of various linear and nonlinear differential terms, then the identification problem can be formulated as solving a linear system. The goal then reduces to finding the optimal coefficient vector that best represents the time derivative of the given data. We review some recent works on the identification of differential equations. We find some common themes for the improved accuracy: (i) The formulation of linear system with proper denoising is important, (ii) how to utilize sparsity and model selection to find the correct coefficient support needs careful attention, and (iii) there are ways to improve the coefficient recovery. We present an overview and analysis of recent developments on the topic.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Gradient-based constrained optimization using a database of linear reduced-order models

A methodology grounded in model reduction is presented for accelerating the gradient-based solution of a family of linear or nonlinear constrained optimization problems where the constraints include at least one linear Partial Differential Equation (PDE). A key component of this methodology is the construction, during an offline phase, of a database of pointwise, linear, Projection-based Reduced-Order Models (PROM)s associated with a design parameter space and the linear PDE(s). A parameter sampling procedure based on an appropriate saturation assumption is proposed to maximize the efficiency of such a database of PROMs. A real-time method is also presented for interpolating at any queried but unsampled parameter vector in the design parameter space the relevant sensitivities of a PROM. The practical feasibility, computational advantages, and performance of the proposed methodology are demonstrated for several realistic, nonlinear, aerodynamic shape optimization problems governed by linear aeroelastic constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Modeling of the ECCD injection effect on the Heliotron J and LHD plasma stability

The aim of the study is to analyze the stability of the energetic particle modes (EPM) and Alfven Eigenmodes (AE) in Helitron J and LHD plasma if the electron cyclotron current drive (ECCD) is applied. Additionally, the analysis is performed using the code FAR3d that solves the reduced MHD equations describing the linear evolution of the poloidal flux and the toroidal component of the vorticity in a full 3D system, coupled with equations of density and parallel velocity moments for the energetic particle (EP) species, including the effect of the acoustic modes. The Landau damping and resonant destabilization effects are added via the closure relation. The simulation results show that the n = 1 EPM and n = 2 global AE (GAE) in Heliotron J plasma can be stabilized if the magnetic shear is enhanced at the plasma periphery by an increase (co-ECCD injection) or decrease (ctr-ECCD injection) of the rotational transform at the magnetic axis ($\rlap{-} \iota_{0}$). In the ctr-ECCD simulations, the EPM/AE growth rate decreases only below a given $\rlap{-} \iota_{0}$, similar to the ECCD intensity threshold observed in the experiments. In addition, ctr-ECCD simulations show an enhancement of the continuum damping. The simulations of the LHD discharges with ctr-ECCD injection indicate the stabilization of the n = 1 EPM, n = 2 toroidal AE (TAE) and n = 3 TAE, caused by an enhancement of the continuum damping in the inner plasma leading to a higher EP β threshold with respect to the co- and no-ECCD simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Multirate linearly-implicit GARK schemes

Many complex applications require the solution of initial-value problems where some components change fast, while others vary slowly. Multirate schemes apply different step sizes to resolve different components of the system, according to their dynamics, in order to achieve increased computational efficiency. The stiff components of the system, fast or slow, are best discretized with implicit base methods in order to ensure numerical stability. To this end, linearly implicit methods are particularly attractive as they solve only linear systems of equations at each step. This paper develops the Multirate GARK-ROS/ROW (MR-GARK-ROS/ROW) framework for linearly-implicit multirate time integration. The order conditions theory considers both exact and approximative Jacobians. The effectiveness of implicit multirate methods depends on the coupling between the slow and fast computations; an array of efficient coupling strategies and the resulting numerical schemes are analyzed. Multirate infinitesimal step linearly-implicit methods, that allow arbitrarily small micro-steps and offer extreme computational flexibility, are constructed. The new unifying framework includes existing multirate Rosenbrock(-W) methods as particular cases, and opens the possibility to develop new classes of highly effective linearly implicit multirate integrators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Parallel Algebraic Multigrid for Fusion and Higher-Order PDEs

Multigrid methods play a key role in large-scale scientific simulation because they are among the fastest and most scalable approaches for solving the underlying sparse linear systems of equations that arise from a wide array of Partial Differential Equation (PDE) discretizations. Algebraic multigrid (AMG) is a special type of multigrid method that depends only on the description of the linear system, giving it better portability and broader applicability than geometric multigrid, as it requires no explicit knowledge of the problem geometry. Even though these methods are widely used today, there are still applications where further development is needed. In this report, we focus on PDEs with higher-order terms (e.g., fourth order), concentrating on a PDE that arises in tokamak edge plasma simulations (a tokamak is a machine that confines a plasma using magnetic fields and is believed to be the leading plasma confinement concept for future fusion power plants). General multigrid relaxes a linear system on coarser grids and reverses this process with interpolation, but standard AMG methods struggle with the aforementioned higher-order PDEs. We investigate cyclic coarsening and interpolation heuristics, as well as new iterative approximation methods of refining the solution at each grid to improve the existing multigrid approach. To this end, we ensure that these techniques are transferable to a parallelized setting with LLNL’s supercomputers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Inertial dynamics of an interface with interfacial mass flux: Stability and flow fields’ structure, inertial stabilization mechanism, degeneracy of Landau’s solution, effect of energy fluctuations, and chemistry-induced instabilities

This work focuses on the long-standing problem of inertial dynamics of an interface with interfacial mass flux and reports new mechanisms for the interface stabilization and destabilization. The interface is a phase boundary separating fluids of different densities and having interfacial mass flux. To analyze the interface dynamics from a far field, we develop and apply the general matrix method to rigorously solve the boundary value problem involving the governing equations in the fluid bulk and the boundary conditions at the interface and at the outside boundaries of the domain. We find the fundamental solutions for the linearized system of equations and analyze the interplay of interface stability with flow fields’ structure by directly linking rigorous mathematical attributes to physical observables. We find that the interface is stable when the dynamics conserves the fluxes of mass, momentum, and energy; the stabilization is due to an inertial mechanism causing small oscillations of the interface velocity. In the classic Landau’s dynamics, the postulate of perfect constancy of the interface velocity leads to the development of Landau–Darrieus instability. This destabilization is also linked to the imbalance of the perturbed energy at the interface. The classic Landau’s solution is found to have degeneracy; lifting of the degeneracy may lead to singularity and self-similar dynamics. Our results compare well with traditional theories of combustion and propose new experiments to study the dynamics of the interface and the flow fields in combustible systems. We further conduct reactive molecular dynamics simulations to elucidate the complexity of chemical processes, to study the destabilizing effect of energy fluctuations on the interface stability, and to illustrate the chemistry-induced instabilities. In summary, we identify the extreme sensitivity of the interface dynamics to the interfacial boundary conditions, including the formal properties of fundamental solutions and the qualitative and quantitative properties of the flow fields. This provides new opportunities for studies, diagnostics, and control of multiphase flows in a broad range of processes in nature and technology.

42 ENGINEERING↗
DOE OSTI2023

Variational Quantum Linear Solver

Previously proposed quantum algorithms for solving linear systems of equations cannot be implemented in the near term due to the re quired circuit depth. Here, we propose a hybrid quantum-classical algorithm, called Variational Quantum Linear Solver (VQLS), for solving linear systems on near-term quantum computers. VQLS seeks to variationally prepare |x$\rangle$ such that A|x$\rangle$ ∝ |b$\rangle$. We derive an operationally meaningful termination condition for VQLS that allows one to guarantee that a desired solution precision ϵ is achieved. Specifically, we prove that C $⩾$ ϵ 2 /κ 2 , where C is the VQLS cost function and κ is the condition number of A. We present efficient quantum circuits to estimate C, while providing evidence for the classical hardness of its estimation. Using Rigetti’s quantum computer, we success fully implement VQLS up to a problem size of 1024 × 1024. Finally, we numerically solve nontrivial problems of size up to 2 50 × 2 50 . For the specific examples that we consider, we heuristically find that the time complexity of VQLS scales efficiently in ϵ, κ, and the system size N.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗