Search NASA⌕ Search

SEARCH · Search NASA

Results for “Basis function”

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 541 records · Page 30

Magnetizability and rotational g tensors for density fitted local second-order Møller-Plesset perturbation theory using gauge-including atomic orbitals

In this paper, we present theory and implementation of an efficient program for calculating magnetizabilities and rotational g tensors of closed-shell molecules at the level of local second-order Møller-Plesset perturbation theory (MP2) using London orbitals. Density fitting is employed to factorize the electron repulsion integrals with ordinary Gaussians as fitting functions. The presented program for the calculation of magnetizabilities and rotational g tensors is based on a previous implementation of NMR shielding tensors reported by S. Loibl and M. Schütz [J. Chem. Phys. 137, 084107 (2012)]. Extensive test calculations show (i) that the errors introduced by density fitting are negligible, and (ii) that the errors of the local approximation are still rather small, although larger than for nuclear magnetic resonance (NMR) shielding tensors. Electron correlation effects for magnetizabilities are tiny for most of the molecules considered here. MP2 appears to overestimate the correlation contribution of magnetizabilities such that it does not constitute an improvement over Hartree-Fock (when comparing to higher-order methods like CCSD(T)). For rotational g tensors the situation is different and MP2 provides a significant improvement in accuracy over Hartree-Fock. The computational performance of the new program was tested for two extended systems, the larger comprising about 2200 basis functions. It turns out that a magnetizability (or rotational g tensor) calculation takes about 1.5 times longer than a corresponding NMR shielding tensor calculation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exponential Approximations Using Fourier Series Partial Sums

The problem of accurately reconstructing a piece-wise smooth, 2(pi)-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. It is conjectured that the locations of the singularities are approximated to within O(N(sup -M-2), and the associated jump of the k(sup th) derivative of f is approximated to within O(N(sup -M-l+k), as N approaches infinity, and the method is robust. These estimates are then used with a class of singular basis functions, which have certain 'built-in' singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M approaches infinity. The technique is illustrated with several examples.

Banerjee, Nana S.↗

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗

Combined Uncertainty and A-Posteriori Error Bound Estimates for General CFD Calculations: Theory and Software Implementation

This workshop presentation discusses the design and implementation of numerical methods for the quantification of statistical uncertainty, including a-posteriori error bounds, for output quantities computed using CFD methods. Hydrodynamic realizations often contain numerical error arising from finite-dimensional approximation (e.g. numerical methods using grids, basis functions, particles) and statistical uncertainty arising from incomplete information and/or statistical characterization of model parameters and random fields. The first task at hand is to derive formal error bounds for statistics given realizations containing finite-dimensional numerical error [1]. The error in computed output statistics contains contributions from both realization error and the error resulting from the calculation of statistics integrals using a numerical method. A second task is to devise computable a-posteriori error bounds by numerically approximating all terms arising in the error bound estimates. For the same reason that CFD calculations including error bounds but omitting uncertainty modeling are only of limited value, CFD calculations including uncertainty modeling but omitting error bounds are only of limited value. To gain maximum value from CFD calculations, a general software package for uncertainty quantification with quantified error bounds has been developed at NASA. The package provides implementations for a suite of numerical methods used in uncertainty quantification: Dense tensorization basis methods [3] and a subscale recovery variant [1] for non-smooth data, Sparse tensorization methods[2] utilizing node-nested hierarchies, Sampling methods[4] for high-dimensional random variable spaces.

CFD↗

Electronic and thermoelectric properties of InN studied using ab initio density functional theory and Boltzmann transport calculations

The thermoelectric properties of indium nitride in the most stable wurtzite phase (w-InN) as a function of electron and hole concentrations and temperature were studied by solving the semiclassical Boltzmann transport equations in conjunction with ab initio electronic structure calculations, within Density Functional Theory. Based on maximally localized Wannier function basis set and the ab initio band energies, results for the Seebeck coefficient are presented and compared with available experimental data for n-type as well as p-type systems. Also, theoretical results for electric conductivity and power factor are presented. Most cases showed good agreement between the calculated properties and experimental data for w-InN unintentionally and p-type doped with magnesium. Our predictions for temperature and concentration dependences of electrical conductivity and power factor revealed a promising use of InN for intermediate and high temperature thermoelectric applications. The rigid band approach and constant scattering time approximation were utilized in the calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient calculation of nuclear spin-rotation constants from auxiliary density functional theory

The computation of the spin-rotation tensor within the framework of auxiliary density functional theory (ADFT) in combination with the gauge including atomic orbital (GIAO) scheme, to treat the gauge origin problem, is presented. For the spin-rotation tensor, the calculation of the magnetic shielding tensor represents the most demanding computational task. Employing the ADFT-GIAO methodology, the central processing unit time for the magnetic shielding tensor calculation can be dramatically reduced. In this work, the quality of spin-rotation constants obtained with the ADFT-GIAO methodology is compared with available experimental data as well as with other theoretical results at the Hartree-Fock and coupled-cluster level of theory. It is found that the agreement between the ADFT-GIAO results and the experiment is good and very similar to the ones obtained by the coupled-cluster single-doubles-perturbative triples-GIAO methodology. With the improved computational performance achieved, the computation of the spin-rotation tensors of large systems or along Born-Oppenheimer molecular dynamics trajectories becomes feasible in reasonable times. Three models of carbon fullerenes containing hundreds of atoms and thousands of basis functions are used for benchmarking the performance. Furthermore, a theoretical study of temperature effects on the structure and spin-rotation tensor of the H{sup 12}C–{sup 12}CH–DF complex is presented. Here, the temperature dependency of the spin-rotation tensor of the fluorine nucleus can be used to identify experimentally the so far unknown bent isomer of this complex. To the best of our knowledge this is the first time that temperature effects on the spin-rotation tensor are investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Excited-state electronic structure of molecules using many-body Green’s functions: Quasiparticles and electron–hole excitations with VOTCA-XTP

Here, we present the open-source VOTCA-XTP software for the calculation of the excited-state electronic structure of molecules using many-body Green’s function theory in the GW approximation with the Bethe–Salpeter equation (BSE). This work provides a summary of the underlying theory and discusses the details of its implementation based on Gaussian orbitals, including resolution-of-identity techniques and different approaches to the frequency integration of the self-energy or acceleration by offloading compute-intensive matrix operations using graphics processing units in a hybrid OpenMP/Cuda scheme. A distinctive feature of VOTCA–XTP is the capability to couple the calculation of electronic excitations to a classical polarizable environment on an atomistic level in a coupled quantum- and molecular-mechanics (QM/MM) scheme, where a complex morphology can be imported from Molecular Dynamics simulations. The capabilities and limitations of the GW–BSE implementation are illustrated with two examples. First, we study the dependence of optically active electron–hole excitations in a series of diketopyrrolopyrrole-based oligomers on molecular-architecture modifications and the number of repeat units. Second, we use the GW–BSE/MM setup to investigate the effect of polarization on localized and intermolecular charge-transfer excited states in morphologies of low-donor content rubrene–fullerene mixtures. These showcases demonstrate that our implementation currently allows us to treat systems with up to 2500 basis functions on regular shared-memory workstations, providing accurate descriptions of quasiparticle and coupled electron–hole excited states of various characters on an equal footing.

74 ATOMIC AND MOLECULAR PHYSICS↗

Unbiased particle conformation extraction from scattering spectra using orthonormal basis expansions

A strategy is outlined for quantitatively evaluating the particle density profiles from small-angle scattering spectra of dilute solutions. The approach employs an orthonormal basis function expansion method, enabling the determination of characteristic mass distributions in self-assembled structures without the need for a specific structural model. Through computational benchmarking, the efficacy of this approach is validated by effectively reconstructing the density profile of soft-ball systems with varying fuzziness from their scattering signatures. Further, the feasibility of the method is demonstrated by fitting small-angle neutron scattering data obtained from Pluronic L64 micelles at different temperatures. This proposed approach is both simple and analytical, eliminating the requirement for a presumptive structural model in scattering analysis. The new method could therefore facilitate quantitative descriptions of complex nanoscopic structures inherent to numerous soft-matter systems using small-angle scattering techniques.

36 MATERIALS SCIENCE↗

Evolvable Neural Software System

The Evolvable Neural Software System (ENSS) is composed of sets of Neural Basis Functions (NBFs), which can be totally autonomously created and removed according to the changing needs and requirements of the software system. The resulting structure is both hierarchical and self-similar in that a given set of NBFs may have a ruler NBF, which in turn communicates with other sets of NBFs. These sets of NBFs may function as nodes to a ruler node, which are also NBF constructs. In this manner, the synthetic neural system can exhibit the complexity, three-dimensional connectivity, and adaptability of biological neural systems. An added advantage of ENSS over a natural neural system is its ability to modify its core genetic code in response to environmental changes as reflected in needs and requirements. The neural system is fully adaptive and evolvable and is trainable before release. It continues to rewire itself while on the job. The NBF is a unique, bilevel intelligence neural system composed of a higher-level heuristic neural system (HNS) and a lower-level, autonomic neural system (ANS). Taken together, the HNS and the ANS give each NBF the complete capabilities of a biological neural system to match sensory inputs to actions. Another feature of the NBF is the Evolvable Neural Interface (ENI), which links the HNS and ANS. The ENI solves the interface problem between these two systems by actively adapting and evolving from a primitive initial state (a Neural Thread) to a complicated, operational ENI and successfully adapting to a training sequence of sensory input. This simulates the adaptation of a biological neural system in a developmental phase. Within the greater multi-NBF and multi-node ENSS, self-similar ENI s provide the basis for inter-NBF and inter-node connectivity.

Curtis, Steven A.↗

Multinode Multi-GPU Two-Electron Integrals: Code Generation Using the Regent Language

The computation of two-electron repulsion integrals (ERIs) is often the most expensive step of integral-direct self-consistent field methods. Formally it scales as O(N 4 ), where N is the number of Gaussian basis functions used to represent the molecular wave function. In practice, this scaling can be reduced to O(N 2 ) or less by neglecting small integrals with screening methods. The contributions of the ERIs to the Fock matrix are of Coulomb (J) and exchange (K) type and require separate algorithms to compute matrix elements efficiently. We previously implemented highly efficient GPU-accelerated J-matrix and K-matrix algorithms in the electronic structure code TeraChem. Although these implementations supported the use of multiple GPUs on a node, they did not support the use of multiple nodes. This presents a key bottleneck to cutting-edge ab initio simulations of large systems, e.g., excited state dynamics of photoactive proteins. We present our implementation of multinode multi-GPU J- and K-matrix algorithms in TeraChem using the Regent programming language. Regent directly supports distributed computation in a task-based model and can generate code for a variety of architectures, including NVIDIA GPUs. We demonstrate multinode scaling up to 45 GPUs (3 nodes) and benchmark against hand-coded TeraChem integral code. Finally, we also outline our metaprogrammed Regent implementation, which enables flexible code generation for integrals of different angular momenta.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Predicting responses to climate change using a joint species, spatially dependent physiologically guided abundance model

Abstract Predicting the effects of warming temperatures on the abundance and distribution of organisms under future climate scenarios often requires extrapolating species–environment correlations to climatic conditions not currently experienced by a species, which can result in unrealistic predictions. For poikilotherms, incorporating species' thermal physiology to inform extrapolations under novel thermal conditions can result in more realistic predictions. Furthermore, models that incorporate species and spatial dependencies may improve predictions by capturing correlations present in ecological data that are not accounted for by predictor variables. Here, we present a joint species, spatially dependent physiologically guided abundance (jsPGA) model for predicting multispecies responses to climate warming. The jsPGA model uses a basis function approach to capture both species and spatial dependencies. We apply the jsPGA model to predict the response of eight fish species to projected climate warming in thousands of lakes in Minnesota, USA. By the end of the century, the cold‐adapted species was predicted to have high probabilities of extirpation across its current range—with 10% of lakes currently inhabited by this species having an extirpation probability >0.90. The remaining species had varying levels of predicted changes in abundance, reflecting differences in their thermal physiology. Though the model did not identify many strong species dependencies, the variation in estimated spatial dependence across species suggested that accounting for both dependencies was important for predicting the abundance of these fishes. The jsPGA model provides a new tool for predicting changes in the abundance, distribution, and extirpation probability of poikilotherms under novel thermal conditions.

54 ENVIRONMENTAL SCIENCES↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

Robust 3D multi-material hydrodynamics using discontinuous Galerkin methods

A high-order discontinuous Galerkin (DG) method is presented for nonequilibrium multi-material (m ≥ 2) flow with sharp interfaces. Material interfaces are reconstructed using the algebraic THINC approach, resulting in a sharp interface resolution. The system assumes stiff velocity relaxation and pressure nonequilibrium. The presented DG method uses Dubiner's orthogonal basis functions on tetrahedral elements. This results in a unique combination of sharp multimaterial interfaces and high-order accurate solutions in smooth single-material regions. A novel shock indicator based on the interface conservation condition is introduced to mark regions with discontinuities. Slope limiting techniques are applied only in these regions so that nonphysical oscillations are eliminated while maintaining high-order accuracy in smooth regions. A local projection is applied on the limited solution to ensure discrete closure law preservation. The effectiveness of this novel limiting strategy is demonstrated for complex three-dimensional multi-material problems, where robustness of the method is critical. The presented numerical problems demonstrate that more accurate and efficient multi-material solutions can be obtained by the DG method, as compared to second-order finite volume methods.

97 MATHEMATICS AND COMPUTING↗

The GPU-enabled divide-expand-consolidate RI-MP2 method (DEC-RI-MP2)

We report porting of the Divide-Expand-Consolidate Resolution of the Identity second-order Møller–Plesset perturbation (DEC-RI-MP2) method to the graphic processing units (GPUs) using OpenACC compiler directives. It is shown that the OpenACC compiler directives implementation efficiently accelerates the rate-determining step of the DEC-RI-MP2 method with minor implementation effort. Moreover, the GPU acceleration results in a better load balance and thus in an overall scaling improvement of the DEC algorithm. The resulting cross-platform hybrid MPI/OpenMP/OpenACC implementation has scalable and portable performance on heterogeneous HPC architectures. The GPU-enabled code was benchmarked using a reduced version of the S12L test set of Stefan Grimme (Grimme, Chem. Eur. J. 2012, 18, 9955) consisting of supramolecular complexes up to 158 atoms and 4292 contracted basis functions (cc-pVTZ). The test set results demonstrate the general applicability of the DEC-RI-MP2 method showing results consistent with the DEC-RI-MP2 introductory paper (Baudin et al., J. Chem. Phys. 2016, 144, 054102) on molecules of complicated electronic structures. © 2016 Wiley Periodicals, Inc.

Chemistry↗

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

Summary We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h ‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p ‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h ‐multigrid and p ‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.

Sundar, Hari↗

Matrix-free preconditioning for high-order H (curl) discretizations

The greater arithmetic intensity of high-order finite element discretizations makes them attractive for implementation on next-generation hardware, but assembly of high-order finite element operators as matrices is prohibitively expensive. As a result, the development of general algebraic solvers for such operators has been an open research challenge. Fast matrix-free application of high-order operators has received significant attention in the literature in the context of Poisson-type problems, but preconditioners and solvers for inverting more general operators are not very well-developed. In this paper, we consider the problem of preconditioning a definite Maxwell operator at high polynomial order without assembling a matrix. We show that given efficient preconditioners for high-order H 1 finite element problems on the same mesh, efficient H(curl) preconditioners can be constructed in an auxiliary space framework. We demonstrate the resulting preconditioners in a practical setting with tensor-product basis functions on an unstructured mesh of quadrilaterals. Overall, our approach uses a sparsified H 1 solver constructed on a low-order mesh of the nodal points of the underlying high-order space, and we show that the resulting H(curl) preconditioner is effective at very high polynomial orders for two-dimensional model problems with complicated geometry, varying piecewise constant coefficients, and curved elements. The resulting preconditioner scales with nearly optimal O(p d+1 ) floating point operation count and optimal O(p d ) memory transfer requirements, outperforming existing Maxwell preconditioners in the high-order regime.

97 MATHEMATICS AND COMPUTING↗

Dirichlet-type absorbing boundary conditions for peridynamic scalar waves in two-dimensional viscous media

Construction of absorbing boundary conditions (ABCs) for nonlocal models is generally challenging, primarily due to the fact that nonlocal operators are commonly associated with volume constrained boundary conditions. Moreover, application of Fourier and Laplace transforms, which are essential for the majority of available methods for ABCs, to nonlocal models is complicated. In this paper, we propose a simple method to construct accurate ABCs for peridynamic scalar wave-type problems in viscous media. The proposed ABCs are constructed in the time and space domains and are of Dirichlet type. Consequently, their implementation is relatively simple, since no derivatives of the wave field are required. The proposed ABCs are derived at the continuum level, from a semi-analytical solution of the exterior domain using harmonic exponential basis functions in space and time (plane-wave modes). The numerical implementation is done using a meshfree collocation approach employed within a boundary layer adjacent to the interior domain boundary. The modes satisfy the peridynamic numerical dispersion relation, resulting in a compatible solution of the interior region (near-field) with that of the exterior region (far-field). The accuracy and stability of the proposed ABCs are demonstrated with several numerical examples in two-dimensional unbounded domains.

42 ENGINEERING↗

Scale-adaptive tensor algebra for local many-body methods of electronic structure theory

While the formalism of multiresolution analysis (MRA), based on wavelets and adaptive integral representations of operators, is actively progressing in electronic structure theory (mostly on the independent-particle level and, recently, second-order perturbation theory), the concepts of multiresolution and adaptivity can also be utilized within the traditional formulation of correlated (many-particle) theory which is based on second quantization and the corresponding (generally nonorthogonal) tensor algebra. In this paper, we present a formalism called scale-adaptive tensor algebra (SATA) which exploits an adaptive representation of tensors of many-body operators via the local adjustment of the basis set quality. Given a series of locally supported fragment bases of a progressively lower quality, we formulate the explicit rules for tensor algebra operations dealing with adaptively resolved tensor operands. The formalism suggested is expected to enhance the applicability and reliability of local correlated many-body methods of electronic structure theory, especially those directly based on atomic orbitals (or any other localized basis functions).

Liakh, Dmitry I↗