Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical errors”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Initialized Earth system prediction from subseasonal to decadal timescales

Initialized Earth system predictions are made by starting a numerical prediction model in a state as consistent as possible to observations, and running it forward in time for up to ten years. Skillful predictions at time slices from subseasonal to seasonal (S2S), seasonal to interannual (S2I) and seasonal to decadal (S2D) offer information useful for various stakeholders, from agriculture to water resource management, and human and infrastructure safety. In this Review, we examine the processes influencing predictability, and discuss estimates of skill across S2S, S2I and S2D timescales. There are encouraging signs that skillful predictions can be made: at S2S timescales, there has been some skill in predicting the Madden-Julian Oscillation and North Atlantic Oscillation; at S2I in predicting the El Niño-Southern Oscillation; and at S2D, in predicting variability in North Atlantic sea surface temperatures. However, challenges remain, and future work must prioritise reducing model error, more effectively communicating forecasts to users, and increasing process and mechanistic understanding that could increase predictive skill and, in turn, confidence. As numerical models progress towards Earth system models, initialized predictions are expanding to include prediction of sea-ice, air pollution, terrestrial and ocean biochemistry which can bring clear benefit to society and various stakeholders.

climate prediction↗
DOE OSTI2020

A Mixed Discontinuous Galerkin Method for Linear Elasticity with Strongly Imposed Symmetry

In this paper, we study a mixed discontinuous Galerkin (MDG) method to solve linear elasticity problem with arbitrary order discontinuous finite element spaces in d -dimension ( \(d=2,3\) ). This method uses polynomials of degree \(k+1\) for the stress and of degree k for the displacement ( \(k\ge 0\) ). The mixed DG scheme is proved to be well-posed under proper norms. Specifically, we prove that, for any \(k \ge 0\) , the \(H(\mathrm{div})\) -like error estimate for the stress and \(L^2\) error estimate for the displacement are optimal. We further establish the optimal \(L^2\) error estimate for the stress provided that the \({\mathcal {P}}_{k+2}-{\mathcal {P}}_{k+1}^{-1}\) Stokes pair is stable and \(k \ge d\) . Finally, we also provide numerical results of MDG showing that the orders of convergence are actually sharp.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A priori error analysis of high-order LL* (FOSLL*) finite element methods

A number of non-standard finite element methods have been proposed in recent years, each of which derives from a specific class of PDE-constrained norm minimization problems. The most notable examples are LL* methods. In this work, we argue that all high-order methods in this class should be expected to deliver substandard uniform h-refinement convergence rates. In fact, one may not even see rates proportional to the polynomial order p > 1 when the exact solution is a constant function. Here, we show that the convergence rate is limited by the regularity of an extraneous Lagrange multiplier variable which naturally appears via a saddle-point analysis. In turn, limited convergence rates appear because the regularity of this Lagrange multiplier is determined, in part, by the geometry of the domain. Numerical experiments support our conclusions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Hybrid particle-spectral method for kinetic plasma simulations

A hybrid model for numerical solutions of the Vlasov–Poisson equations is presented, which blends spectral and particle approaches. The model splits the distribution function for plasma species into both spectral and particle representations in the velocity space to combine the advantages of each approach. The spectral representation leverages asymmetrically weighted Hermite basis, whereas the particle representation leverages the particle-in-cell method. Configuration phase space is decomposed with the Fourier method, which is well suited for periodic problems. We derive conservation equations for mass, momentum, and energy for the proposed combined method. It is shown that the coupling error between the two methods is absent in the semi-discrete setting (not taking into account time discretization). Finally, numerical test cases are presented simulating a weak electron beam interaction with plasma, leading to beam–plasma instability. The initially localized electron beam evolved into a highly non-equilibrium distribution function in the velocity space. A small growth rate and the resonance nature of instability make it difficult to obtain accurate solutions for purely particle methods due to noise, which falls as ∼1/Np with a number of particles. At the same time, purely spectral methods may require a large number of modes to capture the highly non-equilibrium state of the evolved beam. We show that the hybrid method is well suited for such problems: it reproduces the linear stage as well as nonlinear dynamics with sufficient accuracy using a highly non-equilibrium distribution function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Hybrid particle-spectral method for kinetic plasma simulations

A hybrid model for numerical solutions of the Vlasov–Poisson equations is presented, which blends spectral and particle approaches. The model splits the distribution function for plasma species into both spectral and particle representations in the velocity space to combine the advantages of each approach. The spectral representation leverages asymmetrically weighted Hermite basis, whereas the particle representation leverages the particle-in-cell method. Configuration phase space is decomposed with the Fourier method, which is well suited for periodic problems. We derive conservation equations for mass, momentum, and energy for the proposed combined method. It is shown that the coupling error between the two methods is absent in the semi-discrete setting (not taking into account time discretization). Finally, numerical test cases are presented simulating a weak electron beam interaction with plasma, leading to beam–plasma instability. The initially localized electron beam evolved into a highly non-equilibrium distribution function in the velocity space. A small growth rate and the resonance nature of instability make it difficult to obtain accurate solutions for purely particle methods due to noise, which falls as ~1/$\sqrt{N_p}$ with a number of particles. At the same time, purely spectral methods may require a large number of modes to capture the highly nonequilibrium state of the evolved beam. We show that the hybrid method is well suited for such problems: it reproduces the linear stage as well as nonlinear dynamics with sufficient accuracy using a highly non-equilibrium distribution function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Efficient CP Rounding Using Alternating Least Squares with QR Decomposition

The CANDECOMP/PARAFAC (CP) decomposition is widely used for analyzing multidimensional data, and the alternating least squares (CP-ALS) algorithm is a common method for its computation. CP rounding is the problem of computing a lower-rank CP decomposition of an input already in a higher-rank CP format. While the normal equations (NE) approach in CP-ALS is efficient for the CP rounding problem and frequently used, it becomes unstable in the presence of ill-conditioned subproblems. This paper presents a new QR-based CP-ALS method for CP rounding that preserves both numerical stability and computational efficiency. Here, our experiments show that the proposed method offers significant speedup over a previous QR-based approach and the Tensor Toolbox's NE-based implementation, particularly for higher-order tensors. Furthermore, our approach demonstrates a marked reduction in error for ill-conditioned problems, with error reductions several orders of magnitude smaller compared to the NE-based method, while achieving faster convergence and more accurate solutions. By using a more numerically stable approach, we can solve more problems in reduced working precision, which enables further reduction in time to solution.

CANDECOMP/PARAFAC↗
DOE OSTI2026

Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces

This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.

Data-driven model reduction↗
DOE OSTI2025

Accurately simulating core-collapse self-interacting dark matter halos

The properties of satellite halos provide a promising probe for dark matter (DM) physics. Observations have motivated current efforts to explain surprisingly compact DM halos. If DM is not collisionless, but has strong self-interactions, halos can undergo gravothermal collapse, leading to higher densities in the central region of the halo. However, it is challenging to model this collapse phase from first principles. To improve on this, we sought to better understand the numerical challenges and convergence properties of self-interacting dark matter (SIDM) N-body simulations in the collapse phase. Especially, our aim was to better understand the evolution of satellite halos. To do so, we ran SIDM N-body simulations of a low-mass halo in isolation and within an external gravitational potential. The simulation set-up was motivated by the perturber of the stellar stream GD-1. We find that the halo evolution is very sensitive to energy conservation errors, and a SIDM kernel size that is too large can artificially speed up the collapse. Moreover, we demonstrate that the King model can describe the density profile at small radii for the late stages that we have simulated. Furthermore, for our most highly resolved simulation (N = 5 × 10 7 ) we have made the data public. It can serve as a benchmark. Overall, we find that the current numerical methods do not suffer from convergence problems in the late collapse phase and provide guidance on how to choose numerical parameters, for example that the energy conservation error is better kept well below 1%. This allows simulations to be run of halos that become concentrated enough to explain observations of GD-1-like stellar streams or strong gravitational lensing systems.

dark matter↗
DOE OSTI2025

Enhanced MPM framework with multipatch isogeometric analysis for geotechnical applications

Achieving stable stress solutions at large strains using the Material Point Method (MPM) is challenging due to the accumulation of errors associated with geometry discretization, cell-crossing noise, and volumetric locking. Several simplified attempts exist in the literature to mitigate these errors, including higher-order frameworks. However, the stability of the MPM solution in such frameworks has been limited to simple geometries and the single-phase formulation (i.e., neglecting pore fluid). Although never explored, multipatch isogeometric analysis offers desirable qualities to simulate complex geometries while mitigating errors in the MPM. The degree of required high-order spatial integration has also never been investigated to infer a minimum limit for the stability of the stress solution in MPM. This paper presents a general-purpose numerical framework for simulating stable stresses in porous media, capturing both near incompressibility and multiphase interactions. First, the numerical framework is presented considering Non-Uniform Rational B-splines (NURBS) to perform isogeometric analysis (IGA) in MPM. Additionally, a volumetric strain smoothing algorithm is used to alleviate errors associated with volumetric locking. Second, the manifestation of cell-crossing errors is assessed via a series of problems with orders ranging from linear to cubic interpolation functions. Third, the use of NURBS is investigated and verified for problems with circular geometries. Finally, multipatch analysis is deployed to simulate plane strain and 3D penetration in soils, considering nearly incompressible elastoplastic (total stress) analysis and fully-coupled hydro-mechanical (effective stress) analysis. The stability of the solution is also analyzed for different constitutive models. From the results, it can be concluded that the framework using cubic interpolation functions with strain smoothing is the most convenient, presenting stable stress solutions for a broad range of multiphase geotechnical applications.

58 GEOSCIENCES↗
DOE OSTI2023

Incremental Interval Assignment by Integer Linear Algebra with Improvements

Interval Assignment (IA) is the problem of selecting the number of mesh edges (intervals) for each curve for conforming quad and hex meshing. The intervals x is fundamentally integer-valued. Many other approaches perform numerical optimization then convert a floating-point solution into an integer solution, which is slow and error prone. We avoid such steps: we start integer, and stay integer. Incremental Interval Assignment (IIA) uses integer linear algebra (Hermite normal form) to find an initial solution to the meshing constraints, satisfying the integer matrix equation Solving for reduced row echelon form provides integer vectors spanning the nullspace of A. Here we add vectors from the nullspace to improve the initial solution, maintaining Ax = b Heuristics find good integer linear combinations of nullspace vectors that provide strict improvement towards variable bounds or goals. IIA always produces an integer solution if one exists. In practice we usually achieve solutions close to the user goals, but there is no guarantee that the solution is optimal, nor even satisfies variable bounds, e.g. has positive intervals. We describe several algorithmic changes since first publication that tend to improve the final solution. The software is freely available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Sparsity of the electron repulsion integral tensor using different localized virtual orbital representations in local second-order Møller–Plesset theory

Utilizing localized orbitals, local correlation theory can reduce the unphysically high system-size scaling of post-Hartree–Fock (post-HF) methods to linear scaling in insulating molecules. The sparsity of the four-index electron repulsion integral (ERI) tensor is central to achieving this reduction. For second-order Møller–Plesset theory (MP2), one of the simplest post-HF methods, only the (ia|jb) ERIs are needed, coupling occupied orbitals i, j and virtuals a, b. In this paper, we compare the numerical sparsity (called the “ragged list”) and two other approaches revealing the low-rank sparsity of the ERI. The ragged list requires only one set of (localized) virtual orbitals, and we find that the orthogonal valence virtual-hard virtual set of virtuals originally proposed by Subotnik et al. gives the sparsest ERI tensor. To further compress the ERI tensor, the pair natural orbital (PNO) type representation uses different sets of virtual orbitals for different occupied orbital pairs, while the occupied-specific virtual (OSV) approach uses different virtuals for each occupied orbital. Here, our results indicate that while the low-rank PNO representation achieves significant rank reduction, it also requires more memory than the ragged list. The OSV approach requires similar memory to that of the ragged list, but it involves greater algorithmic complexity. An approximation (called the “fixed sparsity pattern”) for solving the local MP2 equations using the numerically sparse ERI tensor is proposed and tested to be sufficiently accurate and to have highly controllable error. A low-scaling local MP2 algorithm based on the ragged list and the fixed sparsity pattern is therefore promising.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Analytic Theory for the Dynamics of Wide Quantum Neural Networks

Here, parametrized quantum circuits can be used as quantum neural networks and have the potential to outperform their classical counterparts when trained for addressing learning problems. To date, much of the results on their performance on practical problems are heuristic in nature. In particular, the convergence rate for the training of quantum neural networks is not fully understood. Here, we analyze the dynamics of gradient descent for the training error of a class of variational quantum machine learning models. We define wide quantum neural networks as parametrized quantum circuits in the limit of a large number of qubits and variational parameters. Then, we find a simple analytic formula that captures the average behavior of their loss function and discuss the consequences of our findings. For example, for random quantum circuits, we predict and characterize an exponential decay of the residual training error as a function of the parameters of the system. Finally, we validate our analytic results with numerical experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Validity of a finite temperature expansion for dense nuclear matter

In this work we provide a new, well-controlled expansion of the equation of state of dense matter from zero to finite temperatures (𝑇) while covering a wide range of charge fractions (𝑌 𝑄 ), from pure neutron to isospin symmetric nuclear matter. Our expansion can be used to describe neutron star mergers using the equation of state inferred from neutron star observations. We discuss how knowledge from low-energy nuclear experiments and heavy-ion collisions can be directly incorporated into the expansion. We also suggest new thermodynamic quantities of interest that can be calculated from theoretical models or directly inferred by experimental data that can be used to infer the finite temperature equation of state. With our new method, we can quantify the uncertainty in our finite 𝑇 and 𝑌 𝑄 expansions without making assumptions about the underlying degrees of freedom. We can reproduce results from a microscopic equation of state up to 𝑇 = 100 MeV for baryon chemical potential 𝜇 𝐵 ≳ 1100 MeV [≈(1–2)⁢𝑛 sat ] within 5% error, with even better results for larger 𝜇 𝐵 and/or lower 𝑇. We investigate the sources of numerical and theoretical uncertainty and discuss future directions of study.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Hardness Prediction by Incorporating Heat Transfer and Molten Pool Fluid Flow in a Multi-pass, Multi-layer Weld for Onsite Repair of Grade 91 steel

Introduction: In the current fleet of fossil-fired power plants, creep strength enhanced ferritic steels (CSEF) are used to sustain the harsh service conditions. Enhanced properties of Grade 91 steel result from tempered martensite with a fine distribution of MX and M23C6 carbides. Grade 91 steel is subjected to onsite welding repair to remedy their degradation due to extreme service condition. Knowledge of weld repairability of these steels, such as as-welded hardness distribution, is essential to establishing sound repair procedures. Experimental trial and error tests can consume a lot of time as many welding variables need to be studied. For numerical modelling, most of the multi-pass multi-layer models are based on finite element method, which are limited to solve the heat conduction equation and ignore convective heat transfer due to melt flow. Moreover, the mesh has to be pre-built based on a known or assumed weld cross-section geometry. These finite element based models thus have limited predictive capability as defects are not considered and nugget size are pre-assumed. This research aims at developing a thermal and microstructure evolution model incorporating molten pool dynamics in a multi-pass multi-layer material deposition to predict the as-welded hardness distribution. Technical Approach: All the thermal, physical, and metallurgical properties of Grade 91 as a function of temperature are collected from the literature and inputted into the thermo-fluid model based on Flow-3D, a computational fluid dynamics software. A multi-pass, multi-layer material deposition is simulated where the melting of filler wire into the molten pool is directly considered based on the volume of fluid (VOF) method. The flow behaviour of the molten pool is used to understand the formation of deposition geometry and defects. The temperature profiles during the multi-pass, multi-layer welding are calculated. The results computed using the new model are compared against the experimental data of fusion zone geometry and thermal cycles. Hardness prediction in the heat-affected zone (HAZ) are made using Johnson-Mehl-Avrami (JMA) equation for solid-state phase transformation kinetics. The JMA parameters are extracted from the experimental data available in the literature. For comparison, a standard finite element heat conduction model is also developed to predict the thermal cycles and hardness distribution in the multi-pass, multi-layer weld. Expected Result: Results obtained using the molten pool dynamic simulation versus the finite element heat conduction model are compared. Specifically, the effects of convective heat transfer on the accuracy of the calculated thermal history, bead shape and size, and HAZ hardness distribution are examined.

Modeling, Grade 91 steel, Multi-pass multi-layer d↗
DOE OSTI2023

Numerical Studies of the On-Line Reactivity Monitoring Techniques in Subcritical Systems: Revisit of the Area-Ratio Method, the Neutron Source-Modulation Method, and the Flux-to-Current Ratio Method

In the subcritical systems, the subcriticality level must be monitored continuously to ensure the safe operation of the systems. Techniques such as the neutron source-modulation method and the flux-to-current ratio method have been proposed for on-line reactivity measurements of the subcritical systems. However, the accuracy of these methods is unknown in the actual applications. In this report, the fundamental concepts of these techniques are visited, with numerical simulation techniques developed to validate these on-line reactivity monitoring methodologies. Specifically, the Monte Carlo numerical simulation results show that the neutron source-modulation method is not accurate in determining the reactivity of the subcritical systems. The flux-to-current ratio method can provide on-line reactivity measurements, and its spatial effects have been studied and well understood through the numerical simulations of the fuel loading of the neutron source facility of Ukraine. In addition, a modified version of the area-ratio method is proposed for the on-line measurements of the absolute reactivity of the subcritical systems. Monte Carlo numerical simulations showed that this method can provide the absolute reactivity of the subcritical systems within ~5% error, if the neutron detectors are placed close to the fuel assembly interface with the reflector zone or in the reflector zones away from the neutron source.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad–Shafranov equation by extension from polygonal subdomains

In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Central Compact Finite‐Difference Scheme With High Spectral Resolution for KdV Equation

This work presents a combination of cell‐node and cell‐centered compact finite difference scheme for the approximation of third derivatives involved in Korteweg–de Vries (KdV) equations. This approach employs a half‐shifted derivative construction at cell centers, avoiding the need for compact interpolation, thereby removing transfer errors; hence, it improves spectral resolution and maintains high‐order accuracy. Fourier analysis is performed to show the spectral properties of the proposed formulation, which provides higher spectral resolutions as compared to node‐based compact schemes. A filtering strategy is incorporated to suppress high‐frequency oscillations without compromising the accuracy of the numerical scheme, and the total variation diminishing Runge Kutta (TVDRK3) method is applied for time integration. Numerical experiments on linear, nonlinear, and coupled KdV systems are conducted, and a comparative analysis with cell‐node compact schemes confirms that the proposed scheme consistently reduces errors by up to an order of magnitude and achieves high spectral resolution properties.

97 MATHEMATICS AND COMPUTING↗