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 757 records · Page 42
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Boltzmann equation solver adapted to emergent chemical non-equilibrium

We present a novel method to solve the spatially homogeneous and isotropic relativistic Boltzmann equation. We employ a basis set of orthogonal polynomials dynamically adapted to allow for emergence of chemical non-equilibrium. Two time dependent parameters characterize the set of orthogonal polynomials, the effective temperature T(t) and phase space occupation factor ϒ(t). In this first paper we address (effectively) massless fermions and derive dynamical equations for T(t) and ϒ(t) such that the zeroth order term of the basis alone captures the particle number density and energy density of each particle distribution. We validate our method and illustrate the reduced computational cost and the ability to easily represent final state chemical non-equilibrium by studying a model problem that is motivated by the physics of the neutrino freeze-out processes in the early Universe, where the essential physical characteristics include reheating from another disappearing particle component (e{sup ±}-annihilation)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

A well-posed and stable stochastic Galerkin formulation of the incompressible Navier–Stokes equations with random data

We present a well-posed stochastic Galerkin formulation of the incompressible Navier–Stokes equations with uncertainty in model parameters or the initial and boundary conditions. The stochastic Galerkin method involves representation of the solution through generalized polynomial chaos expansion and projection of the governing equations onto stochastic basis functions, resulting in an extended system of equations. A relatively low-order generalized polynomial chaos expansion is sufficient to capture the stochastic solution for the problem considered. We derive boundary conditions for the continuous form of the stochastic Galerkin formulation of the velocity and pressure equations. The resulting problem formulation leads to an energy estimate for the divergence. With suitable boundary data on the pressure and velocity, the energy estimate implies zero divergence of the velocity field. Based on the analysis of the continuous equations, we present a semi-discretized system where the spatial derivatives are approximated using finite difference operators with a summation-by-parts property. With a suitable choice of dissipative boundary conditions imposed weakly through penalty terms, the semi-discrete scheme is shown to be stable. Numerical experiments in the laminar flow regime corroborate the theoretical results and we obtain high-order accurate results for the solution variables and the velocity divergence converges to zero as the mesh is refined.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Stochastic Galerkin methods for the steady-state Navier–Stokes equations

We study the steady-state Navier–Stokes equations in the context of stochastic finite element discretizations. Specifically, we assume that the viscosity is a random field given in the form of a generalized polynomial chaos expansion. For the resulting stochastic problem, we formulate the model and linearization schemes using Picard and Newton iterations in the framework of the stochastic Galerkin method, and we explore properties of the resulting stochastic solutions. We also propose a preconditioner for solving the linear systems of equations arising at each step of the stochastic (Galerkin) nonlinear iteration and demonstrate its effectiveness for solving a set of benchmark problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Systematic parameter inference in stochastic mesoscopic modeling

We propose a method to efficiently determine the optimal coarse-grained force field in mesoscopic stochastic simulations of Newtonian fluid and polymer melt systems modeled by dissipative particle dynamics (DPD) and energy conserving dissipative particle dynamics (eDPD). The response surfaces of various target properties (viscosity, diffusivity, pressure, etc.) with respect to model parameters are constructed based on the generalized polynomial chaos (gPC) expansion using simulation results on sampling points (e.g., individual parameter sets). To alleviate the computational cost to evaluate the target properties, we employ the compressive sensing method to compute the coefficients of the dominant gPC terms given the prior knowledge that the coefficients are “sparse”. The proposed method shows comparable accuracy with the standard probabilistic collocation method (PCM) while it imposes a much weaker restriction on the number of the simulation samples especially for systems with high dimensional parametric space. Fully access to the response surfaces within the confidence range enables us to infer the optimal force parameters given the desirable values of target properties at the macroscopic scale. Moreover, it enables us to investigate the intrinsic relationship between the model parameters, identify possible degeneracies in the parameter space, and optimize the model by eliminating model redundancies. The proposed method provides an efficient alternative approach for constructing mesoscopic models by inferring model parameters to recover target properties of the physics systems (e.g., from experimental measurements), where those force field parameters and formulation cannot be derived from the microscopic level in a straight forward way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Closure and transport theory for high-collisionality electron-ion plasmas

Systems of algebraic equations for a high-collisionality electron-ion plasma are constructed from the general moment equations with linearized collision operators [J.-Y. Ji and E. D. Held, Phys. Plasmas 13, 102103 (2006) and J.-Y. Ji and E. D. Held, Phys. Plasmas 15, 102101 (2008)]. A systematic geometric method is invented and applied to solve the system of equations to find closure and transport relations. It is known that some closure coefficients of Braginskii [S. I. Braginskii, Reviews of Plasma Physics (Consultants Bureau, New York, 1965), Vol. 1] are in error up to 65% for some finite values of x (cyclotron frequency Multiplication-Sign electron-ion collision time) and have significant error in the large-x limit [E. M. Epperlein and M. G. Haines, Phys. Fluids 29, 1029 (1986)]. In this work, fitting formulas for electron coefficients are obtained from the 160 moment (Laguerre polynomial) solution, which converges with increasing moments for x{<=}100 and from the asymptotic solution for large x-values. The new fitting formulas are practically exact (less than 1% error) for arbitrary x and Z (the ion charge number, checked up to Z = 100). The ion coefficients for equal electron and ion temperatures are moderately modified by including the ion-electron collision operator. When the ion temperature is higher than the electron temperature, the ion-electron collision and the temperature change terms in the moment equations must be kept. The ion coefficient formulas from 3 moment (Laguerre polynomial) calculations, precise to less than 0.4% error from the convergent values, are explicitly written.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2013

Symbolic methods for the evaluation of sum rules of Bessel functions

The use of the umbral formalism allows a significant simplification of the derivation of sum rules involving products of special functions and polynomials. We rederive in this way known sum rules and addition theorems for Bessel functions. Furthermore, we obtain a set of new closed form sum rules involving various special polynomials and Bessel functions. The examples we consider are relevant for applications ranging from plasma physics to quantum optics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

Zero-multipole summation method for efficiently estimating electrostatic interactions in molecular system

The zero-multipole summation method has been developed to efficiently evaluate the electrostatic Coulombic interactions of a point charge system. This summation prevents the electrically non-neutral multipole states that may artificially be generated by a simple cutoff truncation, which often causes large amounts of energetic noise and significant artifacts. The resulting energy function is represented by a constant term plus a simple pairwise summation, using a damped or undamped Coulombic pair potential function along with a polynomial of the distance between each particle pair. Thus, the implementation is straightforward and enables facile applications to high-performance computations. Any higher-order multipole moment can be taken into account in the neutrality principle, and it only affects the degree and coefficients of the polynomial and the constant term. The lowest and second moments correspond respectively to the Wolf zero-charge scheme and the zero-dipole summation scheme, which was previously proposed. Relationships with other non-Ewald methods are discussed, to validate the current method in their contexts. Good numerical efficiencies were easily obtained in the evaluation of Madelung constants of sodium chloride and cesium chloride crystals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

The FADE mass-stat: A technique for inserting or deleting particles in molecular dynamics simulations

The emergence of new applications of molecular dynamics (MD) simulation calls for the development of mass-statting procedures that insert or delete particles on-the-fly. In this paper we present a new mass-stat which we term FADE, because it gradually “fades-in” (inserts) or “fades-out” (deletes) molecules over a short relaxation period within a MD simulation. FADE applies a time-weighted relaxation to the intermolecular pair forces between the inserting/deleting molecule and any neighbouring molecules. The weighting function we propose in this paper is a piece-wise polynomial that can be described entirely by two parameters: the relaxation time scale and the order of the polynomial. FADE inherently conserves overall system momentum independent of the form of the weighting function. We demonstrate various simulations of insertions of atomic argon, polyatomic TIP4P water, polymer strands, and C{sub 60} Buckminsterfullerene molecules. We propose FADE parameters and a maximum density variation per insertion-instance that restricts spurious potential energy changes entering the system within desired tolerances. We also demonstrate in this paper that FADE compares very well to an existing insertion algorithm called USHER, in terms of accuracy, insertion rate (in dense fluids), and computational efficiency. The USHER algorithm is applicable to monatomic and water molecules only, but we demonstrate that FADE can be generally applied to various forms and sizes of molecules, such as polymeric molecules of long aspect ratio, and spherical carbon fullerenes with hollow interiors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

A new hydrocarbon empirical potential in angle bending calculation for the molecular dynamics simulation

Typically, short range potential only depends on neighbouring atoms and its parameters function can be categorized into bond stretching, angle bending and bond rotation potential. In this paper, we present our work called Angle Bending (AB) potential, whereas AB potential is the extension of our previous work namely Bond Stretching (BS) potential. Basically, potential will tend to zero after truncated region, potential in specific region can be represented by different piecewise polynomial. We proposed the AB piecewise potential which is possible to solve a system involving three atoms. AB potential able to handle the potential of covalent bonds for three atoms as well as two atoms cases due to its degeneracy properties. Continuity for the piecewise polynomial has been enforced by coupling with penalty methods. There are still plenty of improvement spaces for this AB potential. The improvement for three atoms AB potential will be studied and further modified into torsional potential which are the ongoing current research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Canonical form of three-fermion pure-states with six single particle states

We construct a canonical form for pure states in Λ³(C⁶), the three-fermion system with six single particle states, under local unitary (LU) transformations, i.e., the unitary group U(6). We also construct a minimal set of generators of the algebra of polynomial U(6)-invariants on Λ³(C⁶). It turns out that this algebra is isomorphic to the algebra of polynomial LU-invariants of three-qubits which are additionally invariant under qubit permutations. As a consequence of this surprising fact, we deduce that there is a one-to-one correspondence between the U(6)-orbits of pure three-fermion states in Λ³(C⁶) and the LU orbits of pure three-qubit states when qubit permutations are allowed. As an important byproduct, we obtain a new canonical form for pure three-qubit states under LU transformations U(2) × U(2) × U(2) (no qubit permutations allowed)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Coupling coefficients for tensor product representations of quantum SU(2)

We study tensor products of infinite dimensional irreducible {sup *}-representations (not corepresentations) of the SU(2) quantum group. We obtain (generalized) eigenvectors of certain self-adjoint elements using spectral analysis of Jacobi operators associated to well-known q-hypergeometric orthogonal polynomials. We also compute coupling coefficients between different eigenvectors corresponding to the same eigenvalue. Since the continuous spectrum has multiplicity two, the corresponding coupling coefficients can be considered as 2 × 2-matrix-valued orthogonal functions. We compute explicitly the matrix elements of these functions. The coupling coefficients can be considered as q-analogs of Bessel functions. As a results we obtain several q-integral identities involving q-hypergeometric orthogonal polynomials and q-Bessel-type functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Combined state-adding and state-deleting approaches to type III multi-step rationally extended potentials: Applications to ladder operators and superintegrability

Type III multi-step rationally extended harmonic oscillator and radial harmonic oscillator potentials, characterized by a set of k integers m{sub 1}, m{sub 2}, ⋯, m{sub k}, such that m{sub 1} < m{sub 2} < ⋯ < m{sub k} with m{sub i} even (resp. odd) for i odd (resp. even), are considered. The state-adding and state-deleting approaches to these potentials in a supersymmetric quantum mechanical framework are combined to construct new ladder operators. The eigenstates of the Hamiltonians are shown to separate into m{sub k} + 1 infinite-dimensional unitary irreducible representations of the corresponding polynomial Heisenberg algebras. These ladder operators are then used to build a higher-order integral of motion for seven new infinite families of superintegrable two-dimensional systems separable in cartesian coordinates. The finite-dimensional unitary irreducible representations of the polynomial algebras of such systems are directly determined from the ladder operator action on the constituent one-dimensional Hamiltonian eigenstates and provide an algebraic derivation of the superintegrable systems whole spectrum including the level total degeneracies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Optimization of the determinant of the Vandermonde matrix and related matrices

Various techniques for interpolation of data, moment matching in stochastic applications and various methods in numerical analysis can be described using Vandermonde matrices. For this reason the properties of the determinant of the Vandermonde matrix and related matrices are interesting. Here the extreme points of the Vandermonde determinant, and related determinants, on some simple surfaces such as the unit sphere are analyzed, both numerically and analytically. Some results are also visualized in various dimensions. The extreme points of the Vandermonde determinant are also related to the roots of certain orthogonal polynomials such as the Hermite polynomials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

A complex guided spectral transform Lanczos method for studying quantum resonance states

A complex guided spectral transform Lanczos (cGSTL) algorithm is proposed to compute both bound and resonance states including energies, widths, and wavefunctions. The algorithm comprises of two layers of complex-symmetric Lanczos iterations. A short inner layer iteration produces a set of complex formally orthogonal Lanczos polynomials. They are used to span the guided spectral transform function determined by a retarded Green operator. An outer layer iteration is then carried out with the transform function to compute the eigen-pairs of the system. The guided spectral transform function is designed to have the same wavefunctions as the eigenstates of the original Hamiltonian in the spectral range of interest. Therefore, the energies and/or widths of bound or resonance states can be easily computed with their wavefunctions or by using a root-searching method from the guided spectral transform surface. The new cGSTL algorithm is applied to bound and resonance states of HO{sub 2}, and compared to previous calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Attractor comparisons based on density

Recognizing a chaotic attractor can be seen as a problem in pattern recognition. Some feature vector must be extracted from the attractor and used to compare to other attractors. The field of machine learning has many methods for extracting feature vectors, including clustering methods, decision trees, support vector machines, and many others. In this work, feature vectors are created by representing the attractor as a density in phase space and creating polynomials based on this density. Density is useful in itself because it is a one dimensional function of phase space position, but representing an attractor as a density is also a way to reduce the size of a large data set before analyzing it with graph theory methods, which can be computationally intensive. The density computation in this paper is also fast to execute. In this paper, as a demonstration of the usefulness of density, the density is used directly to construct phase space polynomials for comparing attractors. Comparisons between attractors could be useful for tracking changes in an experiment when the underlying equations are too complicated for vector field modeling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Synergy between pair coupled cluster doubles and pair density functional theory

Pair coupled cluster doubles (pCCD) has been recently studied as a method capable of accounting for static correlation with low polynomial cost. We present three combinations of pCCD with Kohn–Sham functionals of the density and on-top pair density (the probability of finding two electrons on top of each other) to add dynamic correlation to pCCD without double counting. With a negligible increase in computational cost, these pCCD+DFT blends greatly improve upon pCCD in the description of typical problems where static and dynamic correlations are both important. We argue that—as a black-box method with low scaling, size-extensivity, size-consistency, and a simple quasidiagonal two-particle density matrix—pCCD is an excellent match for pair density functionals in this type of fusion of multireference wavefunctions with DFT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗