Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIAL”

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 1,765 records · Page 98

Induced Gravity Models with Exact Bounce Solutions

We study dynamics of induced gravity cosmological models with the sixth-degree polynomial potentials, that have been constructed using the superpotential method. We find conditions on the potential under which exact bounce solutions exist and study the stability of these solutions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multi-Loop Techniques for Massless Feynman Diagram Calculations

We review several multi-loop techniques for analytical massless Feynman diagram calculations in relativistic quantum field theories: integration by parts, the method of uniqueness, functional equations and the Gegenbauer polynomial technique. A brief, historically oriented, overview of some of the results obtained over the decades for the massless 2-loop propagator-type diagram is given. Concrete examples of up to 5-loop diagram calculations are also provided.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Determining the Concentration of Free Electrons in n-InSb from Far-Infrared Reflectance Spectra with Allowance for Plasmon–Phonon Coupling

Contactless nondestructive testing is a means for determining the concentration of free electrons N in indium antimonide (InSb) samples from far-infrared reflectance spectra recorded at room temperature. A computer program capable of determining the characteristic wave number from the Kramers–Kronig relation is developed. The calculated calibration dependence makes it possible to determine the electron concentration from the known characteristic wave number. It is shown that this dependence is described by a cubic polynomial. In the calculations, the energy dependence of the electron effective mass is taken into account. It is established that, in determining the electron concentration, account must be taken of plasmon–phonon coupling, specifically at N ≤ 5 × 10{sup 17} cm{sup –3}. The systematic error introduced into the determination of N by disregard of plasmon–phonon coupling is estimated. The software elaborated here makes it possible to calculate the electron concentration N from experimental reflectance spectra and to store and process the results. The software is tested by the example of the reflectance spectrum of heavily doped n-InSb.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Critical Temperature of the Three-Vertex Potts Model on a Kagome Lattice

The Potts model on a Kagome lattice is considered. The Monte Carlo method is used to obtain the temperature dependences of the thermodynamic parameters: heat capacity C, order parameter m, and susceptibility χ. The calculations were performed for systems with periodic boundary conditions. Systems with linear dimensions L × L = N, L = 20–90, were considered. Based on the fourth-order Binder cumulant method, the critical temperature (T{sub c}) was calculated for the three-vertex Potts model on a Kagome lattice. It is shown that the obtained value of T{sub c}, within the statistical error, is in good agreement with the results obtained by the transfer matrix and polynomial approximation methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

High-Temperature Heat Capacity and Thermal Extension of FeTa{sub 2}O{sub 6}

The heat capacity of synthesized iron tantalate FeTa{sub 2}O{sub 6} was measured in the temperature range of 323–1103 K by the ratio method using a thermal analyzer combining thermogravimetry and scanning calorimetry. The temperatures of phase transformations were determined. Structural changes and thermal expansion of oxide were studied in the range of 300–1173 K by high-temperature X-ray diffraction. The temperature dependences of the unit cell parameters were approximated by third order polynomials. The values of thermal expansion coefficients and anisotropy factors were calculated based on the obtained data.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Discontinuous Finite Elements for a Hyperbolic Problem with Singular Coefficient: a Convergence Theory for 1-D Spherical Neutron Transport

A theory of convergence is presented for the discontinuous Galerkin finite element method of solving the non-scattering spherically symmetric Boltzmann transport equation using piecewise constant test and trial functions. Results are then extended to higher order polynomial spaces. Comparisons of numerical properties were presented in earlier work.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantifying sampling noise and parametric uncertainty in atomistic-to-continuum simulations using surrogate models

We present a methodology to assess the predictive fidelity of multiscale simulations by incorporating uncertainty in the information exchanged between the components of an atomistic-to-continuum simulation. We account for both the uncertainty due to finite sampling in molecular dynamics (MD) simulations and the uncertainty in the physical parameters of the model. Using Bayesian inference, we represent the expensive atomistic component by a surrogate model that relates the long-term output of the atomistic simulation to its uncertain inputs. We then present algorithms to solve for the variables exchanged across the atomistic-continuum interface in terms of polynomial chaos expansions (PCEs). We also consider a simple Couette flow where velocities are exchanged between the atomistic and continuum components, while accounting for uncertainty in the atomistic model parameters and the continuum boundary conditions. Results show convergence of the coupling algorithm at a reasonable number of iterations. As a result, the uncertainty in the obtained variables significantly depends on the amount of data sampled from the MD simulations and on the width of the time averaging window used in the MD simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Method of Analytic Evolution of Flat Distribution Amplitudes in QCD

A new analytical method of performing ERBL evolution is described. The main goal is to develop an approach that works for distribution amplitudes that do not vanish at the end points, for which the standard method of expansion in Gegenbauer polynomials is inefficient. Two cases of the initial DA are considered: a purely flat DA, given by the same constant for all x, and an antisymmetric DA given by opposite constants for x < 1/2 or x > 1/2. For a purely flat DA, the evolution is governed by an overall (x (1-x)){sup t} dependence on the evolution parameter t times a factor that was calculated as an expansion in t. For an antisymmetric flat DA, an extra overall factor |1-2x|{sup 2t} appears due to a jump at x = 1/2. A good convergence was observed in the t {approx}< 1/2 region. For larger t, one can use the standard method of the Gegenbauer expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The price of privately releasing contingency tables, and the spectra of random matrices with correlated rows

Contingency tables are the method of choice of government agencies for releasing statistical summaries of categorical data. In this paper, we consider lower bounds on how much distortion (noise) is necessary in these tables to provide privacy guarantees when the data being summarized is sensitive. We extend a line of recent work on lower bounds on noise for private data analysis [10, 13. 14, 15] to a natural and important class of functionalities. Our investigation also leads to new results on the spectra of random matrices with correlated rows. Consider a database D consisting of n rows (one per individual), each row comprising d binary attributes. For any subset of T attributes of size |T| = k, the marginal table for T has 2{sup k} entries; each entry counts how many times in the database a particular setting of these attributes occurs. Imagine an agency that wishes to release all (d/k) contingency tables for a given database. For constant k, previous work showed that distortion {tilde {Omicron}}(min{l_brace}n, (n{sup 2}d){sup 1/3}, {radical}d{sup k}{r_brace}) is sufficient for satisfying differential privacy, a rigorous definition of privacy that has received extensive recent study. Our main contributions are: (1) For {epsilon}- and ({epsilon}, {delta})-differential privacy (with {epsilon} constant and {delta} = 1/poly(n)), we give a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}), which is tight for n = {tilde {Omega}}(d{sup k}). Moreover, for a natural and popular class of mechanisms based on additive noise, our bound can be strengthened to {Omega}({radical}d{sup k}), which is tight for all n. Our bounds extend even to non-constant k, losing roughly a factor of {radical}2{sup k} compared to the best known upper bounds for large n. (2) We give efficient polynomial time attacks which allow an adversary to reconstruct sensitive infonnation given insufficiently perturbed contingency table releases. For constant k, we obtain a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}) that applies to a large class of privacy notions, including K-anonymity (along with its variants) and differential privacy. In contrast to our bounds for differential privacy, this bound (a) is shown only for constant k, but (b) is tight for all values of n when k is constant. (3) Our reconstruction-based attacks require a new lower bound on the least singular values of random matrices with correlated rows. For a constant k, consider a matrix M with (d/k) rows which are formed by taking all possible k-way entry-wise products of an underlying set of d random vectors. We show that even for nearly square matrices with d{sup k}/log d columns, the least singular value is {Omega}({radical}d{sup k}) with high probability - asymptotically, the same bound as one gets for a matrix with independent rows. The proof requires several new ideas for analyzing random matrices and could be of independent interest.

97 MATHEMATICS AND COMPUTING↗

Coarse-Grained Clustering Dynamics of Heterogeneously Coupled Neurons

The formation of oscillating phase clusters in a network of identical Hodgkin–Huxley neurons is studied, along with their dynamic behavior. The neurons are synaptically coupled in an all-to-all manner, yet the synaptic coupling characteristic time is heterogeneous across the connections. In a network of N neurons where this heterogeneity is characterized by a prescribed random variable, the oscillatory single-cluster state can transition—through (possibly perturbed) period-doubling and subsequent bifurcations—to a variety of multiple-cluster states. The clustering dynamic behavior is computationally studied both at the detailed and the coarse-grained levels, and a numerical approach that can enable studying the coarse-grained dynamics in a network of arbitrarily large size is suggested. Among a number of cluster states formed, double clusters, composed of nearly equal sub-network sizes are seen to be stable; interestingly, the heterogeneity parameter in each of the double-cluster components tends to be consistent with the random variable over the entire network: Given a double-cluster state, permuting the dynamical variables of the neurons can lead to a combinatorially large number of different, yet similar “fine” states that appear practically identical at the coarse-grained level. For weak heterogeneity we find that correlations rapidly develop, within each cluster, between the neuron’s “identity” (its own value of the heterogeneity parameter) and its dynamical state. For single- and double-cluster states we demonstrate an effective coarse-graining approach that uses the Polynomial Chaos expansion to succinctly describe the dynamics by these quickly established “identity-state” correlations. This coarse-graining approach is utilized, within the equation-free framework, to perform efficient computations of the neuron ensemble dynamics.

97 MATHEMATICS AND COMPUTING↗

Vision ray calibration for the quantitative geometric description of general imaging and projection optics in metrology

Exact geometric calibration of optical devices like projectors or cameras is the basis for utilizing them in quantitative metrological applications. The common state-of-the-art photogrammetric pinhole-imaging-based models with supplemental polynomial corrections fail in the presence of nonsymmetric or high-spatial-frequency distortions and in describing caustics efficiently. These problems are solved by our vision ray calibration (VRC), which is proposed in this paper. The VRC takes an optical mapping system modeled as a black box and directly delivers corresponding vision rays for each mapped pixel. The underlying model, the calibration process, and examples are visualized and reviewed, demonstrating the potential of the VRC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty quantification for large-scale ocean circulation predictions.

Uncertainty quantificatio in climate models is challenged by the sparsity of the available climate data due to the high computational cost of the model runs. Another feature that prevents classical uncertainty analyses from being easily applicable is the bifurcative behavior in the climate data with respect to certain parameters. A typical example is the Meridional Overturning Circulation in the Atlantic Ocean. The maximum overturning stream function exhibits discontinuity across a curve in the space of two uncertain parameters, namely climate sensitivity and CO{sub 2} forcing. We develop a methodology that performs uncertainty quantificatio in the presence of limited data that have discontinuous character. Our approach is two-fold. First we detect the discontinuity location with a Bayesian inference, thus obtaining a probabilistic representation of the discontinuity curve location in presence of arbitrarily distributed input parameter values. Furthermore, we developed a spectral approach that relies on Polynomial Chaos (PC) expansions on each sides of the discontinuity curve leading to an averaged-PC representation of the forward model that allows efficient uncertainty quantification and propagation. The methodology is tested on synthetic examples of discontinuous data with adjustable sharpness and structure.

54 ENVIRONMENTAL SCIENCES↗

Mesh2d Grid Generator Design and Use

Mesh2d is a Fortran90 program designed to generate two-dimensional structured grids of the form [x(i),y(i,j)] where [x,y] are grid coordinates identified by indices (i,j). The x(i) coordinates alone can be used to specify a one-dimensional grid. Because the x-coordinates vary only with the i index, a two-dimensional grid is composed in part of straight vertical lines. However, the nominally horizontal y(i,j 0 ) coordinates along index i are permitted to undulate or otherwise vary. Mesh2d also assigns an integer material type to each grid cell, mtyp(i,j), in a user-specified manner. The complete grid is specified through three separate input files defining the x(i), y(i,j), and mtyp(i,j) variations. The overall mesh is constructed from grid zones that are typically then subdivided into a collection of smaller grid cells. The grid zones usually correspond to distinct materials or larger-scale geometric shapes. The structured grid zones are identified through uppercase indices (I,J). Subdivision of zonal regions into grid cells can be done uniformly, or nonuniformly using either a polynomial or geometric skewing algorithm. Grid cells may be concentrated backward, forward, or toward both ends. Figure 1 illustrates the above concepts in the context of a simple four zone grid.

97 MATHEMATICS AND COMPUTING↗

Volume and surface area of a spherical harmonic surface approximation to a NIF implosion core defined by HGXI/GXD images from the equator and pole

A solid object, such as a simplified approximation to an implosion core defined by the 17% intensity contour, can be described by a sum of spherical harmonics, following the notation of Butkov (Mathematical Physics, ISBN 0-201-00727-4, 1968; there are other notations so care is required), with Pl(x) being the usual (apparently standard) Legendre polynomial. For the present purposes, finding the volume and surface area of an implosion core defined by P0, P2, P4, M0, and M4, I will restrict the problem to consider only A 00 , A 20 , A 40 , and A 44 , with the phase angle set to eliminate the sin(mΦ) term. Once the volume and surface area are determined, I will explore how these coefficients relate to measured quantities A0, A2/A0, A4/A0, M0, and M4/M0.

36 MATERIALS SCIENCE↗

Implementation of DOWTHERM A Properties into RELAP5-3D/ATHENA

DOWTHERM A oil is being considered for use as a heat transfer fluid in experiments to help in the design of heat transfer components for the Next Generation Nuclear Plant (NGNP). In conjection with the experiments RELAP5-3D/ATHENA will be used to help design and analyzed the data generated by the experiments. Inorder to use RELAP5-3D the thermophysical properties of DOWTHERM A were implemented into the fluids package of the RELAP5-3D/ATHENA computer propgram. DOWTHERM A properties were implemented in RELAP5-3D/ATHENA using thermophysical property data obtain from a Dow Chemical Company brochure. The data were curve fit and the polynomial equations developed for each required property were input into a fluid property generator. The generated data was then compared to the orginal DOWTHERM A data to verify that the fluid property data generated by the RELAP5-3D/ATHENA code was representitive of the original input data to the generator.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Parallel Algorithms for Graph Optimization Using Tree Decompositions

Although many $\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

99 GENERAL AND MISCELLANEOUS↗

Theoretical Chemical Dynamics Studies of Elementary Combustion Reactions

The objective of this research was to develop and apply methods for more accurate predictions of reaction rates based on high-level quantum chemistry. We have developed and applied efficient, robust methods for fitting global ab initio potential energy surfaces (PESs) for both spectroscopy and dynamics calculations and for performing direct dynamics simulations. Our approach addresses the problem that high-level quantum calculations are often too costly in computer time for practical applications resulting in the use of levels of theory that are often inadequate for reactions. A critical objective was to develop practical methods that require the minimum number of electronic structure calculations for acceptable fidelity to the ab initio PES. Our method does this by a procedure that determines the optimal configurations at which ab initio points are computed, and that ensures that the final fitted PES is uniformly accurate to a prescribed tolerance. Our fitting methods can be done automatically, with little or no human intervention, and with no prior knowledge of the topology of the PES. The methods are based on local fitting schemes using interpolating moving least-squares (IMLS). IMLS has advantages over the very effective modified-Shepard methods developed by Collins and others in that higher-order polynomials can be used and does not require derivatives but can benefit from them if available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mathematical and Computational Tools for Predictive Simulation of Complex Coupled Systems under Uncertainty

Methods and algorithms are developed to enable the accurate analysis of problems that exhibit interacting physical processes with uncertainties. These uncertainties can pertain either to each of the physical processes or to the manner in which they depend on each others. These problems are cast within a polynomial chaos framework and their solution then involves either solving a large system of algebraic equations or a high dimensional numerical quadrature. In both cases, the curse of dimensionality is manifested. Procedures are developed for the efficient evaluation of the resulting linear equations that advantage of the block sparse structure of these equations, resulting in a block recursive Schur complement construction. In addition, embedded quadratures are constructed that permit the evaluation of very high-dimensional integrals using low-dimensional quadratures adapted to particular quantities of interest. The low-dimensional integration is carried out in a transformed measure space in which the quantity of interest is low-dimensional. Finally, a procedure is also developed to discover a low-dimensional manifold, embedded in the initial high-dimensional one, in which scalar quantities of interest exist. This approach permits the functional expression of the reduced space in terms of the original space, thus permitting cross-scale sensitivity analysis.

97 MATHEMATICS AND COMPUTING↗