Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear approximation”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Quantum many-body linear algebra, Hamiltonian moments, and a coupled-cluster inspired framework

Here, we propose a general strategy to develop quantum many-body approximations of primitives in linear algebra algorithms. As a practical example, we introduce a coupled-cluster inspired framework to produce approximate Hamiltonian moments and demonstrate its application in various linear algebra algorithms for ground state estimation. Through numerical examples, we illustrate the difference between the ground-state energies arising from quantum many-body linear algebra and those from the analogous many-body perturbation theory. Our results support the general idea of designing quantum many-body approximations outside of perturbation theory, providing a route to new algorithms and approximations.

Algorithms and data structure↗
DOE OSTI2026

Taylor approximation variance reduction for approximation errors in PDE-constrained Bayesian inverse problems

In numerous applications, surrogate models are used as a replacement for accurate parameter-to-observable mappings when solving large-scale inverse problems governed by partial differential equations (PDEs). The surrogate model may be a computationally cheaper alternative to the accurate parameter-to-observable mappings and/or may ignore additional unknowns or sources of uncertainty. The Bayesian approximation error (BAE) approach provides a means to account for the induced uncertainties and approximation errors, i.e. the errors between the accurate parameter-to-observable mapping and the surrogate. The statistics of these errors are, however, in general unknown a priori, and are thus calculated using Monte Carlo sampling. Although the sampling is typically carried out offline, i.e. before considering the data, the process can still represent a computational bottleneck. In this work, we develop a scalable computational approach for reducing the costs associated with the sampling stage of the BAE approach. Specifically, we consider the Taylor expansion of the accurate and surrogate forward models with respect to the uncertain parameter fields either as a control variate for variance reduction or as a means to directly and efficiently approximate the mean and covariance of the approximation errors. We propose efficient methods for evaluating the expressions for the mean and covariance of the Taylor approximations based on linear(-ized) PDE solves. Furthermore, the proposed approach is independent of the dimension of the uncertain parameter, depending instead on the intrinsic dimension of the data, ensuring scalability to high-dimensional problems. The potential benefits of the proposed approach are demonstrated for two high-dimensional inverse problems governed by PDE examples, namely for the estimation of a distributed Robin boundary coefficient in a linear diffusion problem, and for a coefficient estimation problem governed by a nonlinear diffusion problem.

Bayesian approximation error↗
DOE OSTI2024

Adaptive Power Flow Approximations With Second-Order Sensitivity Insights

The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these challenges, recent research has proposed adaptive power flow linearizations that aim to achieve accuracy over wide operating ranges. The accuracy of these approximations inherently depends on the curvature of the power flow equations within these ranges, which necessitates considering second-order sensitivities. In this paper, we leverage second-order sensitivities to both analyze and improve power flow approximations. We evaluate the curvature across broad operational ranges and subsequently utilize this information to inform the computation of various sample-based power flow approximation techniques. Additionally, we leverage second-order sensitivities to guide the development of rational approximations that yield linear constraints in optimization problems. In conclusion, this approach is extended to enhance accuracy beyond the limitations of linear functions across varied operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Stellarator fusion systems enabled by arrays of planar coils

We present an overview of a novel electromagnetic coil configuration for stellarators and its application to two near-term fusion systems. The novel coil configuration is the planar coil stellarator, able to implement precisely-quasisymmetric 3D magnetic fields using a set of planar, plasma-encircling coils and a set of planar, field-shaping coils situated on a surface surrounding the plasma. This configuration combines the stellarator’s advantages of steady-state operation, stability, low recirculating power fraction, and a mature physics basis, with the benefits of using simpler, planar coils which allow for a maintenance scheme leveraging large ports, and the ability to control magnets individually. The initial near-term use case considered is a steady state deuterium–deuterium stellarator neutron source, called Eos. The second near-term use case considered is a deuterium–tritium stellarator fusion pilot plant, called Helios, that would be approximately twice the linear dimension of the Eos design.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Nonlinear manifold reduced order model

Traditional linear subspace reduced order models (LS-ROMs) are able to accelerate physical simulations in which the intrinsic solution space falls into a subspace with a small dimension, i.e., the solution space has a small Kolmogorov n-width. However, for physical phenomena not of this type, e.g., any advection-dominated flow phenomena such as in traffic flow, atmospheric flows, and air flow over vehicles, a lowdimensional linear subspace poorly approximates the solution. To address cases such as these, we have developed a fast and accurate physics-informed neural network ROM, namely nonlinear manifold ROM (NM-ROM), which can better approximate high-fidelity model solutions with a smaller latent space dimension than the LS-ROMs. Our software takes advantage of the existing numerical methods that are used to solve the corresponding full order models. The efficiency is achieved by developing a hyper-reduction technique in the context of the NM-ROM. Numerical results show that neural networks can learn a more efficient latent space representation on advection-dominated data from 1D and 2D Burgers' equations. A speedup of up to 2.6 for 1D Burgers' and a speedup of 11.7 for 2D Burgers' equations are achieved with an appropriate treatment of the nonlinear terms through a hyper-reduction technique.

Choi, Youngsoo↗
DOE OSTI2025

Projection-based multifidelity linear regression for data-scarce applications

Surrogate modeling for systems with high-dimensional quantities of interest remains challenging, particularly when training data are costly to acquire. This work develops multifidelity methods for multiple-input multiple-output linear regression targeting data-limited applications with high-dimensional outputs. Multifidelity methods integrate many inexpensive low-fidelity model evaluations with limited, costly high-fidelity evaluations. We introduce two projection-based multifidelity linear regression approaches with linear and nonlinear features that leverage principal component basis vectors for dimensionality reduction and combine multifidelity data through: (i) a direct data augmentation using low-fidelity data, and (ii) a data augmentation incorporating explicit linear corrections between low-fidelity and high-fidelity data. The data augmentation approaches combine high-fidelity and low-fidelity data into a unified training set and train the linear regression model through weighted least squares with fidelity-specific weights. We introduce a proximity-based weighting scheme with automatic weight selection strategy through cross-validation. Here, the proposed multifidelity linear regression methods are demonstrated on approximating the surface pressure field of a hypersonic vehicle in flight and the temperature field on an aircraft disc braking system. In an ultra low-data regime of no more than twelve high-fidelity samples, multifidelity linear regression achieves approximately 2% – 12% improvement in median accuracy and a higher R 2 score relative to single-fidelity methods at comparable computational cost.

data augmentation↗
DOE OSTI2025

Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces

This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.

kernel methods↗
DOE OSTI2025

An efficient second-order adaptive procedure for inserting CAD geometries into hexahedral meshes using volume fractions

Here, this paper is concerned with inserting three-dimensional computer-aided design (CAD) geometries into meshes composed of hexahedral elements using a volume fraction representation. An adaptive procedure for doing so is presented. The procedure consists of two steps. The first step performs spatial acceleration using a k-d tree. The second step involves subdividing individual hexahedra in an adaptive mesh refinement (AMR)-like fashion and approximating the CAD geometry linearly (as a plane) at the finest subdivision. The procedure requires only two geometric queries from a CAD kernel: determining whether or not a queried spatial coordinate is inside or outside the CAD geometry and determining the closest point on the CAD geometry’s surface from a given spatial coordinate. We prove that the procedure is second-order accurate for sufficiently smooth geometries and sufficiently refined background meshes. We demonstrate the expected order of accuracy is achieved with several verification tests and illustrate the procedure’s effectiveness for several exemplar CAD geometries.

Adaptive↗
DOE OSTI2025

A tri-level distribution locational marginal price-based demand response framework

Here, in this paper, we propose a tri-level, nested, two-stage price-based demand response (PBDR) framework that considers distribution locational marginal price (DLMP) as DR enabler between load-serving entities (LSE), demand response providers (DRPs), and customers in the day-ahead distribution market. It enables LSE and customer interactions by using multiple DRPs, positioned in-between, and independently optimizes their objectives. The problem is formulated using linear power flow with approximated power losses and its application in DLMP as DR pricing. The tri-level problem is solved using a nested reformulation & decomposition (R&D) method and tested on the real Indian-108 bus distribution system under various dynamic pricings. Further, the temporal–spatial variations in DLMPs are assessed using fairness criteria. Numerical analyses demonstrate that DLMP applications can effectively improve economic efficiency, and transparency in DR programs valuation with a favorable fairness margin. The results show that DLMP as DR pricing signal induces (0-2) % variation in DLMP for DR participation up to 10 %. Further, it gives over 90 % fairness over temporal–spatial variation for all the customers.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
DOE OSTI2024

A Particle Method for the Multispecies Landau Equation

Abstract The multispecies Landau collision operator describes the two-particle, small scattering angle or grazing collisions in a plasma made up of different species of particles such as electrons and ions. Recently, a structure preserving deterministic particle method (Carrillo et al. in J. Comput. Phys. 7:100066, 2020) has been developed for the single species spatially homogeneous Landau equation. This method relies on a regularization of the Landau collision operator so that an approximate solution, which is a linear combination of Dirac delta distributions, is well-defined. Based on a weak form of the regularized Landau equation, the time dependent locations of the Dirac delta functions satisfy a system of ordinary differential equations. In this work, we extend this particle method to the multispecies case, and examine its conservation of mass, momentum, and energy, and decay of entropy properties. We show that the equilibrium distribution of the regularized multispecies Landau equation is a Maxwellian distribution, and state a critical condition on the regularization parameters that guarantees a species independent equilibrium temperature. A convergence study comparing an exact multispecies Bobylev-Krook-Wu (BKW) solution to the particle solution shows approximately 2nd order accuracy. Important physical properties such as conservation, decay of entropy, and equilibrium distribution of the particle method are demonstrated with several numerical examples.

Mathematics↗
DOE OSTI2025

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Dynamics of McMillan mappings I. McMillan multipoles

In this article, we consider two dynamical systems: the McMillan sextupole and octupole integrable mappings, originally proposed by Edwin McMillan. Both represent the simplest symmetric McMillan maps, characterized by a single intrinsic parameter. While these systems find numerous applications across various domains of mathematics and physics, some of their dynamical properties remain unexplored. We aim to bridge this gap by providing a comprehensive description of all stable trajectories, including the parametrization of invariant curves, Poincaré rotation numbers, and canonical action–angle variables. In the second part, we establish connections between these maps and general chaotic maps in standard form. Our investigation reveals that the McMillan sextupole and octupole serve as first-order approximations of the dynamics around the fixed point, akin to the linear map and quadratic invariant (known as the Courant–Snyder invariant in accelerator physics), which represents zeroth-order approximations (referred to as linearization). Furthermore, we propose a novel formalism for nonlinear Twiss parameters, which accounts for the dependence of rotation number on amplitude. This stands in contrast to conventional betatron phase advance used in accelerator physics, which remains independent of amplitude. Notably, in the context of accelerator physics, this new formalism demonstrates its capability in predicting dynamical aperture around low-order resonances for flat beams, a critical aspect in beam injection/extraction scenarios.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

Neural Scaling Laws of Deep ReLU and Deep Operator Network: A Theoretical Study

Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient simulations of charge density waves in the transition metal Dichalcogenide TiSe 2

Charge density waves (CDWs) in transition metal dichalcogenides are the subject of growing scientific interest due to their rich interplay with exotic phases of matter and their potential technological applications. Here, using density functional theory with advanced meta-generalized gradient approximations (meta-GGAs) and linear response time-dependent density functional theory (TDDFT) with state-of-the-art exchange-correlation kernels, we investigate the electronic, vibrational, and optical properties in 1T-TiSe 2 with and without CDW. In both bulk and monolayer TiSe 2 , the electronic bands and phonon dispersions in either normal or CDW (semiconducting) phase are described well via meta-GGAs, which separate the valence and conduction bands just as HSE06 does but with significantly more computational feasibility. The experimentally observed humps of electron energy loss spectroscopy are successfully reproduced in TDDFT. Our work opens the door to simulating these complexities in CDW compounds from first principles by revealing meta-GGAs as an accurate low-cost alternative to HSE06.

Electronic properties and materials↗
DOE OSTI2025

Deep Koopman operators for causal discovery

Causal discovery aims to identify cause-effect mechanisms for better scientific understanding, explainable decision-making, and more accurate modeling. Standard statistical frameworks, such as Granger causality, lack the ability to quantify causal relationships in nonlinear dynamics due to the presence of complex feedback mechanisms, timescale mixing, and nonstationarity. Thus, applying these methods to study causal dynamics in real-world systems, such as the Earth, is a major challenge. Addressing this shortcoming, we leverage deep learning and a Koopman operator-theoretic formalism to present a class of causal discovery algorithms. Kausal uses deep Koopman operator methods to approximate nonlinear dynamics in a linearized vector space in which traditional causal inference methods such as Granger causality can be more easily applied. Our idealized experiments demonstrate Kausal’s superior ability in discovering and characterizing causal signals compared to existing deep learning and non-deep learning state-of-the-art approaches. Finally, the successful identification of major El Niño and La Niña events in observations showcases Kausal’s skill to handle real-world applications.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Analysis of heat transfer and AuNPs-mediated photo-thermal inactivation of E. coli at varying laser powers using single-phase CFD modeling

In the wake of the COVID-19 pandemics, the demand for innovative and effective methods of bacterial inactivation has become a critical area of research, providing the impetus for this study. The purpose of this research is to analyze the AuNPs-mediated photothermal inactivation of E. coli. Gold nanoparticles irradiated by laser represent a promising technique for combating bacterial infection that combines high-tech and scientific progress. The intermediate aim of the work was to present the calibration of the model with respect to the gold nanorods experiment. The purpose of this work is to study the effect of initial concentration of E. coli bacteria, the design of the chamber and the laser power on heat transfer and inactivation of E. coli bacteria. Using the CFD simulation, the work combines three main concepts. 1. The conversion of laser light to heat has been described by a combination of three distinctive approximations: a- Discrete particle integration to take into account every nanoparticle within the system, b- Rayleigh-Drude approximation to determine the scattering and extinction coefficients and c- Lambert–Beer–Bourger law to describe the decrease in laser intensity across the AuNPs. 2. The contribution of the presence of E. coli bacteria to the thermal and fluid-dynamic fields in the microdevice was modeled by single-phase approach by determining the effective thermophysical properties of the water-bacteria mixture. 3. An approach based on a temperature threshold attained at which bacteria will be inactivated, has been used to predict bacterial response to temperature increases. The comparison of the thermal fields and temporal temperature changes obtained by the CFD simulation with those obtained experimentally confirms the accuracy of the light-heat conversion model derived from the aforementioned approximations. The results show a linear relationship between maximum temperature and variation in laser power over the range studied, which is in line with previous experimental results. It was also found that the temperature inside the microchamber can exceed 55 °C only when a laser power higher than 0.8 W is used, so bacterial inactivation begins. The experimental data allows to determinate the concentration of nanoparticles. This parameter is introduced into the mathematical model obtaining the same number of AuNPs. However, this assumption introduces a certain simplification, as in the mathematical model the distribution of nanoparticles is uniform. This work is directly connected to the use of gold nanoparticles for energy conversion, as well as the field of bacterial inactivation in microfluidic systems such as lab-on-a-chip. Presented mathematical and numerical models can be extended to the entire spectrum of wavelengths with particular use of white light in the inactivation of bacteria. This work represents a significant advancement in the field, as to the best of the authors’ knowledge, it is the first to employ a single-phase computational fluid dynamics (CFD) approach specifically combined with the thermal inactivation of bacteria. Moreover, this research pioneers the use of a numerical simulation to analyze the temperature threshold of photothermal inactivation of E. coli mediated by gold nanorods (AuNRs). The integration of these methodologies offers a new perspective on optimizing bacterial inactivation techniques, making this study a valuable contribution to both computational modeling and biomedical applications.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Earth System Reanalysis in Support of Climate Model Improvements

Recent climate model developments, established through increased model resolution, have led to substantial improvements in model simulations of the time-evolving, coupled Earth system and its subcomponents. However, regardless of resolution, climate models will always produce climate features and variability that differ from the real world and will be prone to biases. This is due to many remaining uncertainties, such as in parametric and structural model uncertainty, in the initial conditions prescribed, and in the prescribed (scenario) forcing which varies on decadal to centennial timescales. Further model improvements are expected to arise specifically from improved representation of physical processes realized through model-data fusion. This will create an unprecedented opportunity to better exploit a large array of Earth observations, from in situ measurements to weather radars and satellite observations, as the resolved scales of the models approach those of the observations. For this, climate DA will be the central tool to bring models and observations into consistency, by improving initial conditions, inferring uncertain model parameters and structure, and quantifying uncertainty. Generally, there will be advantages and complementarities of adjoint-based smoother approaches, ensemble-based filter approaches, or new ML-inspired approaches. Yet, the ever-increasing model resolution will present growing challenges arising from computational cost, calling for new ways of performing data assimilation and model optimization. Using the complementarity in a hybrid approach, blending tools and concepts from variational, ensemble and ML methods might be what is required in the future. In this context ML could be important to handle non-linear responses, and to better approximate non-Gaussian distributions.

54 ENVIRONMENTAL SCIENCES↗