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 127 records · Page 7

Rapidly convergent quantum Monte Carlo using a Chebyshev projector

The multireference coupled-cluster Monte Carlo (MR-CCMC) algorithm is a determinant-based quantum Monte Carlo (QMC) algorithm that is conceptually similar to Full Configuration Interaction QMC (FCIQMC). It has been shown to offer a balanced treatment of both static and dynamic correlation while retaining polynomial scaling, although application to large systems with significant strong correlation remained impractical. In this paper, we document recent algorithmic advances that enable rapid convergence and a more black-box approach to the multireference problem. These include a logarithmically scaling metric-tree-based excitation acceptance algorithm to search for determinants connected to the reference space at the desired excitation level and a symmetry-screening procedure for the reference space. We show that, for moderately sized reference spaces, the new search algorithm brings about an approximately 8-fold acceleration of one MR-CCMC iteration, while the symmetry screening procedure reduces the number of active reference space determinants with essentially no loss of accuracy. We also introduce a stochastic implementation of an approximate wall projector, which is the infinite imaginary time limit of the exponential projector, using a truncated expansion of the wall function in Chebyshev polynomials. Notably, this wall-Chebyshev projector can be used to accelerate any projector-based QMC algorithm. We show that it requires significantly fewer applications of the Hamiltonian to achieve the same statistical convergence. We benchmark these acceleration methods on the beryllium and carbon dimers, using initiator FCIQMC and MR-CCMC with basis sets up to cc-pVQZ quality.

Zhao, Zijun↗

Taming the virtual space for incremental full configuration interaction

Incremental full configuration interaction (iFCI) closely approximates the FCI limit with polynomial cost through a many-body expansion of the correlation energy, providing highly accurate total energies within a given basis set. To extend iFCI beyond previous basis set limitations, this work introduces a novel natural orbital (NO) screening approach, incremental NO full configuration interaction (iNO-FCI). By consideration of the importance of virtual orbital selection in the convergence of iFCI, iNO-FCI maximizes the consistency between orbitals selected for each correlated body. iNO-FCI employs a principle of cancellation of errors and ensures that the same set of virtual NOs is used for interdependent terms. Here, this strategy significantly reduces computational cost without compromising precision. Computational savings of up to 95% are demonstrated, allowing access to larger basis sets that were previously computationally prohibitive. iNO-FCI is herein introduced and benchmarked for several difficult test cases involving double-bond dissociation, biradical systems, conjugated π systems, and the spin gap of a Cu-based transition metal complex.

Correlation energy↗

Performance Improvements for the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. Griffin includes a variety of deterministic radiation transport solvers for fixed source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. A code assessment performed in FY-20 identified two significant issues with the transport solvers in Griffin: first, the primary heterogeneous SN (discrete ordinates) transport solver based on continuous finite element methods required significant mesh refinement and higher memory usage compared to solvers based on the method of characteristic for equivalent accuracy. Second, the homogeneous PN (spherical harmonics expansion) transport solver did not adequately support polynomial refinement, which is a feature usually required for problems with spatial homogenization and pronounced streaming, typical in fast or gas-cooled reactor systems. To address the first issue, the development effort focused on the more promising discontinuous finite element method (DFEM)-based SN transport solver in Griffin. The addition of an asynchronous parallel transport sweeper and coarse mesh finite difference (CMFD) acceleration have rendered a superior heterogeneous SN transport capability for multiphysics problems that requires far less computing resources in terms of both CPU time and memory usage. This is demonstrated with typical thermal- and fast-spectrum reactor benchmark problems, including 2D Transient Reactor Test, 3D Advanced Burner Test Reactor (ABTR), and 2D and 3D Empire microreactor. For the second issue, the development effort focused on a new transport solver based on the hybrid finite element PN method (HFEM-PN), equivalent to the variational nodal method, as well as a new diffusion solver based on HFEM-Diffusion. This solver is intended for homogenized domains with multiphysics coupling (i.e., supports mesh displacement, seamless temperature feedback, etc.). Initial calculations with the HFEM-Diffusion implementation show very good parallel efficiency for the residual evaluations with the 2D ABTR benchmark. A future development effort will be centered on further improvements to the CMFD, HFEM-PN, and DFEM diffusion solvers to ensure Griffin meets performance and software quality assurance requirements for advanced reactor design and analysis.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Extended kinetic lattice grand canonical Monte Carlo simulation method for transport of multicomponent ion mixtures through a model nanopore system

Abstract An extended version of the original kinetic lattice grand canonical Monte Carlo simulation method combined with mean field theory (KLGCMC/MF) ( J. Chem. Phys. 2007 , 127, 024706) is presented for the study of transport of multicomponent ion mixtures through a model nanopore. Comparison of the extended KLGCMC/MF (eKLGCMC/MF) simulation results with Poisson–Nernst–Planck (PNP) calculations is also made to confirm the validity of the extended simulation approach. Unlike the original version of KLGCMC/MF simulation method that treats only a binary ionic solution with one cation and one anion species, this extended version can deal with a system that includes ternary ion mixtures. A diffusion probability algorithm is also added to the extended version of the simulation method to describe the inhomogeneous diffusivity of ions that is often observed in the ion permeation through nanopores. Both Legendre and Chebyshev polynomials of the second kind were tested as a basis set for the basis set expansion (BSE) method with which to calculate the reaction field energy in the eKLGCMC/MF simulation. It turned out that the Legendre polynomials perform better than the Chebyshev polynomials, and as a result, the Legendre polynomials were implemented in the current version of eKLGCMC/MF simulation algorithm. The presented eKLGCMC/MF simulation method with new features finds its potential applications in nanopore systems where the correlation between ion species with the same sign of charges plays a key role such as oscillating ion currents or anomalous mole fraction effects.

Choi, Inhyeok↗

Photon production rate from Transverse-Longitudinal ( T – L) mesonic correlator on the lattice

Thermal photons from the QGP provide important information about the interaction among plasma constituents. The photon production rate from a thermally equilibrated system is proportional to the transverse spectral function ρ T (ω = |k → |,k → ). One can also calculate the photon production rate from the difference between ρ T (ω, k → ) (transverse) and ρ L (ω, k → ) (longitudinal) projections, as ρL vanishes on the photon point. Because the UV part of ρ T – ρ L is suppressed, the corresponding Euclidean correlator receives most of its contribution from the IR part. We calculate the T – L correlator on N f = 2 + 1 flavour HISQ configurations with m l = m s /5 at temperature of about 1.15T ρc (220 MeV). We have used two ansätze for the spectral function: 1) A polynomial connected to the UV region consistent with OPE expansion and 2) a hydro-inspired spectral function. We have also applied the Backus-Gilbert method to estimate the spectral function. All these different approaches are combined to estimate the photon production rate.

Bala, Dibyendu↗

Analysis of sparse recovery for Legendre expansions using envelope bound

We provide novel sufficient conditions for the uniform recovery of sparse Legendre expansions using ℓ 1 minimization, where the sampling points are drawn according to orthogonalization (uniform) measure. So far, conditions of the form m ≳ Θ 2 s x log factors have been relied on to determine the minimum number of samples m that guarantees successful reconstruction of s-sparse vectors when the measurement matrix is associated to an orthonormal system. However, in case of sparse Legendre expansions, the uniform bound Θ of Legendre systems is so high that these conditions are unable to provide meaningful guarantees. Here, in this paper, we present an analysis which employs the envelop bound of all Legendre polynomials instead, and prove a new recovery guarantee for s-sparse Legendre expansions, m ≳ Θs 2 x log factors, which is independent of Θ. Arguably, this is the first recovery condition established for orthonormal systems without assuming the uniform boundedness of the sampling matrix. The key ingredient of our analysis is an extension of chaining arguments, recently developed in Bourgain and Chkifa et al., to handle the envelope bound. Furthermore, our recovery condition is proved via restricted eigenvalue property, a less demanding replacement of restricted isometry property which is perfectly suited to the considered scenario. Along the way, we derive simple criteria to detect good sample sets. Our numerical tests show that sets of uniformly sampled points that meet these criteria will perform better recovery on average.

97 MATHEMATICS AND COMPUTING↗

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↗

The linear thermal expansion of 11 polymers from approximately -100 to +100°C

The linear coefficient of thermal expansion has been measured for 11 polymers from approximately -100 to +100°C. The polymers tested were poly(tetrafluoroethylene) (PTFE), poly(chlorotrifluoroethylene) (PCTFE), three polyethylenes; high density (HDPE), ultra-high molecular weight (UHMWPE) and cross-linked (XPE). The commercial fluoropolymers Kel-F 800 (also known as FK-800®) and THV 500®were tested together with samples of poly(ether ether ketone) (PEEK), poly(methyl methyl methacrylate) (PMMA), polycarbonate (PC) and poly(vinylidene fluoride) (PVDF). Polynomial fits were made to the data over appropriate ranges allowing the expansivity (α) to be estimated.

36 MATERIALS SCIENCE↗

Efficient Probabilistic Prediction and Uncertainty Quantification of Tropical Cyclone–Driven Storm Tides and Inundation

Abstract This study proposes and assesses a methodology to obtain high-quality probabilistic predictions and uncertainty information of near-landfall tropical cyclone–driven (TC-driven) storm tide and inundation with limited time and resources. Forecasts of TC track, intensity, and size are perturbed according to quasi-random Korobov sequences of historical forecast errors with assumed Gaussian and uniform statistical distributions. These perturbations are run in an ensemble of hydrodynamic storm tide model simulations. The resulting set of maximum water surface elevations are dimensionality reduced using Karhunen–Loève expansions and then used as a training set to develop a polynomial chaos (PC) surrogate model from which global sensitivities and probabilistic predictions can be extracted. The maximum water surface elevation is extrapolated over dry points incorporating energy head loss with distance to properly train the surrogate for predicting inundation. We find that the surrogate constructed with third-order PCs using elastic net penalized regression with leave-one-out cross validation provides the most robust fit across training and test sets. Probabilistic predictions of maximum water surface elevation and inundation area by the surrogate model at 48-h lead time for three past U.S. landfalling hurricanes (Irma in 2017, Florence in 2018, and Laura in 2020) are found to be reliable when compared to best track hindcast simulation results, even when trained with as few as 19 samples. The maximum water surface elevation is most sensitive to perpendicular track-offset errors for all three storms. Laura is also highly sensitive to storm size and has the least reliable prediction. Significance Statement The purpose of this study is to develop and evaluate a methodology that can be used to provide high-quality probabilistic predictions of hurricane-induced storm tide and inundation with limited time and resources. This is important for emergency management purposes during or after the landfall of hurricanes. Our results show that sampling forecast errors using quasi-random sequences combined with machine learning techniques that fit polynomial functions to the data are well suited to this task. The polynomial functions also have the benefit of producing exact sensitivity indices of storm tide and inundation to the forecasted hurricane properties such as path, intensity, and size, which can be used for uncertainty estimation. The code implementing the presented methodology is publicly available on GitHub.

54 ENVIRONMENTAL SCIENCES↗

An expansion of well tempered gravity

When faced with two nigh intractable problems in cosmology — how to remove the original cosmological constant problem and how to parametrize modified gravity to explain current cosmic acceleration — we can make progress by counterposing them. The well tempered solution to the cosmological constant through degenerate scalar field dynamics also relates disparate Horndeski gravity terms, making them contrapuntal. We derive the connection between the kinetic term K and braiding term G 3 for shift symmetric theories (including the running Planck mass G 4 ), extending previous work on monomial or binomial dependence to polynomials of arbitrary finite degree. We also exhibit an example for an infinite series expansion. Finally, this contrapuntal condition greatly reduces the number of parameters needed to test modified gravity against cosmological observations, for these "golden" theories of gravity.

79 ASTRONOMY AND ASTROPHYSICS↗

Field redefinitions and infinite field anomalous dimensions

Field redefinitions are commonly used to reduce the number of operators in the Lagrangian by removing redundant operators and transforming to a minimal operator basis. We give a general argument that such field redefinitions, while leaving the S-matrix invariant and consequently finite, lead not only to infinite Green’s functions, but also to infinite field anomalous dimensions γ ϕ . These divergences cannot be removed by counterterms without reintroducing redundant operators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Partitioned Quantum Subspace Expansion

We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.

97 MATHEMATICS AND COMPUTING↗

Chiral-odd generalized parton distributions in the large-𝑁 𝑐 limit of QCD: Spin-flavor structure, polynomiality, and sum rules

We study the nonperturbative properties of the nucleon’s chiral-odd generalized parton distributions (transversity GPDs) in the large-𝑁 𝑐 limit of QCD. This includes the parametric ordering of the spin-flavor components, the polynomiality property of the moments, and the sum rules connecting the GPDs with the tensor form factors. A multipole expansion in the transverse momentum transfer is used to enumerate and interpret the structures in the nucleon matrix element of the chiral-odd partonic operator, including monopole, dipole and quadrupole terms. The 1/𝑁 𝑐 expansion of the GPDs is performed using the abstract mean-field picture of baryons in the large-𝑁 𝑐 limit and its symmetries. We derive a large-𝑁 𝑐 relation between the flavor-nonsinglet GPDs 𝐸$^{𝑢−𝑑}_𝑇$ and $\tilde{𝐻}^{𝑢−𝑑}_𝑇$ and test it with recent lattice QCD results. We show that the polynomiality property and sum rules of the GPDs are fulfilled with the restricted realization of translational and rotational invariance in the mean-field picture. The results provide a basis for the phenomenological analysis of chiral-odd GPDs and hard exclusive processes in the large-𝑁 𝑐 limit, and for calculations in specific dynamical models.

generalized parton distributions↗

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗

Loops of loops expansion in the amplituhedron

We study a novel geometric expansion for scattering amplitudes in the planar sector of $\mathcal{N}$ = 4 super Yang-Mills theory, in the context of the Amplituhedron which reproduces the all-loop integrand as a canonical differential form on the positive geometry. In a paper by Arkani-Hamed, Henn and one of the authors, it was shown that this result can be recast in terms of negative geometries with a certain hierarchy of loops (closed cycles) in the space of loop momenta, represented by lines in momentum twistor space. One can then calculate an all-loop order result in the approximation where only tree graphs in the space of all loops are considered. Furthermore, using differential equation methods, it is possible to calculate and resum integrated expressions and obtain strong coupling results. In this paper, we provide a more general framework for the ‘loops of loops’ expansion and outline a powerful method for the determination of differential forms for higher-order geometries. We solve the problem completely for graphs with one internal cycle, but the method can be used more generally for other geometries.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Feasibility of DEIM for retrieving the initial field via dimensionality reduction

When parameter estimation is solved in a high-dimensional space, the dimensionality reduction strategy becomes the primary consideration for alleviating the tremendous computational cost. Here, the discrete empirical interpolation method (DEIM) is explored to retrieve the initial condition (IC) by combining the polynomial chaos (PC) based ensemble Kalman filter (i.e. PC-EnKF), where a non-intrusive PC expansion is considered as a surrogate model in place of the forward model in the prediction step of the ensemble Kalman filter, resulting in fewer forward model integrations but with a comparable accuracy as Monte Carlo-based approaches. The DEIM acts as a hyper-reduction tool to provide the low-dimensional input for the high-dimensional initial field, which can be reconstructed using the information on the sparse interpolation grid points that is adaptively obtained through PC-EnKF data assimilation method. Thus an innovative framework to reconstruct the IC is developed. The detailed procedure at each assimilation iteration includes: the determination of the spatial interpolation points, the estimation of the initial values on the interpolation locations using the optimal observations, and the reconstruction of IC in the full space. The current study uses the reconstruction field of initial conditions of the Navier-Stokes equations as an example to illustrate the efficacy of our method. The experimental results demonstrate the proposed algorithm achieves a satisfactory reconstruction for the initial field. The proposed method helps to extend the applicable area of DEIM in solving inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fully variational incremental CASSCF

We report the complete-active-space self-consistent field (CASSCF) method is a canonical electronic structure theory that holds a central place in conceptualizing and practicing first principles simulations. For application to realistic molecules, however, the CASSCF must be approximated to circumvent its exponentially scaling computational costs. Applying the many-body expansion - also known as the method of increments - to CASSCF (iCASSCF) has been shown to produce a polynomially scaling method that retains much of the accuracy of the parent theory and is capable of treating full valence active spaces. Due to an approximation made in the orbital gradient, the orbital parameters of the original iCASSCF formulation could not be variationally optimized, which limited the accuracy of its nuclear gradient. Herein, a variational iCASSCF is introduced and implemented, where all parameters are fully optimized during energy minimization. This method is able to recover electronic correlations from the full valence space in large systems, produce accurate gradients, and optimize stable geometries as well as transition states. Demonstrations on challenging test cases, such as the oxoMn(salen)Cl complex with 84 electrons in 84 orbitals and the automerization of cyclobutadiene, show that the fully variational iCASSCF is a powerful tool for describing challenging molecular chemistries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗