Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “polynomial expansions”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

Comparison of various drag coefficient expansions using polynomials and splines

The longitudinal differential equation of motion has been used to investigate various aerodynamic expansion techniques. The total drag coefficient was expanded using conventional polynomials and splines with and without floating knot locations. This paper discusses the various techniques and approaches, compares results obtained from simultaneously fitting four separate flights (time vs distance measurements) and outlines the potential advantages and/or disadvantages of the various aerodynamic expansion techniques. It is believed that this is the first time splines have been used in the aerodynamic coefficient estimation process and that these results and techniques are germane to other applications.

Sabot, S. M.↗
NASA NTRS1979

The accurate solution of Poisson's equation by expansion in Chebyshev polynomials

A Chebyshev expansion technique is applied to Poisson's equation on a square with homogeneous Dirichlet boundary conditions. The spectral equations are solved in two ways - by alternating direction and by matrix diagonalization methods. Solutions are sought to both oscillatory and mildly singular problems. The accuracy and efficiency of the Chebyshev approach compare favorably with those of standard second- and fourth-order finite-difference methods.

Haidvogel, D. B.↗
NASA NTRS1982

Tolerance analysis of optical telescopes using coherent addition of wavefront errors

A near diffraction-limited telescope requires that tolerance analysis be done on the basis of system wavefront error. One method of analyzing the wavefront error is to represent the wavefront error function in terms of its Zernike polynomial expansion. A Ramsey-Korsch ray trace package, a computer program that simulates the tracing of rays through an optical telescope system, was expanded to include the Zernike polynomial expansion up through the fifth-order spherical term. An option to determine a 3 dimensional plot of the wavefront error function was also included in the Ramsey-Korsch package. Several assimulation runs were analyzed to determine the particular set of coefficients in the Zernike expansion that are effected by various errors such as tilt, decenter and despace. A 3 dimensional plot of each error up through the fifth-order spherical term was also included in the study. Tolerance analysis data are presented.

Davenport, J. W.↗
DOE OSTI2023

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

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

Performant implementation of the atomic cluster expansion (PACE) and application to copper and silicon

The atomic cluster expansion is a general polynomial expansion of the atomic energy in multi-atom basis functions. Here we implement the atomic cluster expansion in the performant C++ code that is suitable for use in large-scale atomistic simulations. We briefly review the atomic cluster expansion and give detailed expressions for energies and forces as well as efficient algorithms for their evaluation. We demonstrate that the atomic cluster expansion as implemented in shifts a previously established Pareto front for machine learning interatomic potentials toward faster and more accurate calculations. Moreover, general purpose parameterizations are presented for copper and silicon and evaluated in detail. We show that the Cu and Si potentials significantly improve on the best available potentials for highly accurate large-scale atomistic simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Performant implementation of the atomic cluster expansion

The atomic cluster expansion is a general polynomial expansion of the atomic energy in multi-atom basis functions. Here we implement the atomic cluster expansion in the performant C++ code PACE that is suitable for use in large scale atomistic simulations. We briefly review the atomic cluster expansion and give detailed expressions for energies and forces as well as efficient algorithms for their evaluation. We demonstrate that the atomic cluster expansion as implemented in PACE shifts a previously established Pareto front for machine learning interatomic potentials towards faster and more accurate calculations. Moreover, general purpose parameterizations are presented for copper and silicon and evaluated in detail. We show that the new Cu and Si potentials significantly improve on the best available potentials for highly accurate large-scale atomistic simulations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Permutation invariant polynomial neural network based diabatic ansatz for the ( E + A ) × ( e + a ) Jahn–Teller and Pseudo-Jahn–Teller systems

In this work, the permutation invariant polynomial neural network (PIP-NN) approach is employed to construct a quasi-diabatic Hamiltonian for system with non-Abelian symmetries. It provides a flexible and compact NN-based diabatic ansatz from the related approach of Williams, Eisfeld, and co-workers. The example of $H^3_+$ is studied, which is an (E + A) × (e + a) Jahn–Teller and Pseudo-Jahn–Teller system. The PIP-NN diabatic ansatz is based on the symmetric polynomial expansion of Viel and Eisfeld, the coefficients of which are expressed with neural network functions that take permutation-invariant polynomials as input. This PIP-NN-based diabatic ansatz not only preserves the correct symmetry but also provides functional flexibility to accurately reproduce ab initio electronic structure data, thus resulting in excellent fits. Further, the adiabatic energies, energy gradients, and derivative couplings are well reproduced. A good description of the local topology of the conical intersection seam is also achieved. Therefore, this diabatic ansatz completes the PIP-NN based representation of DPEM with correct symmetries and will enable us to diabatize even more complicated systems with complex symmetries.

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

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗
NASA NTRS1990

Mappings and accuracy for Chebyshev pseudo-spectral approximations

The effect of mappings on the approximation, by Chebyshev collocation, of functions which exhibit localized regions of rapid variation is studied. A general strategy is introduced whereby mappings are adaptively constructed which map specified classes of rapidly varying functions into low order polynomials which can be accurately approximated by Chebyshev polynomial expansions. A particular family of mappings constructed in this way is tested on a variety of rapidly varying functions similar to those occurring in approximations. It is shown that the mapped function can be approximated much more accurately by Chebyshev polynomial approximations than in physical space or where mappings constructed from other strategies are employed.

Bayliss, Alvin↗
NASA NTRS1992

Mappings and accuracy for Chebyshev pseudo-spectral approximations

The effect of mappings on the approximation, by Chebyshev collocation, of functions which exhibit localized regions of rapid variation is studied. A general strategy is introduced whereby mappings are adaptively constructed which map specified classes of rapidly varying functions into low order polynomials which can be accurately approximated by Chebyshev polynomial expansions. A particular family of mappings constructed in this way is tested on a variety of rapidly varying functions similar to those occurring in approximations. It is shown that the mapped function can be approximated much more accurately by Chebyshev polynomial approximations than in physical space or where mappings constructed from other strategies are employed.

Bayliss, Alvin↗
NASA NTRS2012

A New and General Formulation of the Parametric HFGMC Micromechanical Method for Three-Dimensional Multi-Phase Composites

The recent two-dimensional (2-D) parametric formulation of the high fidelity generalized method of cells (HFGMC) reported by the authors is generalized for the micromechanical analysis of three-dimensional (3-D) multiphase composites with periodic microstructure. Arbitrary hexahedral subcell geometry is developed to discretize a triply periodic repeating unit-cell (RUC). Linear parametric-geometric mapping is employed to transform the arbitrary hexahedral subcell shapes from the physical space to an auxiliary orthogonal shape, where a complete quadratic displacement expansion is performed. Previously in the 2-D case, additional three equations are needed in the form of average moments of equilibrium as a result of the inclusion of the bilinear terms. However, the present 3-D parametric HFGMC formulation eliminates the need for such additional equations. This is achieved by expressing the coefficients of the full quadratic polynomial expansion of the subcell in terms of the side or face average-displacement vectors. The 2-D parametric and orthogonal HFGMC are special cases of the present 3-D formulation. The continuity of displacements and tractions, as well as the equilibrium equations, are imposed in the average (integral) sense as in the original HFGMC formulation. Each of the six sides (faces) of a subcell has an independent average displacement micro-variable vector which forms an energy-conjugate pair with the transformed average-traction vector. This allows generating symmetric stiffness matrices along with internal resisting vectors for the subcells which enhances the computational efficiency. The established new parametric 3-D HFGMC equations are formulated and solution implementations are addressed. Several applications for triply periodic 3-D composites are presented to demonstrate the general capability and varsity of the present parametric HFGMC method for refined micromechanical analysis by generating the spatial distributions of local stress fields. These applications include triply periodic composites with inclusions in the form of a cavity, spherical inclusion, ellipsoidal inclusion, discontinuous aligned short fiber. A 3-D repeating unit-cell for foam material composite is simulated.

Haj-Ali, Rami↗