Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Application of linear prolongation to coarse mesh finite difference acceleration in CASMO5

The Coarse-Mesh Finite Difference (CMFD) method has been used for over a decade to accelerate the convergence of the Method of Characteristics (MOC) solution to the two- dimensional particle transport equation in CASMO5. Numerical testing, along with widespread use in production-level calculations, have shown that the current CMFD implementation provides stability and robustness for a wide range of realistic reactor physics problems. However, the recent development of linear prolongation has attracted attention from the community as a way to further improve the performance and stability of CMFD. Two interpolation methods for linear prolongation are presented in this work and implemented into a test version of CASMO5. The performance of the proposed interpolations, referred to as the bilinear and linear directional schemes, is evaluated in terms of runtime relative to the default constant or uniform scaling update. Numerical results indicate that the use of linear prolongation can reduce the transport solver runtime on average by approximately 10% when tested with two hundred randomly selected cases. The new directional linear interpolation, combined with default constant boundary updates, is found to provide the highest reduction in runtime for the cases analyzed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

A quasi-meshfree method for constructing boundary-aware reproducing bases on geometrically complex domains using manifold geodesics

In many applications, physical domains are geometrically complex making it challenging to perform coarse-scale approximation. A defeaturing process is often used to simplify the domain in preparation for approximation and analysis at the coarse scale. In this paper, a methodology is presented for constructing a coarse-scale reproducing basis on geometrically complex domains given an initial fine-scale mesh of the fully featured domain. The initial fine-scale mesh can be of poor quality and extremely refined. The construction of the basis functions begins with a coarse-scale covering of the domain and generation of weighting functions with local support. Manifold geodesics are used to define distances within the local support for general applicability to non-convex domains. Conventional moving least squares is used to construct the coarse-scale reproducing basis. Applications in quasi-interpolation and linear elasticity are presented.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Velocity-pressure integrated versus penalty finite element methods for high Reynolds number flows

Velocity-pressure integrated and consistent penalty finite element computations of high Reynolds number, laminar flows are presented. In both of the methods, the pressure has been interpolated using linear shape functions for a triangular element. The triangular element is contained inside the bi-quadratic isoparametric element. It has been reported previously that the pressure interpolation method, when used in the velocity-pressure integrated method, yielded accurate computational results for high Reynolds number flows. It is shown that use of the same pressure interpolation method in the consistent penalty finite element method yielded accurate velocity and pressure fields which were comparable to those obtained using the velocity-pressure integrated method. Accuracy of the two finite element methods has been demonstrated by comparing the computational results with available experimental data and/or fine-grid finite difference computational results. Advantages and disadvantages of the two methods are discussed on the basis of accuracy and convergence nature. Example problems considered include a lid-driven cavity flow for Reynolds number of 10,000, a laminar backward-facing step flow, a laminar flow through a nest of cylinders, and a channel flow with an internal blockage. A finite element computer program (NSFLOW/P) for the 2-D, incompressible Navier-Stokes equations is also presented.

Kim, Sang-Wook↗
DOE OSTI2025

Coupling Approaches with Non-matching Grids for Classical Linear Elasticity and Bond-based Peridynamic Models in 1D

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. To facilitate the coupling of the two models, non-matching grids are often desirable as nonlocal grids usually require a finer resolution than local grids. In that case, it is often convenient to resort to interpolation operators so that models can exchange information in the overlap regions when nodes from the two grids do not coincide. This paper studies three existing coupling approaches, namely 1) a method that enforces matching displacements in an overlap region, 2) a variant that enforces a constraint on the stresses instead, and 3) a method that considers a variable horizon in the vicinity of the interfaces. Further, the effect of the interpolation order and of the grid ratio on the performance of the three coupling methods with non-matching grids is carefully studied on one-dimensional examples using polynomial manufactured solutions. The numerical results show that the degree of the interpolants should be chosen with care to avoid introducing additional modeling errors, or simply minimize these errors, in the coupling approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Computer-controlled finishing via dynamically constraint position-velocity-time scheduler

In a Computer Numerical Controlled (CNC) finishing process, the target material removal from an optical surface is guided by the convolution between the influence function of a machine tool and its dwell time at certain points over the surface. To reduce dynamics stressing and increase machining efficiency, the dwell time must be converted to varying velocities, which are the actual inputs to the machine tool controller. Conventionally, the conversion assumed constant acceleration and relied on linear motion interpolation, which caused discontinuities in velocities. This unsmooth motion affects the material removal distribution, and, thus, the accuracy of the finished surface shape. Many modern CNC machines support the smoother, cubic-polynomial interpolated Position-Velocity-Time (PVT) motion mode; however, the conventional scheduler may fail to provide suitable velocities for the PVT. Here in this study answers this challenge by proposing a novel PVT-based velocity scheduler that achieves smooth motion while considering CNC dynamic limits. Firstly, the principle of the PVT is explained, and the PVT-based velocity scheduler is formulated. Secondly, a quadratic programming is used to optimize the velocities by imposing the CNC dynamic constraints and the C 1 continuities (zeroth and first derivatives are continuous) simultaneously. Thirdly, the smoothness and accuracy of the scheduled velocities are studied on different kinds of tool paths via simulation. Finally, a sub-0.3 nm level surface finishing experiment using ion beam figuring is demonstrated to verify the feasibility of the proposed method. The PVT-based scheduler and simulator code is open-sourced.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Analog In-Memory Computing for the Synthetic Aperture Radar Polar Format Algorithm

As the utility of synthetic aperture radar (SAR) systems increases in autonomous vehicles, satellites, and other power- and space-constrained edge applications, there is a growing need for processors that can form SAR images at low power. In recent years, analog in-memory compute (AIMC) has shown immense promise for accelerating neural networks and other matrix-vector multiplication (MVM) heavy workloads at the edge. Here, in this work, we examine how the polar format algorithm (PFA), a popular SAR image formation algorithm, can be mapped to these AIMC systems. The PFA maps readily onto analog MVMs because it primarily consists of two linear operations: interpolation of frequency-domain data to a Cartesian grid, followed by a 2-D Fourier transform. This work presents two approaches to map the interpolation operation onto MVMs in analog hardware: a chirp transform and a modified form of sinc interpolation. These mappings introduce algorithmic errors, and their effect on the quality of SAR image formation is examined, both quantitatively and qualitatively. In addition, the impact of errors introduced by the analog hardware is explored to determine which approach is optimal under varying assumptions about the underlying analog memory devices and circuits.

Analog computing↗
DOE OSTI2026

MAGIC: M arching Cubes Isosurface Uncertainty Visualization for G auss i an Uncertain Data With Spatial C orrelation

Here, in this paper, we study the propagation of data uncertainty through the marching cubes algorithm for isosurface visualization for correlated uncertain data. Consideration of correlation has been shown paramount for avoiding errors in uncertainty quantification and visualization in multiple prior studies. Although the problem of isosurface uncertainty with spatial data correlation has been previously addressed, there are two major limitations to prior treatments. First, there are no analytical formulations for uncertainty quantification of isosurfaces when the data uncertainty is characterized by a Gaussian distribution with spatial correlation. Second, as a consequence of the lack of analytical formulations,existing techniques resort to a Monte Carlo sampling approach, which is expensive and difficult to integrate into visualization tools. To address these limitations, we present a closed-form framework to efficiently derive uncertainty in marching cubes level-sets for Gaussian uncertain data with spatial correlation (MAGIC). To derive closed-form solutions, we leverage the Hinkley's derivation on the ratio of Gaussian distributions. With our analytical framework, we achieve a significant speed-up and enhanced accuracy of uncertainty quantification over classical Monte Carlo methods. We further accelerate our analytical solutions using many-core processors to achieve speed-ups up to 585× and integrability with production visualization tools for broader impact. We demonstrate the effectiveness of our correlation-aware uncertainty framework through experiments on meteorology, urban flow, and astrophysics simulation datasets.

Gaussian↗
NASA NTRS1972

The application of color display techniques for the analysis of Nimbus infrared radiation data

A color enhancement system designed for the Applications Technology Satellite (ATS) spin scan experiment has been adapted for the analysis of Nimbus infrared radiation measurements. For a given scene recorded on magnetic tape by the Nimbus scanning radiometers, a virtually unlimited number of color images can be produced at the ATS Operations Control Center from a color selector paper tape input. Linear image interpolation has produced radiation analyses in which each brightness-color interval has a smooth boundary without any mosaic effects. An annotated latitude-longitude gridding program makes it possible to precisely locate geophysical parameters, which permits accurate interpretation of pertinent meteorological, geological, hydrological, and oceanographic features.

Allison, L. J.↗
NASA NTRS1984

Algebraic grid generation for wing-fuselage bodies

An algebraic procedure for the generation of boundary-fitted grids about wing-fuselage configurations is presented. A wing-fuselage configuration is specified by cross sections and mathematically represented by Coons' patches. A configuration is divided into sections so that several grid blocks that either adjoin each other or partially overlap each other can be generated, and each grid has six surfaces that map into a computational cube. Grids are first determined on the six boundary surfaces and then in the interior. Grid curves that are on the surface of the configuration are derived using plane-patch intersections, and single-valued functions relating approximate arc lengths along the curves to computational coordinates define the distribution of grid points. The two-boundary technique and transfinite interpolation are used to determine the boundary surface grids that are not on the configuration, and transfinite interpolation with linear blending functions is used to determine the interior grids.

Smith, R. E.↗
NASA NTRS1986

Algebraic grid generation about wing-fuselage bodies

An algebraic procedure for the generation of boundary-fitted grids about wing-fuselage configurations is presented. A wing-fuselage configuration is specified by cross sections and mathematically represented by Coons' patches. A configuration is divided into sections so that several grid blocks that either adjoin each other or partially overlap each other can be generated. Each grid has six exterior surfaces that map into a computational cube. Grids are first determined on the six boundary surfaces and then in the interior. Grid curves that are on the surface of the configuration are derived from the intersection of planes with the Coons' patch definition. Single-valued functions relating approximate arc lengths along the grid curves to a computational coordinate define the distribution of grid points. The two-boundary technique and transfinite interpolation are used to determine the boundary surface grids that are not on the configuration, and transfinite interpolation with linear blending functions is used to determine the interior grid.

Smith, R. E.↗
NASA NTRS1987

A finite element computational method for high Reynolds number laminar flows

A velocity-pressure integrated, mixed interpolation, Galerkin finite element method for the Navier-Stokes equations is presented. In the method, the velocity variables are interpolated using complete quadratic shape functions, and the pressure is interpolated using linear shape functions which are defined on a triangular element for the two-dimensional case and on a tetrahedral element for the three-dimensional case. The triangular element and the tetrahedral element are contained inside the complete bi- and tri-quadratic elements for velocity variables for two and three dimensional cases, respectively, so that the pressure is discontinuous across the element boundaries. Example problems considered include: a cavity flow of Reynolds numbers 400 through 10,000; a laminar backward facing step flow; and a laminar flow in a square duct of strong curvature. The computational results compared favorably with the finite difference computational results and/or experimental data available. It was found that the present method can capture the delicate pressure driven recirculation zones, that the method did not yield any spurious pressure modes, and that the method requires fewer grid points than the finite difference methods to obtain comparable computational results.

Kim, Sang-Wook↗
NASA NTRS1988

A velocity-pressure integrated, mixed interpolation, Galerkin finite element method for high Reynolds number laminar flows

A velocity-pressure integrated, mixed interpolation, Galerkin finite element method for the Navier-Stokes equations is presented. In the method, the velocity variables were interpolated using complete quadratic shape functions and the pressure was interpolated using linear shape functions. For the two dimensional case, the pressure is defined on a triangular element which is contained inside the complete biquadratic element for velocity variables; and for the three dimensional case, the pressure is defined on a tetrahedral element which is again contained inside the complete tri-quadratic element. Thus the pressure is discontinuous across the element boundaries. Example problems considered include: a cavity flow for Reynolds number of 400 through 10,000; a laminar backward facing step flow; and a laminar flow in a square duct of strong curvature. The computational results compared favorable with those of the finite difference methods as well as experimental data available. A finite elememt computer program for incompressible, laminar flows is presented.

Kim, Sang-Wook↗
NASA NTRS1988

A fine grid finite element computation of two-dimensional high Reynolds number flows

A velocity-pressure-integrated mixed-interpolation Galerkin finite-element computation of the Navier-Stokes equations using the grids is presented. The velocity variables are interpolated using complete quadratic shape functions, and the pressure was interpolated using linear shape functions defined on a triangular element which is contained inside the quadratic element for velocity variables. Comprehensive computational results for a cavity flow at Reynolds number Re = 400-10,000 and a laminar backward-facing step flow at Re = 100-900 are presented. Many high-Re flows involve convection-dominated motion as well as diffusion-dominated motion in the flow domain. The computational results for both of the fluid motions compared favorably with high-accuracy finite-difference computational results and/or experimental data.

Kim, Sang-Wook↗
NASA NTRS1991

Time-accurate incompressible flow computations with quadrilateral velocity-pressure elements

Quadrilateral velocity-pressure elements with constant and linear pressure interpolations are examined in the context of time-accurate finite element computation of unsteady incompressible flows. These elements involve streamline-upwind/Petrov-Galerkin stabilization and are implemented in conjunction with the one-step and multi-step temporal integration of the Navier-Stokes equations. The two test cases chosen for the performance evaluation of the formulations are the standing vortex problem and flow past a circular cylinder at Reynolds number 100.

Tezduyar, T. E.↗
NASA NTRS1994

Discrete-Layer Piezoelectric Plate and Shell Models for Active Tip-Clearance Control

The objectives of this work were to develop computational tools for the analysis of active-sensory composite structures with added or embedded piezoelectric layers. The targeted application for this class of smart composite laminates and the analytical development is the accomplishment of active tip-clearance control in turbomachinery components. Two distinct theories and analytical models were developed and explored under this contract: (1) a discrete-layer plate theory and corresponding computational models, and (2) a three dimensional general discrete-layer element generated in curvilinear coordinates for modeling laminated composite piezoelectric shells. Both models were developed from the complete electromechanical constitutive relations of piezoelectric materials, and incorporate both displacements and potentials as state variables. This report describes the development and results of these models. The discrete-layer theories imply that the displacement field and electrostatic potential through-the-thickness of the laminate are described over an individual layer rather than as a smeared function over the thickness of the entire plate or shell thickness. This is especially crucial for composites with embedded piezoelectric layers, as the actuating and sensing elements within these layers are poorly represented by effective or smeared properties. Linear Lagrange interpolation polynomials were used to describe the through-thickness laminate behavior. Both analytic and finite element approximations were used in the plane or surface of the structure. In this context, theoretical developments are presented for the discrete-layer plate theory, the discrete-layer shell theory, and the formulation of an exact solution for simply-supported piezoelectric plates. Finally, evaluations and results from a number of separate examples are presented for the static and dynamic analysis of the plate geometry. Comparisons between the different approaches are provided when possible, and initial conclusions regarding the accuracy and limitations of these models are given.

Heyliger, P. R.↗
NASA NTRS2008

Stable Calibration of Raman Lidar Water-Vapor Measurements

A method has been devised to ensure stable, long-term calibration of Raman lidar measurements that are used to determine the altitude-dependent mixing ratio of water vapor in the upper troposphere and lower stratosphere. Because the lidar measurements yield a quantity proportional to the mixing ratio, rather than the mixing ratio itself, calibration is necessary to obtain the factor of proportionality. The present method involves the use of calibration data from two sources: (1) absolute calibration data from in situ radiosonde measurements made during occasional campaigns and (2) partial calibration data obtained by use, on a regular schedule, of a lamp that emits in a known spectrum determined in laboratory calibration measurements. In this method, data from the first radiosonde campaign are used to calculate a campaign-averaged absolute lidar calibration factor (t(sub 1)) and the corresponding campaign-averaged ration (L(sub 1)) between lamp irradiances at the water-vapor and nitrogen wavelengths. Depending on the scenario considered, this ratio can be assumed to be either constant over a long time (L=L(sub 1)) or drifting slowly with time. The absolutely calibrated water-vapor mixing ratio (q) obtained from the ith routine off-campaign lidar measurement is given by q(sub 1)=P(sub 1)/t(sub 1)=LP(sub 1)/P(sup prime)(sub 1) where P(sub 1) is water-vapor/nitrogen measurement signal ration, t(sub 1) is the unknown and unneeded overall efficiency ratio of the lidar receiver during the ith routine off-campaign measurement run, and P(sup prime)(sub 1) is the water-vapor/nitrogen signal ratio obtained during the lamp run associated with the ith routine off-campaign measurement run. If L is assumed constant, then the lidar calibration is routinely obtained without the need for new radiosonde data. In this case, one uses L=L(sub 1) = P(sup prime)(sub 1)/t(sub 1), where P(sub 1)(sup prime) is the water-vapor/nitrogen signal ratio obtained during the lamp run associated with the first radiosonde campaign. If L is assumed to drift slowly, then it is necessary to postpone calculation of a(sub 1) until after a second radiosonde campaign. In this case, one obtains a new value, L(sub 2), from the second radiosonde campaign, and for the ith routine off-campaign measurement run, one uses an intermediate value of L obtained by simple linear time interpolation between L(sub 1) and L(sub 2).

Leblanc, Thierry↗
NASA NTRS2020

Recommendations for Using Noise Monitors to Estimate Noise Exposure During X-59 Community Tests

A low fidelity simulation approach is used to explore how to place and use noise monitors during X-59 QueSST community tests, where people’s annoyance to the noise produced by the X-59 aircraft will be gathered. Several recommendations are provided including: 1) the desired number of sparsely spaced noise monitor sites within the survey area, 2) whether to group and average measurements across multiple noise monitors located at a site, 3) what spacing should be used if grouped noise monitors are used, 4) an approach to mitigate ambient noise contamination at the measurement sites, 5) a method to combine empirical and predicted dose estimates to provide a single dose estimate for respondents, and 6) assessing how changes in turbulence intensity and array configuration affect dose uncertainty. To make these recommendations, the error that is expected when fitting contrived, smoothly varying sonic boom “reference exposure surfaces” is studied when a spatially sparse and scattered set of samples is used as responses for the fit. The reference exposure surfaces mimic the sonic boom exposure at ground level that might be expected in the X-59 survey area in the absence of atmospheric turbulence, ambient noise, and other localized effects. The spatial extent of these surfaces varies and is representative of the different survey area sizes that might be expected during future X-59 community overflight tests. These contrived reference surfaces are sampled, and those reference samples are then perturbed to mimic atmospheric turbulence, ambient noise and other localized effects that might affect noise monitor measurements within overflown communities. Two different surface fitting methods are investigated when fitting these perturbed samples to approximate the reference surface. The first method uses interpolation between the perturbed data at the scattered sites to compute the fit. The second method fits a polynomial surface model to the perturbed data using ordinary least squares regression analysis. For both fitting methods, the root mean square fit error is computed from the pointwise difference between the fit surface and the reference surface as the count and configuration of the sites is varied while also averaging the error across many different realizations of both the smooth variation of the reference exposure surface and the random, localized perturbations at the sample sites. Different site configurations are compared using this error statistic to make the recommendations noted above. Additionally, the two fitting approaches (interpolation vs linear regression) are compared based on the fit error observed in these simulations. These analyses, comparisons, and recommendations should inform future decisions on the noise monitor placement and the methods used to analyze the noise monitor data that is collected during X-59 community overflights.

sonic boom↗
DOE OSTI2021

A method for convex black-box integer global optimization

Here we study the problem of minimizing a convex function on a nonempty, finite subset of the integer lattice when the function cannot be evaluated at noninteger points. We propose a new underestimator that does not require access to (sub)gradients of the objective; such information is unavailable when the objective is a blackbox function. Rather, our underestimator uses secant linear functions that interpolate the objective function at previously evaluated points. These linear mappings are shown to underestimate the objective in disconnected portions of the domain. Therefore, the union of these conditional cuts provides a nonconvex underestimator of the objective. We propose an algorithm that alternates between updating the underestimator and evaluating the objective function. We prove that the algorithm converges to a global minimum of the objective function on the feasible set. We present two approaches for representing the underestimator and compare their computational effectiveness. We also compare implementations of our algorithm with existing methods for minimizing functions on a subset of the integer lattice. We discuss the difficulty of this problem class and provide insights into why a computational proof of optimality is challenging even for moderate problem sizes.

97 MATHEMATICS AND COMPUTING↗