Search NASA⌕ Search

SEARCH · Search NASA

Results for “Full Approximation Scheme”

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 73 records · Page 4

Non-Intrusive Inference Reduced Order Model for Fluids Using Deep Multistep Neural Network

In this effort we propose a data-driven learning framework for reduced order modeling of fluid dynamics. Designing accurate and efficient reduced order models for nonlinear fluid dynamic problems is challenging for many practical engineering applications. Classical projection-based model reduction methods generate reduced systems by projecting full-order differential operators into low-dimensional subspaces. However, these techniques usually lead to severe instabilities in the presence of highly nonlinear dynamics, which dramatically deteriorates the accuracy of the reduced-order models. In contrast, our new framework exploits linear multistep networks, based on implicit Adams–Moulton schemes, to construct the reduced system. The advantage is that the method optimally approximates the full order model in the low-dimensional space with a given supervised learning task. Moreover, our approach is non-intrusive, such that it can be applied to other complex nonlinear dynamical systems with sophisticated legacy codes. We demonstrate the performance of our method through the numerical simulation of a two-dimensional flow past a circular cylinder with Reynolds number Re = 100. The results reveal that the new data-driven model is significantly more accurate than standard projection-based approaches.

97 MATHEMATICS AND COMPUTING↗

Matter power spectra in modified gravity: a comparative study of approximations and N -body simulations

ABSTRACT Testing gravity and the concordance model of cosmology, $\Lambda$CDM, at large scales is a key goal of this decade’s largest galaxy surveys. Here we present a comparative study of dark matter power spectrum predictions from different numerical codes in the context of three popular theories of gravity that induce scale-independent modifications to the linear growth of structure: nDGP, Cubic Galileon, and K-mouflage. In particular, we compare the predictions from N-body simulations solving the full scalar field equation, two N-body codes with approximate time integration schemes, a parametrized modified N-body implementation, and the analytic halo model reaction approach. We find the modification to the $\Lambda$CDM spectrum is in 2 per cent agreement at $z\le 1$ and $k\le 1~h\,{\rm Mpc}^{-1}$ over all gravitational models and codes, in accordance with many previous studies, indicating these modelling approaches are robust enough to be used in forthcoming survey analyses under appropriate scale cuts. We further make public the new code implementations presented, specifically the halo model reaction K-mouflage implementation and the relativistic Cubic Galileon implementation.

Bose, B. (ORCID:0000000319658614)↗

Dynamic quantum clustering: a tool for visual exploration of structures in data

A given set of data-points in some feature space may be associated with a Schroedinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged dynamical scheme using a time-dependent Schroedinger equation. Moreover, we approximate this Hamiltonian formalism by a truncated calculation within a set of Gaussian wave functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗

Solution of the transonic full potential equation in conservative form using an implicit algorithm

The paper presents numerical solutions of the full potential equation in conservative form. The iteration scheme used is a fully implicit approximate factorization technique and provides a significant improvement in convergence speed relative to standard successive line overrelaxation algorithms. The spatial differencing algorithm is centrally differenced in both subsonic and supersonic regions to maintain stability. This effectively approximates rotated differencing, thereby greatly improving the reliability of the algorithm.

Holst, T.↗

Comparison of Euler and full potential marching techniques for flows over complex configurations

Two recently developed aerodynamic prediction techniques based on the steady full potential equation and the unsteady Euler equations have been applied to a variety of three-dimensional supersonic flow problems exhibiting embedded subsonic regions. Both techniques utilize planar Gauss-Seidel relaxation in the marching direction and approximate factorization in the cross-flow plane. A conservative switching scheme and flux bias technique are employed in the full potential method to transition from the supersonic marching procedure to a subsonic relaxation algorithm and vice versa. A new unified approach with finite volume, high accuracy (up to third order) Total Variation Diminishing formulation (based on Roe's scheme) is used in the Euler solver. In the supersonic regions of the flow an 'infinitely large' time step is employed, and a finite time step is applied in the subsonic regions of the flow to reach the steady-state as a time-asymptote. Numerical solutions are obtained for a number of complex configurations, including: (1) an elliptic waverider, (2) a realistic fighter configuration, (3) the Space Shuttle, and (4) a Shuttle-like configuration. Both the Full Potential and Euler numerical results are in good agreement with available experimental data.

Szema, K. Y.↗

Relaxation and approximate factorization methods for the unsteady full potential equation

The unsteady form of the full potential equation is solved in conservation form, using implicit methods based on approximate factorization and relaxation schemes. A local time linearization for density is introduced to enable solution to the equation in terms of phi, the velocity potential. A novel flux-biasing technique is applied to generate proper forms of the artificial viscosity, to treat hyperbolic regions with shocks and sonic lines present. The wake is properly modeled by accounting not only for jumps in phi, but also for jumps in higher derivatives of phi obtained from requirements of density continuity. The far field is modeled using the Riemann invariants to simulate nonreflecting boundary conditions. Results are presented for flows over airfoils, cylinders, and spheres. Comparisons are made with available Euler and full potential results.

Shankar, V.↗

Can theory quantitatively model stratospheric photolysis? Ab initio estimate of absolute absorption cross sections of ClOOCl

We have calculated the absorption spectrum of dichlorine peroxide (ClOOCl) in the spectral range 250-400 nm. We have employed five different approaches to quantitatively model the absorption cross section (empirical broadening scheme, linearized harmonic reflection principle and full reflection principle with ground state density calculated using harmonic approximation, classical molecular dynamics, and path-integral molecular dynamics). We have also tested various single and multireference methods. We found that (i) the excitation characteristics of ClOOCl are sensitive on molecular geometries and therefore the ground state density has to be properly sampled and that (ii) single-reference methods tend to overestimate the absorption cross section and lead to a blueshift in the absorption maximum. The absorption spectrum calculated at the CASPT2 level with complete active space-configuration interaction (CAS-SCF) transition dipole moment with the ground state sampled via path-integral molecular dynamics is in a good agreement with the experiment. We, however, did not reach full agreement in the atmospherically relevant low-energy tail of the spectrum. The general message is that quantitative predictions are difficult even for a relatively small molecule as ClOOCl and the convergence, with respect to the electronic structure method, basis set used, and ground state sampling, needs to be carefully examined.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FULLY GENERAL RELATIVISTIC SIMULATIONS OF CORE-COLLAPSE SUPERNOVAE WITH AN APPROXIMATE NEUTRINO TRANSPORT

We present results from the first generation of multi-dimensional hydrodynamic core-collapse simulations in full general relativity (GR) that include an approximate treatment of neutrino transport. Using an M1 closure scheme with an analytic variable Eddington factor, we solve the energy-independent set of radiation energy and momentum based on the Thorne's momentum formalism. Our newly developed code is designed to evolve the Einstein field equation together with the GR radiation hydrodynamic equations. We follow the dynamics starting from the onset of gravitational core collapse of a 15 M{sub Sun} star, through bounce, up to about 100 ms postbounce in this study. By computing four models that differ according to 1D to 3D and by switching from special relativistic (SR) to GR hydrodynamics, we study how the spacial multi-dimensionality and GR would affect the dynamics in the early postbounce phase. Our 3D results support the anticipation in previous 1D results that the neutrino luminosity and average neutrino energy of any neutrino flavor in the postbounce phase increase when switching from SR to GR hydrodynamics. This is because the deeper gravitational well of GR produces more compact core structures, and thus hotter neutrino spheres at smaller radii. By analyzing the residency timescale to the neutrino-heating timescale in the gain region, we show that the criterion to initiate neutrino-driven explosions can be most easily satisfied in 3D models, irrespective of SR or GR hydrodynamics. Our results suggest that the combination of GR and 3D hydrodynamics provides the most favorable condition to drive a robust neutrino-driven explosion.

79 ASTRONOMY AND ASTROPHYSICS↗

On the Coupling of CDISC Design Method with FPX Rotor Code

A rotor section aerodynamics design package is developed by coupling Constrained Direct Iterative Surface Curvature (CDISC) design method with the FPX rotor code. The coupling between the CDISC design and the FPX flow analysis is fully automated. The CDISC design method employs a predictor-corrector procedure iteratively to determine a surface geometry which produces a target pressure distribution, where the target pressure distributions is either pre-defined or automatically generated through flow and geometry constraints. The FPX code is an eXtended Full-Potential rotor Computational Fluid Dynamics (CFD) code, which solves the three-dimensional unsteady full-potential equation in a strong conservative form using an implicit approximate factorization finite-difference scheme with entropy and viscosity corrections. Application of the CDISC design method coupled with the FPX rotor code is made for rotor blades in hovering motions. Several design examples are presented to demonstrate the capability of the new package in rotor section design.

Hu, Hong↗

A fast, time-accurate unsteady full potential scheme

The unsteady form of the full potential equation is solved in conservation form by an implicit method based on approximate factorization. At each time level, internal Newton iterations are performed to achieve time accuracy and computational efficiency. A local time linearization procedure is introduced to provide a good initial guess for the Newton iteration. A novel flux-biasing technique is applied to generate proper forms of the artificial viscosity to treat hyperbolic regions with shocks and sonic lines present. The wake is properly modeled by accounting not only for jumps in phi, but also for jumps in higher derivatives of phi, obtained by imposing the density to be continuous across the wake. The far field is modeled using the Riemann invariants to simulate nonreflecting boundary conditions. The resulting unsteady method performs well which, even at low reduced frequency levels of 0.1 or less, requires fewer than 100 time steps per cycle at transonic Mach numbers. The code is fully vectorized for the CRAY-XMP and the VPS-32 computers.

Shankar, V.↗

Initial Thrust Measurements of Marshall's Ion-ioN Thruster

Electronegative ion thrusters are a variation of traditional gridded ion thruster technology differentiated by the production and acceleration of both positive and negative ions. Benefits of electronegative ion thrusters include the elimination of lifetime-limiting cathodes from the thruster architecture and the ability to generate appreciable thrust from both charge species. While much progress has been made in the development of electronegative ion thruster technology, direct thrust measurements are required to unambiguously demonstrate the efficacy of the concept and support continued development. In the present work, direct thrust measurements of the thrust produced by the MINT (Marshall's Ion-ioN Thruster) are performed using an inverted-pendulum thrust stand in the High-Power Electric Propulsion Laboratory's Vacuum Test Facility-1 at the Georgia Institute of Technology with operating pressures ranging from 4.8 x 10(exp -5) and 5.7 x 10(exp -5) torr. Thrust is recorded while operating with a propellant volumetric mixture ratio of 5:1 argon to nitrogen with total volumetric flow rates of 6, 12, and 24 sccm (0.17, 0.34, and 0.68 mg/s). Plasma is generated using a helical antenna at 13.56 MHz and radio frequency (RF) power levels of 150 and 350 W. The acceleration grid assembly is operated using both sinusoidal and square waveform biases of +/-350 V at frequencies of 4, 10, 25, 125, and 225 kHz. Thrust is recorded for two separate thruster configurations: with and without the magnetic filter. No thrust is discernable during thruster operation without the magnetic filter for any volumetric flow rate, RF forward Power level, or acceleration grid biasing scheme. For the full thruster configuration, with the magnetic filter installed, a brief burst of thrust of approximately 3.75 mN +/- 3 mN of error is observed at the start of grid operation for a volumetric flow rate of 24 sccm at 350 W RF power using a sinusoidal waveform grid bias at 125 kHz and +/- 350 V. Similar bursts in thrust are observed using a square waveform grid bias at 10 kHz and +/- 350 V for volumetric flow rates of 6, 10, and 12 sccm at 150, 350, and 350 W respectively. The only operating condition that exhibits repeated thrust spikes throughout thruster operation is the 24 sccm condition with a 5:1 mixture ratio at 150 W RF power using the 10 kHz square waveform acceleration grid bias. Thrust spikes for this condition measure 3 mN with an error of +/- 2.5 mN. There are no operating conditions tested that show continuous thrust production.

Caruso, Natalie R. S.↗

Stability analysis of intermediate boundary conditions in approximate factorization schemes

The paper discusses the role of the intermediate boundary condition in the AF2 scheme used by Holst for simulation of the transonic full potential equation. It is shown that the treatment suggested by Holst led to a restriction on the time step and ways to overcome this restriction are suggested. The discussion is based on the theory developed by Gustafsson, Kreiss, and Sundstrom and also on the von Neumann method.

South, J. C., Jr.↗

Full self-consistency versus quasiparticle self-consistency in diagrammatic approaches: Exactly solvable two-site Hubbard model

Self-consistent solutions of Hedin's equations (HE) for the two-site Hubbard model (HM) have been studied. They have been found for three-point vertices of increasing complexity (Γ = 1 (GW approximation), Γ₁ from the first-order perturbation theory, and the exact vertex Γ E ). Comparison is made between the cases when an additional quasiparticle (QP) approximation for Green's functions is applied during the self-consistent iterative solving of HE and when QP approximation is not applied. Results obtained with the exact vertex are directly related to the present open question—which approximation is more advantageous for future implementations, GW + DMFT or QPGW + DMFT. It is shown that in a regime of strong correlations only the originally proposed GW + DMFT scheme is able to provide reliable results. Vertex corrections based on Perturbation Theory systematically improve the GW results when full self-consistency is applied. The application of QP self-consistency combined with PT vertex corrections shows similar problems to the case when the exact vertex is applied combined with QP sc. An analysis of Ward Identity violation is performed for all studied in this work's approximations and its relation to the general accuracy of the schemes used is provided.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

On some numerical schemes for transonic flow problems

New second-order-accurate finite-difference approximations for a class of nonlinear PDEs of mixed type, which includes the two-dimensional low-frequency transonic small-disturbance equation (TSD) and full-potential equation (FP), are presented. For the TSD equation, the scheme is implemented via a time-splitting algorithm; the inclusion of flux limiters keeps the total variation nonincreasing and eliminates spurious oscillations near shocks. Global-linear-stability, TVD, and entropy-stability results are proved. Numerical results for the flow over a thin airfoil are presented. Current techniques used to solve the TSD equation may easily be extended to second-order accuracy by this method. For the FP equation, the new scheme requires no subsonic/supersonic switching and no numerical flux biasing. Global linear stability for all values of the Mach number is proved.

Mostrel, Marco Mosche↗

Dynamic Quantum Clustering: A Tool for Unsupervised Exploration of Structures in Data

A given set of data-points in some feature space may be associated with a Schroedinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged dynamical scheme using a time-dependent Schroedinger equation with a small diffusion component. Moreover, we approximate this Hamiltonian formalism by a truncated calculation within a set of Gaussian wave functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗