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 199 records · Page 11

A note of expansions of functions of velocity in the two-body problem

Fourier expansions based on both the true anomaly and the mean anomaly are obtained for the functions of velocity in the two-body problem; the series of coefficients is written from classical formulae involving associated Legendre polynomials, Gegenbauer polynomials, or Bessel functions. The Fourier expansions are compared with the expansions in powers of eccentricity developed by Broucke (1974) through use of computerized Poisson series manipulation.

Kinoshita, H.↗

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗

Thermal expansion of the hexagonal (6H) polytype of silicon carbide

X-ray diffraction is presently used to determine the thermal expansion of the hexagonal (6H) polytype of alpha-SiC over the 20-1000 C range. The principal (alpha-11 and alpha-33) axial coefficients of thermal expansion can be expressed by second-order polynomials; the former is noted to be larger than the latter over the entire temperature range, while the thermal expansion anisotropy increases continuously with increasing temperature. The thermal expansion and thermal expansion anisotropy obtained are compared with previously published results for the (6H) polytype, and discussed with respect to the structure.

Li, Z.↗

Spectral function for 4 He using the Chebyshev expansion in coupled-cluster theory

Here, we compute spectral function for 4 He by combining coupled-cluster theory with an expansion of integral transforms into Chebyshev polynomials. Our method allows us to estimate the uncertainty of spectral reconstruction. The properties of the Chebyshev polynomials make the procedure numerically stable and considerably lower in memory usage than the typically employed Lanczos algorithm. We benchmark our predictions with other calculations in the literature and with electron-scattering data in the quasi-elastic peak. The spectral function formalism allows one to extend ab initio lepton-nucleus cross sections into the relativistic regime. This makes it a promising tool for modeling this process at higher-energy transfers. The results we present open the door for studies of heavier nuclei, important for the neutrino oscillation programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimising HEP Simulations on 3D Architecture: Primitive Gates for BT

In this report, the first attempt for an alternative approach for the simulation of the non-abelian group BT has been done. First, we analysed why SNAP and Displacement decomposition is not feasible for this problem with the current technology, and then we explored a new approach for the optimisation of the pulses. In particular, we studied how the expansion of the pulses in Chebyshev Polynomials could affect the optimisation process. Even if the study is not conclusive, we believe that it might be worth continuing to study this approach in the future, in order to be able to efficiently implement quantum circuits on computers.

97 MATHEMATICS AND COMPUTING↗

High zonal harmonics of rapidly rotating planets

A new perturbation expansion is derived for the structure of rotating bodies in hydrostatic equilibrium. The method uses an expansion of the density on Legendre polynomial functions of angle, and can be developed analytically in a manner analogous to the standard level-surface perturbation theory. The new theory proceeds from a prescribed pressure-density relation rather than from a prescribed density distribution, and is both simpler and more physically transparent than the level-surface approach. High zonal harmonics are shown to arise via a transfer function involving derivatives of the interior sound velocity, and via mixing of multipole density components in the outer shell of the planet. Sample calculations for polytropic sequences are presented, as well as standard gravity models for Jupiter and Saturn. Mathematical subleties of the theory are discussed in an appendix.

Hubbard, W. B.↗

A unified approach to the helioseismic forward and inverse problems of differential rotation

A general, degenerate perturbation theoretic treatment of the helioseismic forward and inverse problem for solar differential rotation is presented. For the forward problem, differential rotation is represented as the axisymmetric component of a general toroidal flow field using velocity spherical harmonics. This approach allows each degree of differential rotation to be estimated independently from all other degrees. In the inverse problem, the splitting caused by differential rotation is expressed as an expansion in a set of orthonormal polynomials that are intimately related to the solution of the forward problem. The combined use of vector spherical harmonics as basis functions for differential ratio and the Clebsch-Gordon coefficients to represent splitting provides a unified approach to the forward and inverse problems of differential rotation which greatly simplify inversion.

Ritzwoller, Michael H.↗

On the Gibbs phenomenon 4: Recovering exponential accuracy in a sub-interval from a Gegenbauer partial sum of a piecewise analytic function

We continue our investigation of overcoming Gibbs phenomenon, i.e., to obtain exponential accuracy at all points (including at the discontinuities themselves), from the knowledge of a spectral partial sum of a discontinuous but piecewise analytic function. We show that if we are given the first N Gegenbauer expansion coefficients, based on the Gegenbauer polynomials C(sub k)(sup mu)(x) with the weight function (1 - x(exp 2))(exp mu - 1/2) for any constant mu is greater than or equal to 0, of an L(sub 1) function f(x), we can construct an exponentially convergent approximation to the point values of f(x) in any subinterval in which the function is analytic. The proof covers the cases of Chebyshev or Legendre partial sums, which are most common in applications.

Gottlieb, David↗

Uncertainty Quantification of Turbulence Model Closure Coefficients for Transonic Wall-Bounded Flows

The goal of this work was to quantify the uncertainty and sensitivity of commonly used turbulence models in Reynolds-Averaged Navier-Stokes codes due to uncertainty in the values of closure coefficients for transonic, wall-bounded flows and to rank the contribution of each coefficient to uncertainty in various output flow quantities of interest. Specifically, uncertainty quantification of turbulence model closure coefficients was performed for transonic flow over an axisymmetric bump at zero degrees angle of attack and the RAE 2822 transonic airfoil at a lift coefficient of 0.744. Three turbulence models were considered: the Spalart-Allmaras Model, Wilcox (2006) k-w Model, and the Menter Shear-Stress Trans- port Model. The FUN3D code developed by NASA Langley Research Center was used as the flow solver. The uncertainty quantification analysis employed stochastic expansions based on non-intrusive polynomial chaos as an efficient means of uncertainty propagation. Several integrated and point-quantities are considered as uncertain outputs for both CFD problems. All closure coefficients were treated as epistemic uncertain variables represented with intervals. Sobol indices were used to rank the relative contributions of each closure coefficient to the total uncertainty in the output quantities of interest. This study identified a number of closure coefficients for each turbulence model for which more information will reduce the amount of uncertainty in the output significantly for transonic, wall-bounded flows.

Schaefer, John↗

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗

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↗

LQR Control of Thin Shell Dynamics: Formulation and Numerical Implementation

A PDE-based feedback control method for thin cylindrical shells with surface-mounted piezoceramic actuators is presented. Donnell-Mushtari equations modified to incorporate both passive and active piezoceramic patch contributions are used to model the system dynamics. The well-posedness of this model and the associated LQR problem with an unbounded input operator are established through analytic semigroup theory. The model is discretized using a Galerkin expansion with basis functions constructed from Fourier polynomials tensored with cubic splines, and convergence criteria for the associated approximate LQR problem are established. The effectiveness of the method for attenuating the coupled longitudinal, circumferential and transverse shell displacements is illustrated through a set of numerical examples.

delRosario, R. C. H.↗

Thermal expansion of the cubic (3C) polytype of SiC

Thermal expansion of the cubic beta or (3C) polytype of SiC was measured from 20 to 1000 C by the X-ray-diffraction technique. Over that temperature range, the coefficient of thermal expansion can be expressed by a second-order polynomial. It increases continuously from about 3.2 x 10 to the -6th/C at room temperature to 5.1 x 10 to the -6th/C at 1000 C, with an average value of 4.45 x 10 to the -6th/C between room temperature and 1000 C. This trend is compared with other published results and is discussed in terms of structural contributions to the thermal expansion.

Li, Z.↗