Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Polynomial 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.

208 records · Page 12

An adaptive interpolator algorithm for area-array fine guiance sensors

The present paper provides a description of recent and continuing work related to the development of tracking systems possessing artificial intelligence. It is pointed out that artificial intelligence is being used to provide trackers with the abilities to sense environmental changes which can affect tracker performance, to optimize tracker performance in a changing environment, and to report on the accuracy and stability of the pointing data. The implementation of artificial intelligence in tracking systems is based on the use of adaptive algorithms which correct for tracking errors by applying polynomial corrections to raw tracking output data. The basic operation of a centroid tracking system is discussed, taking into account the limitations on accuracy and stability which exist in the absence of intelligence. Attention is given to the correction method and the implementation of artificial intelligence to improve tracking.

Glavich, T. A.↗

Conservative discontinuous Galerkin interpolation: Sheared boundary conditions

Local studies of accretion disks and laboratory magnetized plasmas employ analytical coordinate mappings that introduce sheared boundary conditions (BCs). Here, we present a discontinuous Galerkin (DG) algorithm to apply such BCs based on projections and quadrature-free integration. The procedure is high-order accurate, preserves moments exactly and works in multiple dimensions. Tests of increasing complexity are provided, beginning with translations of one and two dimensional fields, followed by 3D and 5D simulations with sheared (twist-shift) BCs. Results show that the algorithm is (p + 1)-order accurate in the DG representation and (p + 2) -order accurate in the cell averages, with p being the order of the polynomial basis. Quantification of the algorithm's hyperdiffusion and discussion of aliasing errors are given. This technique enables conservative local simulations of plasma turbulence with DG, not possible until now.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods (Final Report)

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. As compared with the previous work, the novelty of our method is that the diffusion equation is solved on a coarse-mesh grid using the DG methods, and the DG diffusion discretization incorporates local hp adaptation, i.e., local adaptation of mesh size and/or polynomial degree, based on local total cross section (or optical thickness). Therefore, the resulting number of degrees of freedom (DOF) of the DG discretization is much less than the conventional consistent DSA discretizations, and thus DG-DSA can achieve significant improvement in computational efficiency. We implemented this scheme in PROTEUS-SN. In addition, we developed a new stabilization scheme named linear prolongation CMFD (lpCMFD). A novel feature of this scheme is that the conventional flat flux ratio–based scaling approach is replaced with a linear interpolation of the scalar flux differences at the coarse-mesh cell edges between the neutron transport and CMFD calculations. Fourier convergence analysis and numerical results show that lpCMFD is unconditionally stable and more effective than other CMFD based on acceleration schemes such as pCMFD, odCMFD. We also developed a new nonlinear diffusion acceleration scheme for solving neutron transport equations. This scheme, called LR-NDA, employs a local refinement approach on the framework of CMFD by solving a local boundary value problem of the scalar flux on the coarse-mesh structure to replace the piecewise constant scalar flux obtained by CMFD. The refined flux is then used to update the scalar flux in the neutron transport source iteration. It has been demonstrated that that LR-NDA is much more effective and stable than CMFD for a wide range of optical thicknesses. LR-NDA is a local adaptive method, which means LR-NDA does not necessarily require local refinement for all the coarse-mesh cells on the problem domain, i.e., it can be used only for relatively optically thick regions where the standard CMFD scheme would encounter the convergence problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Relativistic theory of the Jahn-Teller effect: p-orbitals in tetrahedral and trigonal systems

A relativistic generalization of Jahn-Teller theory is presented which includes spin-orbit coupling effects beyond low-order Taylor expansions in vibrational coordinates. For the example of a p-electron in tetrahedral and trigonal environments, the matrix elements of the Breit-Pauli spin-orbit-coupling operator are expressed in terms of the matrix elements of the electrostatic electronic potential. Employing expansions of the latter in invariant polynomials in symmetry-adapted nuclear coordinates, the spin-orbit induced Jahn-Teller coupling terms are derived for the T{sub 2} × (t{sub 2} + e) and (E + A) × (e + a) Jahn-Teller problems up to arbitrarily high orders. The linear G{sub 3/2} × (t{sub 2} + e) Jahn-Teller Hamiltonian of Moffitt and Thorson [Phys. Rev. 108, 1251 (1957)] for tetrahedral systems is generalized to higher orders in vibrational displacements. The Jahn-Teller Hamiltonians derived in the present work are useful for the interpolation and extrapolation of Jahn-Teller distorted potential-energy surfaces of molecules and complexes with heavy elements as well as for the calculation of vibronic spectra of such systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

B-spline Method in Fluid Dynamics

B-spline functions are bases for piecewise polynomials that possess attractive properties for complex flow simulations : they have compact support, provide a straightforward handling of boundary conditions and grid nonuniformities, and yield numerical schemes with high resolving power, where the order of accuracy is a mere input parameter. This paper reviews the progress made on the development and application of B-spline numerical methods to computational fluid dynamics problems. Basic B-spline approximation properties is investigated, and their relationship with conventional numerical methods is reviewed. Some fundamental developments towards efficient complex geometry spline methods are covered, such as local interpolation methods, fast solution algorithms on cartesian grid, non-conformal block-structured discretization, formulation of spline bases of higher continuity over triangulation, and treatment of pressure oscillations in Navier-Stokes equations. Application of some of these techniques to the computation of viscous incompressible flows is presented.

Botella, Olivier↗

A simple method for obtaining heat capacity coefficients of minerals

Abstract Heat capacity data are unavailable or incomplete for many minerals at geologically relevant temperatures. Despite the availability of entropy and enthalpy values in numerous thermodynamic tables (even sometimes at elevated temperatures), there remains need for extrapolation beyond, or interpolation between, temperatures. This approach inevitably results in estimates for entropy and enthalpy values because the heat capacity coefficients required for optimal thermodynamic treatment are less frequently available. Here we propose a simple method for obtaining heat capacity coefficients of minerals. This method requires only the empirically measured temperature-specific heat capacity for calculation via a matrix algorithm. The system of equations solver is written in the Python computing language and has been made accessible in an online repository. Thermodynamically, the solution to a system of equations represents the heat capacity coefficients that satisfy the mineral-specific polynomial. Direct coefficient calculation will result in more robust thermodynamic data, which are not subject to fitting uncertainties. Using hematite as an example, this method provides results that are comparable to conventional means and is applicable to any solid material. Coefficients vary within the traditional large 950 K temperature interval, indicating that best results should instead utilize a smaller 400 K temperature interval. Examples of large-scale implications include the refinement of geothermal gradient estimation in rapidly subsiding sedimentary basins or metamorphic and hydrothermal evolution.

Geochemistry & Geophysics↗

Characterization of the Crab Pulsar's Timing Noise

We present a power spectral analysis of the Crab pulsar's timing noise, mainly using radio measurements from Jodrell Bank taken over the period 1982-1989, an interval bounded by sparse data sampling and a large glitch. The power spectral analysis is complicated by nonuniform data sampling and the presence of a steep red power spectrum that can distort power spectra measurement by causing severe power 'leakage'. We develop a simple windowing method for computing red noise power spectra of uniformly sampled data sets and test it on Monte Carlo generated sample realizations of red power-law noise. We generalize time-domain methods of generating power-law red noise with even integer spectral indices to the case of noninteger spectral indices. The Jodrell Bank pulse phase residuals are dense and smooth enough that an interpolation onto a uniform time series is possible. A windowed power spectrum is computed revealing a periodic or nearly periodic component with a period of 568 +/- 10 days and a l/f(exp 3) power-law noise component in pulse phase with a noise strength S(sub infinity)=(1.24 +/- 0.067) x 10(exp 16) cycles(exp 2)/sec(exp 2) over the analysis frequency range f=0.003- 0.1 cycles/day. This result deviates from past analyses which characterized the pulse phase timing residuals as either l/f(sub 4) power-law noise or a quasiperiodic process. The analysis was checked using the Deeter polynomial method of power spectrum estimation that was developed for the case of nonuniform sampling, but has lower spectral resolution. The timing noise is consistent with a torque noise spectrum rising with analysis frequency as f implying blue torque noise, a result not predicted by current models of pulsar timing noise. If the periodic or nearly periodic component is due to a binary companion, we find a mass function f(M) = (6.8 +/- 2.4) x 10(exp -16) solar mass and a companion mass, M(sub c) is greater than or equal to 3.2 solar mass assuming a Crab pulsar mass of 1.4 solar mass.

Scott, D. M.↗

Method of and apparatus for generating an interstitial point in a data stream having an even number of data points

Apparatus for doubling the data density rate of an analog to digital converter or doubling the data density storage capacity of a memory deviced is discussed. An interstitial data point midway between adjacent data points in a data stream having an even number of equal interval data points is generated by applying a set of predetermined one-dimensional convolute integer coefficients which can include a set of multiplier coefficients and a normalizer coefficient. Interpolator means apply the coefficients to the data points by weighting equally on each side of the center of the even number of equal interval data points to obtain an interstital point value at the center of the data points. A one-dimensional output data set, which is twice as dense as a one-dimensional equal interval input data set, can be generated where the output data set includes interstitial points interdigitated between adjacent data points in the input data set. The method for generating the set of interstital points is a weighted, nearest-neighbor, non-recursive, moving, smoothing averaging technique, equivalent to applying a polynomial regression calculation to the data set.

Edwards, T. R.↗

Multi Objective Controller Design for Linear System via Optimal Interpolation

We propose a methodology for the design of a controller which satisfies a set of closed-loop objectives simultaneously. The set of objectives consists of: (1) pole placement, (2) decoupled command tracking of step inputs at steady-state, and (3) minimization of step response transients with respect to envelope specifications. We first obtain a characterization of all controllers placing the closed-loop poles in a prescribed region of the complex plane. In this characterization, the free parameter matrix Q(s) is to be determined to attain objectives (2) and (3). Objective (2) is expressed as determining a Pareto optimal solution to a vector valued optimization problem. The solution of this problem is obtained by transforming it to a scalar convex optimization problem. This solution determines Q(O) and the remaining freedom in choosing Q(s) is used to satisfy objective (3). We write Q(s) = (l/v(s))bar-Q(s) for a prescribed polynomial v(s). Bar-Q(s) is a polynomial matrix which is arbitrary except that Q(O) and the order of bar-Q(s) are fixed. Obeying these constraints bar-Q(s) is now to be 'shaped' to minimize the step response characteristics of specific input/output pairs according to the maximum envelope violations. This problem is expressed as a vector valued optimization problem using the concept of Pareto optimality. We then investigate a scalar optimization problem associated with this vector valued problem and show that it is convex. The organization of the report is as follows. The next section includes some definitions and preliminary lemmas. We then give the problem statement which is followed by a section including a detailed development of the design procedure. We then consider an aircraft control example. The last section gives some concluding remarks. The Appendix includes the proofs of technical lemmas, printouts of computer programs, and figures.

Ozbay, Hitay↗

Preliminary subsonic aerodynamic model for simulation studies of the HL-20 lifting body

A nonlinear, six-degree-of-freedom aerodynamic model for an early version of the HL-20 lifting body is described and compared with wind tunnel data upon which it is based. Polynomial functions describing most of the aerodynamic parameters are given and tables of these functions are presented. Techniques used to arrive at these functions are described. Basic aerodynamic coefficients were modeled as functions of angles of attack and sideslip. Vehicle lateral symmetry was assumed. Compressibility (Mach) effects were ignored. Control-surface effectiveness was assumed to vary linearly with angle of deflection and was assumed to be invariant with the angle of sideslip. Dynamic derivatives were obtained from predictive aerodynamic codes. Landing-gear and ground effects were scaled from Space Shuttle data. The model described is provided to support pilot-in-the-loop simulation studies of the HL-20. By providing the data in tabular format, the model is suitable for the data interpolation architecture of many existing engineering simulation facilities. Because of the preliminary nature of the data, however, this model is not recommended for study of the absolute performance of the HL-20.

Jackson, E. Bruce↗