Search NASA⌕ Search

SEARCH · Search NASA

Results for “lagrange interpolation”

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 19 records

On the Lebesgue constant of weighted Leja points for Lagrange interpolation on unbounded domains

Here, this work focuses on weighted Lagrange interpolation on an unbounded domain and analyzes the Lebesgue constant for a sequence of weighted Leja points. The standard Leja points are a nested sequence of points defined on a compact subset of the real line and can be extended to unbounded domains with the introduction of a weight function w:R → [0,1]. Due to a simple recursive formulation in one dimension, such abscissas provide a foundation for high-dimensional approximation methods such as sparse grid collocation, deterministic least squares and compressed sensing. Just as in the unweighted case of interpolation on a compact domain, we use results from potential theory to prove that the Lebesgue constant for the Leja points grows subexponentially with the number of interpolation nodes.

97 MATHEMATICS AND COMPUTING↗

Derivation of new 3D discrete ordinate equations

The Sn equations have been the workhorse of deterministic radiation transport calculations for many years. Here we derive two new angular discretizations of the 3D transport equation. The first set of equations, derived using Lagrange interpolation and collocation, retains the classical Sn structure, with the main difference being how the scattering source is calculated. Because of the formal similarity with the classical S n equations, it should be possible to modify existing computer codes to take advantage of the new formulation. In addition, the new S n-like equations correctly capture delta function scattering. The second set of equations, derived using a Galerkin technique, does not retain the classical Sn structure because the streaming term is not diagonal. However, these equations can be cast into a form similar to existing methods developed to reduce ray effects. Numerical investigation of both sets of equations is under way. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - II: Numerical results

This paper is the second part of a two-part paper that documents the numerical results for the partial derivatives model presented in part I. In this paper, we derive the error bounds for the analytical point-wise error expression and verify our bounds with numerical experiments. The point-wise error expressions make available, and bound, the sources that contribute to the total error of the interpolated cross section in terms of the Lagrange interpolation errors and the model form error. MPACT is used to generate two-group homogenized cross sections for Westinghouse's AP1000 Region 4 lattice to evaluate the accuracy of the bounds. Error bounds calculated over a grid are compared to numerical data for uni-variate and multi-variate interpolation. The point-wise error bounds of a typical case matrix - two branches in each state variable - are displayed for bi-variate interpolation in the state variables: moderator density, fuel temperature, and boron concentration. The error bounds are shown to be highly accurate compared to numerical results, and in accordance with the underlying physics. We then discuss and show how the sources of error contribute to the total error, and consider the improvement of each error source. Finally, we mention future work such as propagating our cross section error bounds through a reactivity calculation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - I : Theory

This paper discusses two cross section interpolation methods commonly found in popular nodal codes; the partial derivatives and multiple tables models. The motivation for choosing a model, and thus a case matrix structure, is a trade off between accuracy and computational cost. Due to decades of experience, there are default structures that are sufficient for current light water reactor analysis. However, this is not necessarily the case for advanced reactor designs. Therefore, it is advantageous to understand the sources of error in cross section interpolation models so that the quality of a case matrix may be improved. A mathematical framework for these models is presented in this work that provides a more rigorous connection between the nuclear engineering field's cross section interpolation methods and the broader mathematical field of function approximation. The two cross section models examined in this paper were found to utilize Lagrange interpolation and are a subset of Lagrange tensor products. Classical results of Lagrange polynomial error analysis were then applied to the partial derivative and multiple tables models to derive expressions for the total point-wise error. The analytical results classify the total error into two parts: the model form error and interpolation error. Finally, based on our observations, a better foundation for improving the quality of a case matrix is proposed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

New discretization of Caputo–Fabrizio derivative

We derive a numerical approximation, namely L1–2 formula, to the Caputo–Fabrizio derivative by using a quadratic interpolation. Quadratic and cubic convergence rates are achieved for L1 and L1–2 formulas using Lagrange interpolation, respectively. We compute Caputo–Fabrizio derivatives of some known functions both theoretically and numerically. In addition, we solve non/linear sub-diffusion equations to test theoretical findings. Numerical results confirm the theoretically observed convergence rates.

97 MATHEMATICS AND COMPUTING↗

Hybrid PN-SN Calculations with SAAF for the Multiscale Transport Capability in Rattlesnake

Two interface conditions, the Lagrange multiplier method and the upwinding method, for hybrid \pn-\sn calculations is proposed for the self-adjoint angular flux (SAAF) formulation of the transport equation using the continuous finite element method (FEM) for spatial discretization. These interface conditions are implemented in Rattlesnake, the radiation transport application built on MOOSE, for the on-going multiscale transport simulation effort at INL. For smoothing the solution at the interface for the Lagrange multiplier method, a method based on \sn Lagrange interpolation on the sphere is proposed. Numerical results indicate that the interface conditions give the expected convergence.

97 MATHEMATICS AND COMPUTING↗

A high-order computational framework for particle-resolved simulations of disperse multiphase flows

This work presents a high-order numerical approach for particle-resolved simulations of disperse multiphase flows, where the Navier-Stokes equations for fluid flow are solved using a high-order spectral element method in the Eulerian framework, and the particle phase is directly simulated with a discrete element method. The coupling between particles and fluids is explicitly handled using an adapted direct-forcing immersed boundary method. Unlike the conventional schemes, a high-order barycentric Lagrange interpolation method and a Gaussian projection kernel are used to ensure accurate momentum exchange between local boundary points and surrounding fluid nodes in the framework of high-order fluid solver. Benchmark tests of increasing complexity are conducted to demonstrate the accuracy and efficiency of our method. Here, it is found that our approach exhibits an excellent convergence performance, as the fluid element/grid is refined and the number of boundary points increases. Compared to conventional low-order methods, the proposed high-order framework enables the use of substantially larger fluid elements while maintaining high accuracy in modeling fluid-particle interactions, owing to the enhanced resolution of high-order basis functions. Moreover, since the primary unknowns are stored at element or grid nodes, the high-order approach offers improved efficiency in both CPU memory usage and total computational cost.

42 ENGINEERING↗

A spectral-element discontinuous Galerkin lattice Boltzmann method for incompressible flows.

We present a spectral-element discontinuous Galerkin lattice Boltzmann method for solving nearly incompressible flows. Decoupling the collision step from the streaming step offers numerical stability at high Reynolds numbers. In the streaming step, we employ high-order spectral-element discontinuous Galerkin discretizations using a tensor product basis of one-dimensional Lagrange interpolation polynomials based on Gauss-Lobatto-Legendre grids. Our scheme is cost-effective with a fully diagonal mass matrix, advancing time integration with the fourth-order Runge-Kutta method. We present a consistent treatment for imposing boundary conditions with a numerical flux in the discontinuous Galerkin approach. We show convergence studies for Couette flows and demonstrate two benchmark cases with lid-driven cavity flows for Re = 400-5000 and flows around an impulsively started cylinder for Re = 550-9500. Computational results are compared with those of other theoretical and computational work that used a multigrid method, a vortex method, and a spectral element model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple and General Unitarity Conserving Numerical Real-Time Propagators of the Time-Dependent Schrödinger Equation Based on Magnus Expansion

Magnus expansion (ME) provides a general way to expand the real-time propagator of a time-dependent Hamiltonian within the exponential such that the unitarity is satisfied at any order. Here, we use this property and explicit integration of Lagrange interpolation formulas for the time-dependent Hamiltonian within each time interval and derive approximations that preserve unitarity for the differential time evolution operators of general time-dependent Hamiltonians. The resulting second-order approximation is the same as using the average of Hamiltonians for two end points of time. We identify three fourth-order approximations involving commutators of Hamiltonians at different times and also derive a sixth-order expression. A test of these approximations along with other available expressions for a two-state time-dependent Hamiltonian with sinusoidal time dependences provides information on the relative performance of these approximations and suggests that the derived expressions can serve as useful numerical tools for time evolution in time-resolved spectroscopy, quantum control, quantum sensing, real-time ab initio quantum dynamics, and open system quantum dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum error mitigation by layerwise Richardson extrapolation

A widely used method for mitigating errors in noisy quantum computers is Richardson extrapolation, a technique in which the overall effect of noise on the estimation of quantum expectation values is captured by a single parameter that, after being scaled to larger values, is eventually extrapolated to the zero-noise limit. We generalize this approach by introducing layerwise Richardson extrapolation (LRE), an error mitigation protocol in which the noise of different individual layers (or larger chunks of the circuit) is amplified and the associated expectation values are linearly combined to estimate the zero-noise limit. The coefficients of the linear combination are analytically obtained from the theory of multivariate Lagrange interpolation. LRE leverages the flexible configurational space of layerwise unitary folding, allowing for a more nuanced mitigation of errors by treating the noise level of each layer of the quantum circuit as an independent variable. Furthermore, we provide numerical simulations demonstrating scenarios where LRE achieves superior performance compared to traditional (single-variable) Richardson extrapolation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhancements to the SHARP Build System and NEK5000 Coupling

The SHARP project for the Department of Energy's Nuclear Energy Advanced Modeling and Simulation (NEAMS) program provides a multiphysics framework for coupled simulations of advanced nuclear reactor designs. It provides an overall coupling environment that utilizes custom interfaces to couple existing physics codes through a common spatial decomposition and unique solution transfer component. As of this writing, SHARP couples neutronics, thermal hydraulics, and structural mechanics using PROTEUS, Nek5000, and Diablo respectively. This report details two primary SHARP improvements regarding the Nek5000 and Diablo individual physics codes: (1) an improved Nek5000 coupling interface that lets SHARP achieve a vast increase in overall solution accuracy by manipulating the structure of the internal Nek5000 spatial mesh, and (2) the capability to seamlessly couple structural mechanics calculations into the framework through improvements to the SHARP build system. The Nek5000 coupling interface now uses a barycentric Lagrange interpolation method that takes the vertex-based power and density computed from the PROTEUS neutronics solver and maps it to the user-specified, general-order Nek5000 spectral element mesh. Before this work, SHARP handled this vertex-based solution transfer in an averaging-based manner. SHARP users can now achieve higher levels of accuracy by specifying any arbitrary Nek5000 spectral mesh order. This improvement takes the average percentage error between the PROTEUS power solution and the Nek5000 interpolated result down drastically from over 23 % to just above 2 %, and maintains the correct power profile. We have integrated Diablo into the SHARP build system to facilitate the future coupling of structural mechanics calculations into SHARP. Previously, simulations involving Diablo were done in an iterative manner, requiring a large amount manual work, and left only as a task for advanced users. This report will detail a new Diablo build system that was implemented using GNU Autotools, mirroring much of the current SHARP build system, and easing the use of structural mechanics calculations for end-users of the SHARP multiphysics framework. It lets users easily build and use Diablo as a stand-alone simulation, as well as fully couple with the other SHARP physics modules. The top-level SHARP build system was modified to allow Diablo to hook in directly. New dependency handlers were implemented to let SHARP users easily build the framework with these new simulation capabilities. The remainder of this report will describe this work in full, with a detailed discussion of the overall design philosophy of SHARP, the new solution interpolation method introduced, and the Diablo integration work. We will conclude with a discussion of possible future SHARP improvements that will serve to increase solution accuracy and framework capability.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Explicit Form for the Most General Lorentz Transformation Revisited

Explicit formulae for the 4×4 Lorentz transformation matrices corresponding to a pure boost and a pure three-dimensional rotation are very well known. Significantly less well known is the explicit formula for a general Lorentz transformation with arbitrary non-zero boost and rotation parameters. We revisit this more general formula by presenting two different derivations. The first derivation (which is somewhat simpler than previous ones appearing in the literature) evaluates the exponential of a 4×4 real matrix A, where A is a product of the diagonal matrix diag(+1,−1,−1,−1) and an arbitrary 4×4 real antisymmetric matrix. The formula for expA depends only on the eigenvalues of A and makes use of the Lagrange interpolating polynomial. The second derivation exploits the observation that the spinor product η†σ¯μχ transforms as a Lorentz four-vector, where χ and η are two-component spinors. The advantage of the latter derivation is that the corresponding formula for a general Lorentz transformation Λ reduces to the computation of the trace of a product of 2×2 matrices. Both computations are shown to yield equivalent expressions for Λ.

Science & Technology - Other Topics↗

Inferring the Gibbs state of a small quantum system

Gibbs states are familiar from statistical mechanics, yet their use is not limited to that domain. For instance, they also feature in the maximum entropy reconstruction of quantum states from incomplete measurement data. Outside the macroscopic realm, however, estimating a Gibbs state is a nontrivial inference task, due to two complicating factors: the proper set of relevant observables might not be evident a priori; and whenever data are gathered from a small sample only, the best estimate for the Lagrange parameters is invariably affected by the experimenter's prior bias. I show how the two issues can be tackled with the help of Bayesian model selection and Bayesian interpolation, respectively, and illustrate the use of these Bayesian techniques with a number of simple examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Securely Aggregated Coded Matrix Inversion

Coded computing is a method for mitigating straggling workers in a centralized computing network, by using erasure-coding techniques. Federated learning is a decentralized model for training data distributed across client devices. In this work we propose approximating the inverse of an aggregated data matrix, where the data is generated by clients; similar to the federated learning paradigm, while also being resilient to stragglers. To do so, we propose a coded computing method based on gradient coding. We modify this method so that the coordinator does not access the local data at any point; while the clients access the aggregated matrix in order to complete their tasks. Here, the network we consider is not centrally administrated, and the communications which take place are secure against potential eavesdroppers.

97 MATHEMATICS AND COMPUTING↗

Boundary node Petrov–Galerkin method in solid structures

Based on the interpolation of the Lagrange series and the Finite Block Method (FBM), the formulations of the Boundary Node Petrov–Galerkin Method (BNPGM) are presented in the weak form in this paper and their applications are demonstrated to the elasticity of functionally graded materials, subjected to static and dynamic loads. By introducing the mapping technique, a block of quadratic type is transformed from the Cartesian coordinate to the normalized coordinate with 8 seeds for two-dimensional problems. The first-order partial differential matrices of boundary nodes are obtained in terms of the nodal values of the boundary node, which can be utilized to determine the tractions on the boundary. Time-dependent partial differential equations are analyzed in the Laplace transformed domain and the Durbin’s inversion method is applied to determine the physical values in the time domain. Illustrative numerical examples are given and comparison has been made with the analytical solutions, the Boundary Element Method (BEM) and the Finite Element Method (FEM).

97 MATHEMATICS AND COMPUTING↗

Overset meshes for incompressible flows: On preserving accuracy of underlying discretizations

This study on overset meshes for incompressible-flow simulations is motivated by accurate prediction of wind farm aerodynamics involving large motions and deformations of components with complex geometry. Specifically, using first-order hyperbolic and elliptic equation proxies for the incompressible Navier-Stokes (NS) equations, we investigate the influence of information exchange between overset meshes on numerical performance where the underlying discretization is second-order accurate. The first aspect of information exchange surrounds interpolation of solution where we examine Lagrange and point-cloud-based interpolation for creating constraint equations between overset meshes. To maintain overall second-order accuracy, higher-order interpolation is required for elliptic problems, but linear interpolation is sufficient for hyperbolic problems in first-order form. Higher-order point-cloud-based interpolation provides a pathway to maintaining accuracy in unstructured meshes, but at higher complexity. The second aspect of information exchange focuses on comparing the approaches of overset single system (OSS) and overset Additive Schwarz (OAS) for coupling the linear systems of the overlapping meshes. While the former involves a single linear system, in the latter the discrete linear systems are solved separately, and solving the global system is accomplished through outer iterations and sequential information exchange in a Jacobi fashion. For the test cases studied, accuracy for hyperbolic problems is maintained by performing two outer iterations, whereas many outer iterations are required for elliptic systems. The order-of-accuracy studies explored here are critical for verifying the overset-mesh coupling algorithms used in engineering simulations. Accuracy of these simulations themselves is, however, quantified using engineering quantities of interest such as drag, power, etc. Consequently, we conclude with numerical experiments using NS equations for incompressible flows where we show that linear interpolation and few outer iterations are sufficient for achieving asymptotic convergence of engineering quantities of interest.

97 MATHEMATICS AND COMPUTING↗

Using multi-dimensional Smolyak interpolation to make a sum-of-products potential

We propose a new method for obtaining potential energy surfaces in sum-of-products (SOP) form. If the number of terms is small enough, a SOP potential surface significantly reduces the cost of quantum dynamics calculations by obviating the need to do multidimensional integrals by quadrature. The method is based on a Smolyak interpolation technique and uses polynomial-like or spectral basis functions and 1D Lagrange-type functions. When written in terms of the basis functions from which the Lagrange-type functions are built, the Smolyak interpolant has only a modest number of terms. The ideas are tested for HONO (nitrous acid)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗