Search NASA⌕ Search

SEARCH · Search NASA

Results for “orthogonal basis”

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 19 records

A fourth-order Lagrangian discontinuous Galerkin method using a hierarchical orthogonal basis on curvilinear grids

The existing high-order Lagrangian discontinuous Galerkin (DG) hydrodynamic methods are restricted to using quadratic meshes with quadratic polynomials (P2), which in turn, yield up to third-order accuracy. Additionally, these existing DG hydrodynamic schemes, when extended to work with cubic meshes and cubic polynomials (P3), can be unstable on strong-shock problems. Therefore, this paper presents a new Lagrangian discontinuous Galerkin (DG) hydrodynamic method to simulate compressible material dynamics ( e.g., gasses, fluids, and solids) with strong-shocks using cubic meshes and cubic polynomials, and delivers up to fourth-order accuracy on smooth flows. The stability on shock problems is achieved using new hierarchical orthogonal basis functions and a new subcell mesh stabilization (SMS) scheme for cubic meshes. The accuracy and robustness of the new high-order accurate Lagrangian DG hydrodynamic method is demonstrated by simulating a diverse suite of challenging test problems covering gas and solid dynamic problems on curvilinear meshes.

97 MATHEMATICS AND COMPUTING↗

Time-dependent density functional theory quantum transport simulation in non-orthogonal basis

Basing on the earlier works on the hierarchical equations of motion for quantum transport, we present in this paper a first principles scheme for time-dependent quantum transport by combining time-dependent density functional theory (TDDFT) and Keldysh's non-equilibrium Green's function formalism. This scheme is beyond the wide band limit approximation and is directly applicable to the case of non-orthogonal basis without the need of basis transformation. The overlap between the basis in the lead and the device region is treated properly by including it in the self-energy and it can be shown that this approach is equivalent to a lead-device orthogonalization. This scheme has been implemented at both TDDFT and density functional tight-binding level. Simulation results are presented to demonstrate our method and comparison with wide band limit approximation is made. Finally, the sparsity of the matrices and computational complexity of this method are analyzed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fully-Implicit Orthogonal Reconstructed Discontinuous Petrov-Galerkin Method for Multiphysics Problems

This document is focussed on the development of reconstructed discontinuous Galerkin (RDG P n P m ) method, based on orthogonal basis functions. Orthogonality of basis functions is essential for enabling robust and efficient fully-implicit Newton-Krylov based time discretization. The method is designed for generic partial differential equations, including transient hyperbolic, parabolic and/or elliptic operators, which are attributed to many multiphysics problems. Our driving application of interest is additive manufacturing, which requires simulations of fluid-solid-gas systems, with compressibility effects and phase change (melting/ solidification). Thus, we demonstrate the method capabilities for solving nonlinear heat conduction equation coupled with multi-material Navier-Stokes based compressible fluid (in low Mach number limit) systems. We focus our attention to the method accuracy (in both time and space), as well as solvability of linear algebra involved in linear steps of the Newton-based solver. We demonstrate the accuracy and efficacy of the method, emphasizing the advantages from the orthogonality of basis functions, which makes better conditioning of underlying (approximate) Jacobian matrices, and rapid convergence of Krylov methods. iii

97 MATHEMATICS AND COMPUTING↗

Alternative approach to quantum imaginary time evolution

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Perturbative second-order optical susceptibility of bulk materials: a symmetry-enforced return to non-orthogonal localized basis sets

The second-order optical susceptibility of semiconductors $\chi^{(2)}_{ijk}(-2\omega;\omega,\omega)$ finds application in metrology, spectroscopy, telecommunications, material characterization, and quantum information. Pioneering calculations of $\chi^{(2)}_{ijk}(-2\omega;\omega,\omega)$ utilized non-orthogonal Gaussian orbitals centered at atoms. That formulation transitioned into plane-wave-based algorithms as time went by. As of late, nevertheless, multiple tools for calculating optical susceptibilities have recast the problem using Wannier (i.e. localized) orbitals, making a comeback onto frameworks based on localized basis sets. Here, in this work, we present an approach for calculating $\chi^{(2)}_{ijk}(-2\omega;\omega,\omega)$ reliant on numerical pseudo-atomic orbitals (PAOs) within perturbation theory in the velocity gauge. Its salient feature is a calculation of ‘Slater–Koster-like’ two-center integrals of the momentum operator in between PAOs identified by symmetry. The approach was successfully tested on paradigmatic cubic silicon carbide (3C-SiC) and gallium arsenide, for which linear responses are contributed as well.

Huamán, Angiolo [Univ. of Arkansas, Fayetteville, ↗

Kinetic corrections from analytic non-Maxwellian distribution functions in magnetized plasmas

In magnetized plasma physics, almost all developed analytic theories assume a Maxwellian distribution function (MDF) and in some cases small deviations are described using the perturbation theory. The deviations with respect to the Maxwellian equilibrium, called kinetic effects, are required to be taken into account especially for fusion reactor plasmas. Generally, because the perturbation theory is not consistent with observed steady-state non-Maxwellians, these kinetic effects are numerically evaluated by very central processing unit (CPU)-expensive codes, avoiding the analytic complexity of velocity phase space integrals. We develop here a new method based on analytic non-Maxwellian distribution functions constructed from non-orthogonal basis sets in order to (i) use as few parameters as possible, (ii) increase the efficiency to model numerical and experimental non-Maxwellians, (iii) help to understand unsolved problems such as diagnostics discrepancies from the physical interpretation of the parameters, and (iv) obtain analytic corrections due to kinetic effects given by a small number of terms and removing the numerical error of the evaluation of velocity phase space integrals. This work does not attempt to derive new physical effects even if it could be possible to discover one from the better understandings of some unsolved problems, but here we focus on the analytic prediction of kinetic corrections from analytic non-Maxwellians. As applications, examples of analytic kinetic corrections are shown for the secondary electron emission, the Langmuir probe characteristic curve, and the entropy. This is done by using three analytic representations of the distribution function: the Kappa distribution function, the bi-modal or a new interpreted non-Maxwellian distribution function (INMDF). The existence of INMDFs is proved by new understandings of the experimental discrepancy of the measured electron temperature between two diagnostics in JET. As main results, it is shown that (i) the empirical formula for the secondary electron emission is not consistent with a MDF due to the presence of super-thermal particles, (ii) the super-thermal particles can replace a diffusion parameter in the Langmuir probe current formula, and (iii) the entropy can explicitly decrease in presence of sources only for the introduced INMDF without violating the second law of thermodynamics. Moreover, the first order entropy of an infinite number of super-thermal tails stays the same as the entropy of a MDF. The latter demystifies the Maxwell's demon by statistically describing non-isolated systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Time and Frequency Domain Methods for Basis Selection in Random Linear Dynamical Systems

Polynomial chaos methods have been extensively used to analyze systems in uncertainty quantification. Furthermore, several approaches exist to determine a low-dimensional approximation (or sparse approximation) for some quantity of interest in a model, where just a few orthogonal basis polynomials are required. In this work, we consider linear dynamical systems consisting of ordinary differential equations with random variables. The aim of this paper is to explore methods for producing low-dimensional approximations of the quantity of interest further. We investigate two numerical techniques to compute a low-dimensional representation, which both fit the approximation to a set of samples in the time domain. On the one hand, a frequency domain analysis of a stochastic Galerkin system yields the selection of the basis polynomials. It follows a linear least squares problem. On the other hand, a sparse minimization yields the choice of the basis polynomials by information from the time domain only. An orthogonal matching pursuit produces an approximate solution of the minimization problem. Finally, we compare the two approaches using a test example from a mechanical application.

97 MATHEMATICS AND COMPUTING↗

Online adaptive basis refinement and compression for reduced-order models via vector-space sieving

In many applications, projection-based reduced-order models (ROMs) have demonstrated the ability to provide rapid approximate solutions to high-fidelity full-order models (FOMs). However, there is no a priori assurance that these approximate solutions are accurate; their accuracy depends on the ability of the low-dimensional trial basis to represent the FOM solution. As a result, ROMs can generate inaccurate approximate solutions, e.g., when the FOM solution at the online prediction point is not well represented by training data used to construct the trial basis. To address this fundamental deficiency of standard model-reduction approaches, this work proposes a novel online-adaptive mechanism for efficiently enriching the trial basis in a manner that ensures convergence of the ROM to the FOM, yet does not incur any FOM solves. The mechanism is based on the previously proposed adaptive $h$-refinement method for ROMs, but improves upon this work in two crucial ways. First, the proposed method enables basis refinement with respect to any orthogonal basis (not just the Kronecker basis), thereby generalizing the refinement mechanism and enabling it to be tailored to the physics characterizing the problem at hand. Second, the proposed method provides a fast online algorithm for periodically compressing the enriched basis via an efficient proper orthogonal decomposition (POD) method, which does not incur any operations that scale with the FOM dimension. We report these two features allow the proposed method to serve as (1) a failsafe mechanism for ROMs, as the method enables the ROM to satisfy any prescribed error tolerance online (even in the case of inadequate training), and (2) an efficient online basis-adaptation mechanism, as the combination of basis enrichment and compression enables the basis to adapt online while controlling its dimension.

42 ENGINEERING↗

Gravity Gradiometry: A Novel Application for Compressed Sensing

During the past decade, compressed sensing (CS) has proven to be extremely useful for sparse signal reconstruction. Here the method of CS is applied to fast mass distribution determination based on cold atom gravity gradiometer measurements. Specifically we consider an array of M gradiometers placed around a 2D target area in order to determine the interior mass distribution in cases where the set of (M) sensor measurements under samples the distribution. This was done by assuming that the system’s sparsity comes from the mass distributions only having K non-zero masses, which led to a non-orthogonal basis dictionary. This lack of orthogonality caused interesting behaviors, including weakened noise performance, and breaking of the typical CS motivated logarithmic scaling of required M values for larger K values. However, for low K values M scaled as expected. Modifications to the gravity sensor model to promote orthogonality and test its impact on signal recovery postponed the onset of anomalous scaling; suggesting that lack of orthogonality is the primary cause. While CS works for this sparse, but intrinsically ill-posed problem, this sensor system displayed increased noise sensitivity and a smaller upper bound on the size of recoverable K sets. However, while these limitations decrease CS performance, significant improvements over traditional sensing approaches are still possible.

74 ATOMIC AND MOLECULAR PHYSICS↗

Basis adaptive sample efficient polynomial chaos (BASE-PC)

For a large class of orthogonal basis functions, there has been a recent identification of expansion methods for computing accurate, stable approximations of a quantity of interest. Here this paper presents, within the context of uncertainty quantification, a practical implementation using basis adaptation, and coherence motivated sampling, which under assumptions has satisfying guarantees. This implementation is referred to as Basis Adaptive Sample Efficient Polynomial Chaos (BASE-PC). A key component of this is the use of anisotropic polynomial order which admits evolving global bases for approximation in an efficient manner, leading to consistently stable approximation for a practical class of smooth functionals. This fully adaptive, non-intrusive method, requires no a priori information of the solution, and has satisfying theoretical guarantees of recovery. A key contribution to stability is the use of a presented correction sampling for coherence-optimal sampling in order to improve stability and accuracy within the adaptive basis scheme. Theoretically, the method may dramatically reduce the impact of dimensionality in function approximation, and numerically the method is demonstrated to perform well on problems with dimension up to 1000.

97 MATHEMATICS AND COMPUTING↗

A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations I: Derivation and algorithms

We propose a dynamically bi-orthogonal method (DyBO) to solve time dependent stochastic partial differential equations (SPDEs). The objective of our method is to exploit some intrinsic sparse structure in the stochastic solution by constructing the sparsest representation of the stochastic solution via a bi-orthogonal basis. It is well-known that the Karhunen–Loeve expansion (KLE) minimizes the total mean squared error and gives the sparsest representation of stochastic solutions. However, the computation of the KL expansion could be quite expensive since we need to form a covariance matrix and solve a large-scale eigenvalue problem. The main contribution of this paper is that we derive an equivalent system that governs the evolution of the spatial and stochastic basis in the KL expansion. Unlike other reduced model methods, our method constructs the reduced basis on-the-fly without the need to form the covariance matrix or to compute its eigendecomposition. In the first part of our paper, we introduce the derivation of the dynamically bi-orthogonal formulation for SPDEs, discuss several theoretical issues, such as the dynamic bi-orthogonality preservation and some preliminary error analysis of the DyBO method. We also give some numerical implementation details of the DyBO methods, including the representation of stochastic basis and techniques to deal with eigenvalue crossing. In the second part of our paper [11], we will present an adaptive strategy to dynamically remove or add modes, perform a detailed complexity analysis, and discuss various generalizations of this approach. An extensive range of numerical experiments will be provided in both parts to demonstrate the effectiveness of the DyBO method.

97 MATHEMATICS AND COMPUTING↗

Comment on “Rethinking first-principles electron transport theories with projection operators: The problems caused by partitioning the basis set” [J. Chem. Phys. 139, 114104 (2013)]

In a recent paper Reuter and Harrison [J. Chem. Phys. 139, 114104 (2013)] question the widely used mean-field electron transport theories, which employ nonorthogonal localized basis sets. They claim these can violate an “implicit decoupling assumption,” leading to wrong results for the current, different from what would be obtained by using an orthogonal basis, and dividing surfaces defined in real-space. We argue that this assumption is not required to be fulfilled to get exact results. We show how the current/transmission calculated by the standard Greens function method is independent of whether or not the chosen basis set is nonorthogonal, and that the current for a given basis set is consistent with divisions in real space. The ambiguity known from charge population analysis for nonorthogonal bases does not carry over to calculations of charge flux.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chern-Simons gravity with (curvature){sup 2} and (torsion){sup 2} terms and a basis of degree-of-freedom projection operators

The effects of (curvature){sup 2}- and (torsion){sup 2}-terms in the Einstein-Hilbert-Chern-Simons Lagrangian are investigated. The purposes are two-fold: (i) to show the efficacy of an orthogonal basis of degree-of-freedom projection operators recently proposed and to ascertain its adequacy for obtaining propagators of general parity-breaking gravity models in three dimensions; (ii) to analyze the role of the topological Chern-Simons term for the unitarity and the particle spectrum of the model squared-curvature terms in connection with dynamical torsion. Our conclusion is that the Chern-Simons term does not influence the unitarity conditions imposed on the parameters of the Lagrangian but significantly modifies the particle spectrum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The static response function in Kohn-Sham theory: An appropriate basis for its matrix representation in case of finite AO basis sets

The role of the static Kohn-Sham (KS) response function describing the response of the electron density to a change of the local KS potential is discussed in both the theory of the optimized effective potential (OEP) and the so-called inverse Kohn-Sham problem involving the task to find the local KS potential for a given electron density. In a general discussion of the integral equation to be solved in both cases, it is argued that a unique solution of this equation can be found even in case of finite atomic orbital basis sets. It is shown how a matrix representation of the response function can be obtained if the exchange-correlation potential is expanded in terms of a Schmidt-orthogonalized basis comprising orbitals products of occupied and virtual orbitals. The viability of this approach in both OEP theory and the inverse KS problem is illustrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗

A Generative Model for Realistic Galaxy Cluster X-Ray Morphologies

Abstract The X-ray morphologies of clusters of galaxies display significant variations, reflecting their dynamical histories and the nonlinear dependence of X-ray emissivity on the density of the intracluster gas. Qualitative and quantitative assessments of X-ray morphology have long been considered a proxy for determining whether clusters are dynamically active or “relaxed.” Conversely, the use of circularly or elliptically symmetric models for cluster emission can be complicated by the variety of complex features realized in nature, spanning scales from megaparsecs down to the resolution limit of current X-ray observatories. In this work, we use mock X-ray images from simulated clusters from The Three Hundred project to define a basis set of cluster image features. We take advantage of the clusters’ approximate self-similarity to minimize the differences between images before encoding the remaining diversity through a distribution of high-order polynomial coefficients. Principal component analysis then provides an orthogonal basis for this distribution, corresponding to natural perturbations from an average model. This representation allows novel, realistically complex X-ray cluster images to be easily generated, and we provide code to do so. The approach provides a simple way to generate training data for cluster image analysis algorithms and could be straightforwardly adapted to generate clusters displaying specific types of features or selected by physical characteristics available in the original simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗

Extension of the discrete generalized multigroup method using SPH factors

The discrete generalized multigroup (DGM) method provides a way to treat the energy dependence of neutron transport similarly to the standard multigroup approximation. However, DGM uses an orthogonal basis to retain the energy dependence in higher-order terms. Using correction factors similar to traditional Superhomogénéisation (SPH) factors, the DGM method may be extended to produce cross sections that are homogenized over both space and energy. Additionally, since some fine-group energy dependence is retained, the resulting homogenized cross sections are more problem-independent than cross sections homogenized by SPH factors alone. In particular, a 44-group set of cross sections is collapsed to approximately a 1% error in the pincell fission densities for a test problem using three DOF per coarse energy group.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Low-synch Gram–Schmidt with delayed reorthogonalization for Krylov solvers

The parallel strong-scaling of iterative methods is often determined by the number of global reductions at each iteration. Low-synch Gram-Schmidt algorithms are applied here to the Arnoldi algorithm to reduce the number of global reductions and therefore to improve the parallel strong-scaling of iterative solvers for nonsymmetric matrices such as the GMRES and the Krylov-Schur iterative methods. In the Arnoldi context, the factorization is "left-looking" and processes one column at a time. Among the methods for generating an orthogonal basis for the Arnoldi algorithm, the classical Gram-Schmidt algorithm, with reorthogonalization (CGS2) requires three global reductions per iteration. A new variant of CGS2 that requires only one reduction per iteration is presented and applied to the Arnoldi algorithm. Delayed CGS2 (DCGS2) employs the minimum number of global reductions per iteration (one) for a one-column at-a-time algorithm. The main idea behind the new algorithm is to group global reductions by rearranging the order of operations. DCGS2 must be carefully integrated into an Arnoldi expansion or a GMRES solver. Numerical stability experiments assess robustness for Krylov-Schur eigenvalue computations. Performance experiments on the ORNL Summit supercomputer then establish the superiority of DCGS2 over CGS2.

97 MATHEMATICS AND COMPUTING↗