Search NASA⌕ Search

SEARCH · Search NASA

Results for “interpolating methods”

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

Computation of three-dimensional nozzle-exhaust flow fields with the GIM code

A methodology is introduced for constructing numerical analogs of the partial differential equations of continuum mechanics. A general formulation is provided which permits classical finite element and many of the finite difference methods to be derived directly. The approach, termed the General Interpolants Method (GIM), can combined the best features of finite element and finite difference methods. A quasi-variational procedure is used to formulate the element equations, to introduce boundary conditions into the method and to provide a natural assembly sequence. A derivation is given in terms of general interpolation functions from this procedure. Example computations for transonic and supersonic flows in two and three dimensions are given to illustrate the utility of GIM. A three-dimensional nozzle-exhaust flow field is solved including interaction with the freestream and a coupled treatment of the shear layer. Potential applications of the GIM code to a variety of computational fluid dynamics problems is then discussed in terms of existing capability or by extension of the methodology.

Spradley, L. W.↗

Application Of Prony's Method To Data On Viscoelasticity

Prony coefficients found by computer program, without trial and error. Computational method and computer program developed to exploit full potential of Prony's interpolation method in analysis of experimental data on relaxation modules of viscoelastic material. Prony interpolation curve chosen to give least-squares best fit to "B-spline" interpolation of experimental data.

Rodriguez, Pedro I.↗

Interlaminar Stresses by Refined Beam Theories and the Sinc Method Based on Interpolation of Highest Derivative

Computation of interlaminar stresses from the higher-order shear and normal deformable beam theory and the refined zigzag theory was performed using the Sinc method based on Interpolation of Highest Derivative. The Sinc method based on Interpolation of Highest Derivative was proposed as an efficient method for determining through-the-thickness variations of interlaminar stresses from one- and two-dimensional analysis by integration of the equilibrium equations of three-dimensional elasticity. However, the use of traditional equivalent single layer theories often results in inaccuracies near the boundaries and when the lamina have extremely large differences in material properties. Interlaminar stresses in symmetric cross-ply laminated beams were obtained by solving the higher-order shear and normal deformable beam theory and the refined zigzag theory with the Sinc method based on Interpolation of Highest Derivative. Interlaminar stresses and bending stresses from the present approach were compared with a detailed finite element solution obtained by ABAQUS/Standard. The results illustrate the ease with which the Sinc method based on Interpolation of Highest Derivative can be used to obtain the through-the-thickness distributions of interlaminar stresses from the beam theories. Moreover, the results indicate that the refined zigzag theory is a substantial improvement over the Timoshenko beam theory due to the piecewise continuous displacement field which more accurately represents interlaminar discontinuities in the strain field. The higher-order shear and normal deformable beam theory more accurately captures the interlaminar stresses at the ends of the beam because it allows transverse normal strain. However, the continuous nature of the displacement field requires a large number of monomial terms before the interlaminar stresses are computed as accurately as the refined zigzag theory.

Slemp, Wesley C. H.↗

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↗

Finite element solvers for incompressible fluid flows and heat transfer

Two different finite-element solvers for incompressible viscous flow, i.e., the mixed interpolation method and the SIMPLE-type iterative method, are compared and tested with some benchmark problems. The advantages of the SIMPLE-type iterative method are the decoupling of the governing equations and the use of equal-order interpolation functions for both velocity and pressure. Even though there is a significant difference between the two methods in terms of the pressure field, similar solutions are obtained for the velocity field.

Sohn, Jeong L.↗

Paradigmatic error calculations for adaptive finite element approximations of convection dominated flows

New error estimation techniques are described for two-dimensional convection-dominated flows. Examples of applications to linear convection problems are given. The methods are based on discontinuous finite-element techniques. Results show that conventional interpolation methods may lead to gross underestimates of actual error and be inadequate for use in adaptive methods.

Oden, J. T.↗

Collocation methods for nonlinear differential equations on low-rank manifolds

We introduce new methods for integrating nonlinear differential equations on low-rank manifolds. These methods rely on interpolatory projections onto the tangent space, enabling low-rank time integration of vector fields that can be evaluated entry-wise. A key advantage of our approach is that it does not require the vector field to exhibit low-rank structure, thereby overcoming significant limitations of traditional dynamical low-rank methods based on orthogonal projection. To construct the interpolatory projectors, we develop a sparse tensor sampling algorithm based on the discrete empirical interpolation method (DEIM) that parameterizes tensor train manifolds and their tangent spaces with cross interpolation. Using these projectors, we propose two time integration schemes on low-rank tensor train manifolds. The first scheme integrates the solution at selected interpolation indices and constructs the solution with cross interpolation. The second scheme generalizes the well-known orthogonal projector-splitting integrator to interpolatory projectors. We demonstrate the proposed methods with applications to several tensor differential equations arising from the discretization of partial differential equations.

97 MATHEMATICS AND COMPUTING↗

Virtual zone Navier-Stokes computations for oscillating control surfaces

A new zoning method called 'virtual zones' has been developed for application to an unsteady finite difference Navier-Stokes code. The virtual zoning method simplifies the zoning and gridding of complex configurations for use with patched multi-zone flow codes. An existing interpolation method has been extensively modified to bring the run time for the interpolation procedure down to the same level as for the flow solver. Unsteady Navier-Stokes computations have been performed for transonic flow over a clipped delta wing with an oscillating control surface. The computed unsteady pressure and response characteristics of the control-surface motion compare well with experimental data.

Klopfer, G. H.↗

On the applications of algebraic grid generation methods based on transfinite interpolation

Algebraic grid generation methods based on transfinite interpolation called the two-boundary and four-boundary methods are applied for generating grids with highly complex boundaries. These methods yield grid point distributions that allow for accurate application to regions of sharp gradients in the physical domain or time-dependent problems with small length scale phenomena. Algebraic grids are derived using the two-boundary and four-boundary methods for applications in both two- and three-dimensional domains. Grids are developed for distinctly different geometrical problems and the two-boundary and four-boundary methods are demonstrated to be applicable to a wide class of geometries.

Nguyen, Hung Lee↗

Derivation of Effective Properties Based on Porous Scale Simulations Using Filtering Techniques

This study presents a method for derivation of effective properties at the interface and in-depth of porous materials. The method defines a Representative Elementary Volume (REV) and applies filtering techniques to computer effective properties such as porosity and flow quantities, such as velocity and pressure. The script, developed to process the data was tested on the VTK type files that contain the mesh information and the flow solution. The method allows to choose between two types of filters, such as cellular and top-hat and define the size of the REV and number of samples along the domain. Extraction of the REV from the domain is performed to exact boundaries requested for the user. This is done using a triangulation technique and cutting through the cells to comply to the requested boundaries of the volume. The method can be applied to both structured and unstructured meshes. Filtering the material porosity and flow quantities involves integration of the numerical data. The algorithm provides three integration methods, such as Riemann sum, Monte Carlo and Quadrature rule to perform the integration. The Monte-Carlo technique permits the use of either uniform or linearly spaced distribution of points. The Quadrature rule is currently applicable to tetrahedral element types. The Monte Carlo and Quadrature rule methods require interpolation of the flow quantities at the sample points. For interpolation, two methods were tested and are readily available, Gaussian interpolation and re-sampling. It has been shown that re-sampling method has better consistency and acceptable accuracy in interpolation of the data. The algorithm was written in Python language and uses a number of modules. The major module besides numpy is PyVista. It is used to process the computational domain, clip the REV and interpolate the data. Quadrature rule integration was performed using a quadpy module. ParaView software was used externally to convert the flow solution to the VTK (or more specifically VTU) format. Integration of ParaView in the same environment with PyVista encountered problems and could not be implemented in this work. The developed algorithm is expected to be applicable to unstructured meshes and more complex porous structures as soon as the data can be passed in VTK type format. With the report is provided Python script for filtering the solution and a Matlab script for simple generation and processing of 2-D and 3-D porous channel geometries. The two scripts don't communicate.

Alexsander Zibitsker↗

Development of a four-dimensional variational analysis system using the adjoint method at GLA. I - Dynamics

Recent developments in the field of data assimilation have pointed to variational analysis (essentially least-squares fitting of a model solution to observed data) using the adjoint method as a new direction that holds the potential of major improvements over the current optimal interpolation method. This paper describes the initial effort in the development of a 4D variational analysis system. Although the development is based on the Goddard Laboratory for Atmospheres General Circulation Model (GCM), the methods and procedures described in this paper can be applied to any model. The adjoint code that computes the gradients needed in the analysis can be written directly from the GCM code. An easy error-detection technique was devised in the construction of the adjoint model. Also, a method of determining the weights and the preconditioning scales for the cases where model-generated data, which are error free, are used as observation is proposed. Two test experiments show that the dynamics part of the system has been successfully completed.

Chao, Winston C.↗

Quantitative analysis of the reconstruction performance of interpolants

The analysis presented provides a quantitative measure of the reconstruction or interpolation performance of linear, shift-invariant interpolants. The performance criterion is the mean square error of the difference between the sampled and reconstructed functions. The analysis is applicable to reconstruction algorithms used in image processing and to many types of splines used in numerical analysis and computer graphics. When formulated in the frequency domain, the mean square error clearly separates the contribution of the interpolation method from the contribution of the sampled data. The equations provide a rational basis for selecting an optimal interpolant; that is, one which minimizes the mean square error. The analysis has been applied to a selection of frequently used data splines and reconstruction algorithms: parametric cubic and quintic Hermite splines, exponential and nu splines (including the special case of the cubic spline), parametric cubic convolution, Keys' fourth-order cubic, and a cubic with a discontinuous first derivative. The emphasis in this paper is on the image-dependent case in which no a priori knowledge of the frequency spectrum of the sampled function is assumed.

Lansing, Donald L.↗

Monotone and convex quadratic spline interpolation

A method for producing interpolants that preserve the monotonicity and convexity of discrete data is described. It utilizes the quadratic spline proposed by Schumaker (1983) which was subsequently characterized by De Vore and Yan (1986). The selection of first order derivatives at the given data points is essential to this spline. An observation made by De Vore and Yan is generalized, and an improved method to select these derivatives is proposed. The resulting spline is completely local, efficient, and simple to implement.

Lam, Maria H.↗

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.

Memarsadeghi, Nargess↗

Reliable use of determinants to solve nonlinear structural eigenvalue problems efficiently

The analytical derivation, numerical implementation, and performance of a multiple-determinant parabolic interpolation method (MDPIM) for use in solving transcendental eigenvalue (critical buckling or undamped free vibration) problems in structural mechanics are presented. The overall bounding, eigenvalue-separation, qualified parabolic interpolation, accuracy-confirmation, and convergence-recovery stages of the MDPIM are described in detail, and the numbers of iterations required to solve sample plane-frame problems using the MDPIM are compared with those for a conventional bisection method and for the Newtonian method of Simpson (1984) in extensive tables. The MDPIM is shown to use 31 percent less computation time than bisection when accuracy of 0.0001 is required, but 62 percent less when accuracy of 10 to the -8th is required; the time savings over the Newtonian method are about 10 percent.

Williams, F. W.↗

A transient near to far field transformation method and verification benchmarking procedure

The numerical calculation of electromagnetic far fields in the time-domain requires a near to far field transformation (NTFF) method. While time-domain NTFF methods for popular finite-difference time-domain (FDTD) approaches are well established, there is little discourse on NTFF methods for finite-element time-domain (FETD) codes. Here, this work is concerned with the development of an NTFF method for the Empire FETD code, which utilizes curl and divergence conforming elements. This discretization presents a difficulty in obtaining the equivalent electric current for the NTFF. Straightforward finite element interpolation of the fields is shown to give poor accuracy. Alternative interpolation methods are recommended. An expanding magnetic quadrupole pulse benchmark problem, which is fully developed in the appendices, provides the basis for quantitative comparison.

FETD↗

Modeling and Simulation for Multi-Missions Space Exploration Vehicle

Asteroids and Near-Earth Objects [NEOs] are of great interest for future space missions. The Multi-Mission Space Exploration Vehicle [MMSEV] is being considered for future Near Earth Object missions and requires detailed planning and study of its Guidance, Navigation, and Control [GNC]. A possible mission of the MMSEV to a NEO would be to navigate the spacecraft to a stationary orbit with respect to the rotating asteroid and proceed to anchor into the surface of the asteroid with robotic arms. The Dynamics and Real-Time Simulation [DARTS] laboratory develops reusable models and simulations for the design and analysis of missions. In this paper, the development of guidance and anchoring models are presented together with their role in achieving mission objectives and relationships to other parts of the simulation. One important aspect of guidance is in developing methods to represent the evolution of kinematic frames related to the tasks to be achieved by the spacecraft and its robot arms. In this paper, we compare various types of mathematical interpolation methods for position and quaternion frames. Subsequent work will be on analyzing the spacecraft guidance system with different movements of the arms. With the analyzed data, the guidance system can be adjusted to minimize the errors in performing precision maneuvers.

Multi-Mission Space Exploration Vehicle [MMSEV]↗

Interpolation schemes in the control of systems with unknown dynamics

Time-delay control for systems with unknown dynamics involves estimations. In its present form, these estimations include not only the interpolation of a time-varying function but also its derivative between data points. Presently, the control law is reformulated, taking into account the computation delay. A window-shifting scheme is then devised to view n data points as they are sampled in order to perform the function estimation. At each new sampling time, the window shifts to include the new data point as well as the last n-1 points. Several interpolation methods are considered. These methods use data points from a sampled function to construct a polynomial estimate of the function. The control system performance was experimentally tested using a servosystem. The results show that a Newtonian interpolation provided best results when the computation time was 0.4 times the sampling period.

Youcef-Toumi, K.↗