Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIALS”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Semi-Automated Creation of Density Functional Tight Binding Models through Leveraging Chebyshev Polynomial-Based Force Fields

Density functional tight binding (DFTB) is an attractive method for accelerated quantum simulations of condensed matter due to its enhanced computational efficiency over standard density functional theory (DFT) approaches. However, DFTB models can be challenging to determine for individual systems of interest, especially for metallic and interfacial systems where different bonding arrangements can lead to significant changes in electronic states. In this regard, we have created a rapid-screening approach for determining systematically improvable DFTB interaction potentials that can yield transferable models for a variety of conditions. Our method leverages a recent reactive molecular dynamics force field where many-body interactions are represented by linear combinations of Chebyshev polynomials. This allows for the efficient creation of multi-center representations with relative ease, requiring only a small investment in initial DFT calculations. Here, we have focused our workflow on TiH 2 as a model system and show that a relatively small training set based on unit-cell-sized calculations yields a model accurate for both bulk and surface properties. Our approach is easy to implement and can yield reliable DFTB models over a broad range of thermodynamic conditions, where physical and chemical properties can be difficult to interrogate directly and there is historically a significant reliance on theoretical approaches for interpretation and validation of experimental results.

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

Permutationally Invariant Polynomial Expansions with Unrestricted Complexity

A general strategy is presented for constructing and validating permutationally invariant polynomial (PIP) expansions for chemical systems of any stoichiometry. Demonstrations are made for three categories of gas-phase dynamics and kinetics: collisional energy-transfer trajectories for predicting pressure-dependent kinetics, three-body collisions for describing transient van der Waals adducts relevant to atmospheric chemistry, and nonthermal reactivity via quasiclassical trajectories. In total, 30 systems are considered with up to 15 atoms and 39 degrees of freedom. Permutational invariance is enforced in PIP expansions with as many as 13 million terms and 13 permutationally distinct atom types by taking advantage of petascale computational resources. The quality of the PIP expansions is demonstrated through the systematic convergence of in-sample and out-of-sample errors with respect to both the number of training data and the order of the expansion, and these errors are shown to predict errors in the dynamics for both reactive and nonreactive applications. Here, the parallelized code distributed as part of this work enables the automation of PIP generation for complex systems with multiple channels and flexible user-defined symmetry constraints and for automatically removing unphysical unconnected terms from the basis set expansions, all of which are required for simulating complex reactive systems.

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

Chebyshev polynomial filtered subspace iteration in the discontinuous Galerkin method for large-scale electronic structure calculations

The Discontinuous Galerkin (DG) electronic structure method employs an adaptive local basis (ALB) set to solve the Kohn-Sham equations of density functional theory in a discontinuous Galerkin framework. The adaptive local basis is generated on-the-fly to capture the local material physics and can systematically attain chemical accuracy with only a few tens of degrees of freedom per atom. A central issue for large-scale calculations, however, is the computation of the electron density (and subsequently, ground state properties) from the discretized Hamiltonian in an efficient and scalable manner. We show in this work how Chebyshev polynomial filtered subspace iteration (CheFSI) can be used to address this issue and push the envelope in large-scale materials simulations in a discontinuous Galerkin framework. We describe how the subspace filtering steps can be performed in an efficient and scalable manner using a two-dimensional parallelization scheme, thanks to the orthogonality of the DG basis set and block-sparse structure of the DG Hamiltonian matrix. The on-the-fly nature of the ALB functions requires additional care in carrying out the subspace iterations. We demonstrate the parallel scalability of the DG-CheFSI approach in calculations of large-scale twodimensional graphene sheets and bulk three-dimensional lithium-ion electrolyte systems. In conclusion, employing 55 296 computational cores, the time per self-consistent field iteration for a sample of the bulk 3D electrolyte containing 8586 atoms is 90 s, and the time for a graphene sheet containing 11 520 atoms is 75 s.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Permutation invariant polynomial neural network approach to fitting potential energy surfaces. IV. Coupled diabatic potential energy matrices

A machine learning method is proposed for representing the elements of diabatic potential energy matrices (PEMs) with high fidelity. This is an extension of the so-called permutation invariant polynomial-neural network (PIP-NN) method for representing adiabatic potential energy surfaces. While for one-dimensional irreducible representations the diagonal elements of a diabatic PEM are invariant under exchange of identical nuclei in a molecular system, the off-diagonal elements require special symmetry consideration, particularly in the presence of a conical intersection. A multiplicative factor is introduced to take into consideration the particular symmetry properties while maintaining the PIP-NN framework. Here, we demonstrate here that the extended PIP-NN approach is accurate in representing diabatic PEMs, as evidenced by small fitting errors and by the reproduction of absorption spectra and product branching ratios in both H 2 O$(\tilde{X} / \tilde{B})$ and NH 3 $(\tilde{X} $/Ã) non-adiabatic photodissociation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

In this work, we propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Floquet operator dynamics and orthogonal polynomials on the unit circle

Operator spreading under stroboscopic time evolution under a unitary is studied. An operator Krylov space is constructed and mapped to orthogonal polynomials on a unit circle (OPUC), as well as to the Krylov space of the edge operator of the Floquet transverse field Ising model with inhomogeneous couplings (ITFIM). The Verblunsky coefficients in the OPUC representation are related to the Krylov angles parametrizing the ITFIM. The relations between the OPUC and spectral functions are summarized and several applications are presented. These include derivation of analytic expressions for the OPUC under persistent m-periodic dynamics, and the numerical construction of the OPUC for autocorrelations of the homogeneous Floquet-Ising model as well as the Z 3 clock model. The numerically obtained Krylov angles of the Z 3 clock model with long-lived period tripled autocorrelations show a spatial periodicity of six, and this observation is used to develop an analytically solvable model for the ITFIM that mimics this behavior.

Floquet systems↗
DOE OSTI2019

Polynomial time algorithms for estimating spectra of adiabatic Hamiltonians

Much research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians with Hamming-symmetric potentials, such as the well-studied “spike” example. Due to the large amount of symmetry in these potentials such problems are readily open to analysis both analytically and computationally. However, more realistic potentials do not have such a high degree of symmetry and may have many local minima. Here we present a somewhat more realistic class of problems consisting of many individually Hamming-symmetric potential wells. For two or three such wells we demonstrate that such a problem can be solved exactly in time polynomial in the number of qubits and wells. For greater than three wells, we present a tight-binding approach with which to efficiently analyze the performance of such Hamiltonians in an adiabatic computation. Here, we provide several basic examples designed to highlight the usefulness of this toy model and to give insight into using the tight-binding approach to examining it, including (1) an adiabatic unstructured search with a transverse field driver and a prior guess to the marked item and (2) a scheme for adiabatically simulating the ground states of small collections of strongly interacting spins, with an explicit demonstration for an Ising-model Hamiltonian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Chebyshev polynomial representation of imaginary-time response functions

Problems of finite-temperature quantum statistical mechanics can be formulated in terms of imaginary (Euclidean) -time Green's functions and self-energies. In the context of realistic Hamiltonians, the large energy scale of the Hamiltonian (as compared to temperature) necessitates a very precise representation of these functions. In this paper, we explore the representation of Green's functions and self-energies in terms of a series of Chebyshev polynomials. Here we show that many operations, including convolutions, Fourier transforms, and the solution of the Dyson equation, can straightforwardly be expressed in terms of the series expansion coefficients. We then compare the accuracy of the Chebyshev representation for realistic systems with the uniform-power grid representation, which is most commonly used in this context.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Spectral density reconstruction with Chebyshev polynomials

Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and semiexclusive scattering cross sections in atomic nuclei and transport properties of nuclear and neutron star matter. Integral transform techniques play an important role in accessing the spectral density in a variety of nuclear systems. However, their accuracy is in practice limited by the need to perform a numerical inversion which is often ill-conditioned. Here, in the present work we extend a recently proposed quantum algorithm which circumvents this problem. We show how to perform controllable reconstructions of the spectral density over a finite energy resolution with rigorous error estimates. An appropriate expansion in Chebyshev polynomials allows for efficient simulations also on classical computers. We apply our idea to obtain the local density of states for graphene in a magnetic field as a proof of principle. This paves the way for future applications in nuclear and condensed matter physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

Uncertainty Propagation Analysis of Computational Models in Laser Powder Bed Fusion Additive Manufacturing Using Polynomial Chaos Expansions

Computational models for simulating physical phenomena during laser-based powder bed fusion additive manufacturing (L-PBF AM) processes are critical for enhancing our understanding of these phenomena, enable process optimization, and accelerate qualification and certification of AM materials and parts. It is a well-known fact that such models typically involve multiple sources of uncertainty that originate from different sources such as model parameters uncertainty, or model/code inadequacy, among many others. Uncertainty quantification (UQ) is a broad field that focuses on characterizing such uncertainties in order to maximize the benefit of these models. Although UQ has been a center theme in computational models associated with diverse fields such as computational fluid dynamics and macro-economics, it has not yet been fully exploited with computational models for advanced manufacturing. The current study introduces one among the first efforts to conduct uncertainty propagation (UP) analysis in the context of L-PBF AM. More specifically, we present a generalized polynomial chaos expansions (gPCE) framework to assess the distributions of melt pool dimensions due to uncertainty in input model parameters. We develop the methodology and then employ it to validate model predictions, both through benchmarking them against Monte Carlo (MC) methods and against experimental data acquired from an experimental testbed.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Efficient Reformulation of Linear and Nonlinear Solid-Phase Diffusion in Lithium-ion Battery Models using Symmetric Polynomials: Mass Conservation and Computational Efficiency

Lithium-ion batteries are typically modeled using porous electrode theory coupled with various transport and reaction mechanisms, along with suitable discretization or approximations for the solid-phase diffusion equation. The solid-phase diffusion equation represents the main computational burden for typical pseudo-2-dimensional (p2D) models since these equations in the pseudo r -dimension must be solved at each point in the computational grid. This substantially increases the complexity of the model as well as the computational time. Traditional approaches towards simplifying solid-phase diffusion possess certain significant limitations, especially in modeling emerging electrode materials which involve phase changes and variable diffusivities. A computationally efficient representation for solid-phase diffusion is discussed in this paper based on symmetric polynomials using Orthogonal Collocation and Galerkin formulation (weak form). A systematic approach is provided to increase the accuracy of the approximation (p form in finite element methods) to enable efficient simulation with a minimal number of semi-discretized equations, ensuring mass conservation even for non-linear diffusion problems involving variable diffusivities. These methods are then demonstrated by incorporation into the full p2D model, illustrating their advantages in simulating high C-rates and short-time dynamic operation of Lithium-ion batteries.

25 ENERGY STORAGE↗
DOE OSTI2012

Improved Potential Energy Surface of Ozone Constructed Using the Fitting by Permutationally Invariant Polynomial Function

New global potential energy surface for the ground electronic state of ozone is constructed at the complete basis set level of the multireference configuration interaction theory. A method of fitting the data points by analytical permutationally invariant polynomial function is adopted. A small set of 500 points is preoptimized using the old surface of ozone. In this procedure the positions of points in the configuration space are chosen such that the RMS deviation of the fit is minimized. New ab initio calculations are carried out at these points and are used to build new surface. Additional points are added to the vicinity of the minimum energy path in order to improve accuracy of the fit, particularly in the region where the surface of ozone exhibits a shallow van der Waals well. New surface can be used to study formation of ozone at thermal energies and its spectroscopy near the dissociation threshold.

Ayouz, Mehdi↗
DOE OSTI2016

Polynomial Chaos–Based Bayesian Inference of K -Profile Parameterization in a General Circulation Model of the Tropical Pacific

The authors present a polynomial chaos (PC)–based Bayesian inference method for quantifying the uncertainties of the K-profile parameterization (KPP) within the MIT general circulation model (MITgcm) of the tropical Pacific. The inference of the uncertain parameters is based on a Markov chain Monte Carlo (MCMC) scheme that utilizes a newly formulated test statistic taking into account the different components representing the structures of turbulent mixing on both daily and seasonal time scales in addition to the data quality, and filters for the effects of parameter perturbations over those as a result of changes in the wind. To avoid the prohibitive computational cost of integrating the MITgcm model at each MCMC iteration, a surrogate model for the test statistic using the PC method is built. Because of the noise in the model predictions, a basis-pursuit-denoising (BPDN) compressed sensing approach is employed to determine the PC coefficients of a representative surrogate model. The PC surrogate is then used to evaluate the test statistic in the MCMC step for sampling the posterior of the uncertain parameters. Results of the posteriors indicate good agreement with the default values for two parameters of the KPP model, namely the critical bulk and gradient Richardson numbers; while the posteriors of the remaining parameters were barely informative.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗
DOE OSTI2024

Kernel polynomial method for linear spin wave theory

Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

The Basics of Orthogonal Polynomials

To understand the mathematics behind Uncertainty Quantification (UQ), one first needs to understand the basics of orthogonal polynomials, which this report covers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Systematic, Polynomial-Cost Approach to Exact Correlation Energies (Final Technical Report)

The full configuration interaction (FCI) wave function provides the exact solution to the Schrödinger equation in a given basis set. While FCI is intractable due to exponential computational costs, the many-body expansion (or the method of increments) can reduce scaling to a low-order polynomial with system size. This project entailed advances in the incremental FCI (iFCI) approach, designed to allow iFCI to reach larger system sizes and maintain its intrinsic high accuracy. This document describes advances in solvers for iFCI, strategies to treat multiple charge and spin states, and virtual state management methods to reduce memory requirements. Overall, this project allows iFCI to correlate (for the first time) 142 valence electrons in 444 orbitals in a realistic model of a transition metal complex.

74 ATOMIC AND MOLECULAR PHYSICS↗