Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive basis set”

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

An Orbital Basis Set for Double Photoionization of Atoms and Molecules

The ab initio theoretical treatment of one-photon double photoionization processes has been limited to atoms and diatomic molecules by the challenges posed by large grid-based representations of the double ionized continuum wave function. To provide a path for extensions to polyatomics, an energy-adapted orbital basis approach is demonstrated that reduces the dimensions of such representations and simultaneously allows larger time steps in time-dependent computational descriptions of double ionization. Additionally, an algorithm that exploits the diagonal nature of the two-electron integrals in the grid basis and dramatically accelerates the transformation between grid and orbital representations is presented. Excellent agreement between the present results and benchmark theoretical calculations is found for H – and Be atoms, as well as the hydrogen molecule, including for the triply differential cross sections that relate the angular distribution and energy sharing of all of the particles in the molecular frame.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Molecular NMR shieldings, J -couplings, and magnetizabilities from numeric atom-centered orbital based density-functional calculations

This paper reports and benchmarks a new implementation of nuclear magnetic resonance shieldings, magnetizabilities, and J-couplings for molecules within semilocal density functional theory, based on numeric atom-centered orbital (NAO) basis sets. NAO basis sets are attractive for the calculation of these nuclear magnetic resonance (NMR) parameters because NAOs provide accurate atomic orbital representations especially near the nucleus, enabling high-quality results at modest computational cost. Moreover, NAOs are readily adaptable for linear scaling methods, enabling efficient calculations of large systems. Here, the paper has five main parts: (1) It reviews the formalism of density functional calculations of NMR parameters in one comprehensive text to make the mathematical background available in a self-contained way. (2) The paper quantifies the attainable precision of NAO basis sets for shieldings in comparison to specialized Gaussian basis sets, showing similar performance for similar basis set size. (3) The paper quantifies the precision of calculated magnetizabilities, where the NAO basis sets appear to outperform several established Gaussian basis sets of similar size. (4) The paper quantifies the precision of computed J-couplings, for which a group of customized NAO basis sets achieves precision of ~Hz for smaller basis set sizes than some established Gaussian basis sets. (5) The paper demonstrates that the implementation is applicable to systems beyond 1000 atoms in size.

74 ATOMIC AND MOLECULAR PHYSICS↗

Gravitational lens modeling with basis sets

We present a strong lensing modeling technique based on versatile basis sets for the lens and source planes. Our method uses high performance Monte Carlo algorithms, allows for an adaptive build up of complexity, and bridges the gap between parametric and pixel based reconstruction methods. We apply our method to a Hubble Space Telescope image of the strong lens system RX J1131-1231 and show that our method finds a reliable solution and is able to detect substructure in the lens and source planes simultaneously. Using mock data, we show that our method is sensitive to sub-clumps with masses four orders of magnitude smaller than the main lens, which corresponds to about 10{sup 8}M{sub ⊙}, without prior knowledge of the position and mass of the sub-clump. The modeling approach is flexible and maximizes automation to facilitate the analysis of the large number of strong lensing systems expected in upcoming wide field surveys. The resulting search for dark sub-clumps in these systems, without mass-to-light priors, offers promise for probing physics beyond the standard model in the dark matter sector.

79 ASTRONOMY AND ASTROPHYSICS↗

A computational methodology for learning low-complexity surrogate models of process from experiments or simulations. (Paper 679a)

Costly and/or insufficiently robust simulations or experiments can often pose difficulties when their use extends well beyond a single evaluation. This is case with the numerous evaluations of uncertainty quantification, when an algebraic model is needed for optimization, as well as numerous other areas. To overcome these difficulties, we generate an accurate set of algebraic surrogate models of disaggregated process blocks of the experiment or simulation. We developed a method that uses derivative-based and derivative-free optimization alongside machine learning and statistical techniques to generate the set of surrogate models using data sampled from experiments or detailed simulations. Our method begins by building a low-complexity surrogate model for each block from an initial sample set. The model is built using a best subset technique that leverages a mixed-integer linear problem formulation to allow for very large initial basis sets. The models are then tested, exploited, and improved through the use of derivative-free solvers to adaptively sample new simulation or experimental points. The sets of surrogate models from each disaggregated process block are then combined with heat and mass balances around each disaggregated block to generate a full algebraic model of the process. The full model can be used for cheap and accurate evaluations of the original simulation or experiment or combined with design specifications and an objective for nonlinear optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

The demand for accurate and computationally affordable sensitivity and uncertainty techniques is constantly on the rise and has become especially pressing in the nuclear field with the shift to Best Estimate Plus Uncertainty methodologies in the licensing of nuclear installations. Besides traditional, already well developed methods – such as first order perturbation theory or Monte Carlo sampling – Polynomial Chaos Expansion (PCE) has been given a growing emphasis in recent years due to its simple application and good performance. This paper presents new developments of the research done at TU Delft on such Polynomial Chaos (PC) techniques. Our work is focused on the Non-Intrusive Spectral Projection (NISP) approach and adaptive methods for building the PCE of responses of interest. Recent efforts resulted in a new adaptive sparse grid algorithm designed for estimating the PC coefficients. The algorithm is based on Gerstner's procedure for calculating multi-dimensional integrals but proves to be computationally significantly cheaper, while at the same it retains a similar accuracy as the original method. More importantly the issue of basis adaptivity has been investigated and two techniques have been implemented for constructing the sparse PCE of quantities of interest. Not using the traditional full PC basis set leads to further reduction in computational time since the high order grids necessary for accurately estimating the near zero expansion coefficients of polynomial basis vectors not needed in the PCE can be excluded from the calculation. Moreover the sparse PC representation of the response is easier to handle when used for sensitivity analysis or uncertainty propagation due to the smaller number of basis vectors. The developed grid and basis adaptive methods have been implemented in Matlab as the Fully Adaptive Non-Intrusive Spectral Projection (FANISP) algorithm and were tested on four analytical problems. These show consistent good performance both in terms of the accuracy of the resulting PC representation of quantities and the computational costs associated with constructing the sparse PCE. Basis adaptivity also seems to make the employment of PC techniques possible for problems with a higher number of input parameters (15–20), alleviating a well known limitation of the traditional approach. The prospect of larger scale applicability and the simplicity of implementation makes such adaptive PC algorithms particularly appealing for the sensitivity and uncertainty analysis of complex systems and legacy codes.

97 MATHEMATICS AND COMPUTING↗

Split representation of adaptively compressed polarizability operator

The polarizability operator plays a central role in density functional perturbation theory and other perturbative treatment of first principle electronic structure theories. The cost of computing the polarizability operator generally scales as O(Ne4) where Ne is the number of electrons in the system. The recently developed adaptively compressed polarizability operator (ACP) formulation [L. Lin, Z. Xu and L. Ying, Multiscale Model. Simul. 2017] reduces such complexity to O(Ne 3 ) in the context of phonon calculations with a large basis set for the first time, and demonstrates its effectiveness for model problems. In this paper, we improve the performance of the ACP formulation by splitting the polarizability into a near singular component that is statically compressed, and a smooth component that is adaptively compressed. The new split representation maintains the O(Ne 3 ) complexity, and accelerates nearly all components of the ACP formulation, including Chebyshev interpolation of energy levels, iterative solution of Sternheimer equations, and convergence of the Dyson equations. For simulation of real materials, we discuss how to incorporate nonlocal pseudopotentials and finite temperature effects. In this work, we demonstrate the effectiveness of our method using one-dimensional model problem in insulating and metallic regimes, as well as its accuracy for real molecules and solids.

97 MATHEMATICS AND COMPUTING↗

Bayesian K-SVD Using Fast Variational Inference

Recent work in signal processing in general and image processing in particular deals with sparse representation related problems. Two such problems are of paramount importance: an overriding need for designing a well-suited overcomplete dictionary containing a redundant set of atoms— i.e., basis signals—and how to find a sparse representation of a given signal with respect to the chosen dictionary. Dictionary learning techniques, among which we find the popular K-singular value decomposition algorithm, tackle these problems by adapting a dictionary to a set of training data. A common drawback of such techniques is the need for parameter-tuning. In order to overcome this limitation, we propose a fullyautomated Bayesian method that considers the uncertainty of the estimates and produces a sparse representation of the data without prior information on the number of non-zeros in each representation vector. We follow a Bayesian approach that uses a three-tiered hierarchical prior to enforce sparsity on the representations and develop an efficient variational inference framework that reduces computational complexity. Furthermore, we describe a greedy approach that speeds up the whole process. Lastly, we present experimental results that show superior performance on two different applications with real images: denoising and inpainting.

97 MATHEMATICS AND COMPUTING↗

Exploring metastable states in UO 2 using hybrid functionals and dynamical mean field theory

A detailed exploration of the f-atomic orbital occupancy space for UO2 is performed using a first principles approach based on density functional theory (DFT), employing a full hybrid functional within a systematic basis set. Specifically, the PBE0 functional is combined with an occupancy biasing scheme implemented in a wavelet-based algorithm which is adapted to large supercells. The results are compared with previous DFT + U calculations reported in the literature, while dynamical mean field theory is also performed to provide a further base for comparison. This work shows that the computational complexity of the energy landscape of a correlated f-electron oxide is much richer than has previously been demonstrated. The resulting calculations provide evidence of the existence of multiple previously unexplored metastable electronic states of UO 2 , including those with energies which are lower than previously reported ground states.

36 MATERIALS SCIENCE↗

SU-C-204-03: DFT Calculations of the Stability of DOTA-Based-Radiopharmaceuticals

Purpose: Application of the density function theory (DFT) to investigate the structural stability of complexes applied in cancer therapy consisting of the 1,4,7,10-tetraazacyclododecane-1,4,7,10-tetraacetic acid (DOTA) chelated to Ac225, Fr221, At217, Bi213, and Gd68 radio-nuclei. Methods: The possibility to deliver a toxic payload directly to tumor cells is a highly desirable aim in targeted alpha particle therapy. The estimation of bond stability between radioactive atoms and the DOTA chelating agent is the key element in understanding the foundations of this delivery process. Thus, we adapted the Vienna Ab-initio Simulation Package (VASP) with the projector-augmented wave method and a plane-wave basis set in order to study the stability and electronic properties of DOTA ligand chelated to radioactive isotopes. In order to count for the relativistic effect of radioactive isotopes we included Spin-Orbit Coupling (SOC) in the DFT calculations. Five DOTA complex structures were represented as unit cells, each containing 58 atoms. The energy optimization was performed for all structures prior to calculations of electronic properties. Binding energies, electron localization functions as well as bond lengths between atoms were estimated. Results: Calculated binding energies for DOTA-radioactive atom systems were −17.792, −5.784, −8.872, −13.305, −18.467 eV for Ac, Fr, At, Bi and Gd complexes respectively. The displacements of isotopes in DOTA cages were estimated from the variations in bond lengths, which were within 2.32–3.75 angstroms. The detailed representation of chemical bonding in all complexes was obtained with the Electron Localization Function (ELF). Conclusion: DOTA-Gd, DOTA-Ac and DOTA-Bi were the most stable structures in the group. Inclusion of SOC had a significant role in the improvement of DFT calculation accuracy for heavy radioactive atoms. Our approach is found to be proper for the investigation of structures with DOTA-based-radiopharmaceuticals and will enhance our understanding of processes occurring at subatomic levels.

60 APPLIED LIFE SCIENCES↗

Occupancy-Based HVAC Control with Short-Term Occupancy Prediction Algorithms for Energy-Efficient Buildings

This study aims to develop a concrete occupancy prediction as well as an optimal occupancy-based control solution for improving the efficiency of Heating, Ventilation, and Air-Conditioning (HVAC) systems. Accurate occupancy prediction is a key enabler for demand-based HVAC control so as to ensure HVAC is not run needlessly when when a room/zone is unoccupied. In this paper, we propose simple yet effective algorithms to predict occupancy alongside an algorithm for automatically assigning temperature set-points. Utilizing past occupancy observations, we introduce three different techniques for occupancy prediction. Firstly, we propose an identification-based approach, which identifies the model via Expectation Maximization (EM) algorithm. Secondly, we study a novel finite state automata (FSA) which can be reconstructed by a general systems problem solver (GSPS). Thirdly, we introduce an alternative stochastic model based on uncertain basis functions. The results show that all the proposed occupancy prediction techniques could achieve around 70% accuracy. Then, we have proposed a scheme to adaptively adjust the temperature set-points according to a novel temperature set algorithm with customers’ different discomfort tolerance indexes. By cooperating with the temperature set algorithm, our occupancy-based HVAC control shows 20% energy saving while still maintaining building comfort requirements.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Empirical Mode Decomposition and Hilbert Spectral Analysis

The difficult facing data analysis is the lack of method to handle nonlinear and nonstationary time series. Traditional Fourier-based analyses simply could not be applied here. A new method for analyzing nonlinear and nonstationary data has been developed. The key part is the Empirical Mode Decomposition (EMD) method with which any complicated data set can be decomposed into a finite and often small number of Intrinsic Mode Functions (IMF) that serve as the basis of the representation of the data. This decomposition method is adaptive, and, therefore, highly efficient. The IMFs admit well-behaved Hilbert transforms, and yield instantaneous energy and frequency as functions of time that give sharp identifications of imbedded structures. The final presentation of the results is an energy-frequency-time distribution, designated as the Hilbert Spectrum. Among the main conceptual innovations is the introduction of the instantaneous frequencies for complicated data sets, which eliminate the need of spurious harmonics to represent nonlinear and nonstationary signals. Examples from the numerical results of the classical nonlinear equation systems and data representing natural phenomena are given to demonstrate the power of this new method. The classical nonlinear system data are especially interesting, for they serve to illustrate the roles played by the nonlinear and nonstationary effects in the energy-frequency-time distribution.

Huang, Norden E.↗

A Critical Examination of Wind-Wave Spectral Functional Form

Traditionally, data from random ocean waves are presented in spectral functions. The spectra are the result of Fourier analysis. Fourier spectral analysis has dominated data analysis for, at least, the last hundred years. It has been the standard method for is examining the global amplitude-frequency distributions. Although Fourier transform valid under extremely general conditions, there are some crucial restrictions for the Fourier spectral analysis. The system must be linear, and the data must be stationary- otherwise, the resulting spectrum will make little physical sense. The stationarity requirement is also a common required criterion for most of other available data analysis methods. Nevertheless, few, if any, natural phenomena are linear and stationary. To compound these complications is the imperfection of our probes or numerical schemes the interactions of the imperfect probes even with a perfect linear system can make the final data nonlinear. Furthermore, all the available data are usually of finite duration. Under these conditions, Fourier analysis is of limited use, For lack of alternatives, however, Fourier analysis is still used to process such data. The loose application of Fourier analysis and the insouciant adoption of the stationary and linear assumptions may lead to misleading conclusions. Ocean waves are know to be nonlinear, and the wind system generating the wave field are seldom stationary- As a result, the traditional examination of the spectral form hardly made physical sense. A new method for analyzing nonlinear and nonstationary data has been developed. The key part is the Empirical Mode Decomposition (EMD) method with which any complicated data set can be decomposed into a finite and often small number of Intrinsic Mode Functions (IMF) that serve as the basis of the representation of the data, This decomposition method is adaptive, and, therefore, highly efficient. The IMFs admit well-behaved Hilbert transforms, and yield instantaneous energy and frequency as functions of time that give sharp identifications of imbedded structures. The final presentation of the results is an energy-frequency-time distribution, designated as the Hilbert Spectrum. Among the main conceptual innovations is the introduction of the instantaneous frequencies for complicated data sets, which eliminate the need of spurious harmonics to represent nonlinear and nonstationary signals. The spectral forms of the ocean waves are very different. This new method offers the first physical meaningful view of the wave spectrum. Data from laboratory and field will be presented to illustrate the differences.

Huang, Norden E.↗

Wavefront shaping with a Hadamard basis for scattering soil imaging

Here, soil is a scattering medium that inhibits imaging of plant-microbial-mineral interactions that are essential to plant health and soil carbon sequestration. However, optical imaging in the complex medium of soil has been stymied by the seemingly intractable problems of scattering and contrast. Here, we develop a wavefront shaping method based on adaptive stochastic parallel gradient descent optimization with a Hadamard basis to focus light through soil mineral samples. Our approach allows a sparse representation of the wavefront with reduced dimensionality for the optimization. We further divide the used Hadamard basis set into subsets and optimize a certain subset at once. Simulation and experimental optimization results demonstrate our method has an approximately seven times higher convergence rate and overall better performance compared to that with optimizing all pixels at once. The proposed method can benefit other high-dimensional optimization problems in adaptive optics and wavefront shaping.

47 OTHER INSTRUMENTATION↗

Shape Servoing of Deformable Objects using Adaptive Deformation Model Estimation

In this paper, we propose an adaptive shape servoing method to deform a soft object into a desired 3-D shape. The high dimensional representation and the unknown deformation properties of the soft object pose a challenge to actively manipulate its shape. To address this issue, we develop a method to compute the deformation Jacobian matrix in real-time. The Jacobian is estimated using a set of basis functions and its corresponding parameters to capture the dynamics of the system and relate the applied input motion to changes in the soft object's shape. An integral concurrent learning (ICL) based adaptive update law is derived using Lyapunov analysis to estimate the deformation parameters and prove its convergence. A physics-based simulation is used to validate the proposed method and controller by performing manipulation tasks with different desired configurations. The performance is compared with a standard gradient update law to demonstrate the accuracy and robustness of our approach.

Vrithik Raj Guthikonda↗

Acquisition of STEM Images by Adaptive Compressive Sensing

Compressive Sensing (CS) allows a signal to be sparsely measured first and accurately recovered later in software [1]. In scanning transmission electron microscopy (STEM), it is possible to compress an image spatially by reducing the number of measured pixels, which decreases electron dose and increases sensing speed [2,3,4]. The two requirements for CS to work are: (1) sparsity of basis coefficients and (2) incoherence of the sensing system and the representation system. However, when pixels are missing from the image, it is difficult to have an incoherent sensing matrix. Nevertheless, dictionary learning techniques such as Beta-Process Factor Analysis (BPFA) [5] are able to simultaneously discover a basis and the sparse coefficients in the case of missing pixels. On top of CS, we would like to apply active learning [6,7] to further reduce the proportion of pixels being measured, while maintaining image reconstruction quality. Suppose we initially sample 10% of random pixels. We wish to select the next 1% of pixels that are most useful in recovering the image. Now, we have 11% of pixels, and we want to decide the next 1% of “most informative” pixels. Active learning methods are online and sequential in nature. Our goal is to adaptively discover the best sensing mask during acquisition using feedback about the structures in the image. In the end, we hope to recover a high quality reconstruction with a dose reduction relative to the non-adaptive (random) sensing scheme. In doing this, we try three metrics applied to the partial reconstructions for selecting the new set of pixels: (1) variance, (2) Kullback-Leibler (KL) divergence using a Radial Basis Function (RBF) kernel, and (3) entropy. Figs. 1 and 2 display the comparison of Peak Signal-to-Noise (PSNR) using these three different active learning methods at different percentages of sampled pixels. At 20% level, all the three active learning methods underperform the original CS without active learning. However, they all beat the original CS as more of the “most informative” pixels are sampled. One can also argue that CS equipped with active learning requires less sampled pixels to achieve the same value of PSNR than CS with pixels randomly sampled, since all the three PSNR curves with active learning grow at a faster pace than that without active learning. For this particular STEM image, by observing the reconstructed images and the sensing masks, we find that while the method based on RBF kernel acquires samples more uniformly, the one on entropy samples more areas of significant change, thus less uniformly. The KL-divergence method performs the best in terms of reconstruction error (PSNR) for this example [8].

Xie, Weiyi↗

Overcoming element quality dependence of finite elements with adaptive extended stencil FEM (AES‐FEM)

Summary The finite element methods (FEMs) are important techniques in engineering for solving partial differential equations, but they depend heavily on element shape quality for stability and good performance. In this paper, we introduce the Adaptive Extended Stencil Finite Element Method (AES‐FEM) as a means for overcoming this dependence on element shape quality. Our method replaces the traditional basis functions with a set of generalized Lagrange polynomial basis functions , which we construct using local weighted least‐squares approximations. The method preserves the theoretical framework of FEM and allows imposing essential boundary conditions and integrating the stiffness matrix in the same way as the classical FEM. In addition, AES‐FEM can use higher‐degree polynomial basis functions than the classical FEM, while virtually preserving the sparsity pattern of the stiffness matrix. We describe the formulation and implementation of AES‐FEM and analyze its consistency and stability. We present numerical experiments in both 2D and 3D for the Poisson equation and a time‐independent convection–diffusion equation. The numerical results demonstrate that AES‐FEM is more accurate than linear FEM, is also more efficient than linear FEM in terms of error versus runtime, and enables much better stability and faster convergence of iterative solvers than linear FEM over poor‐quality meshes. Copyright © 2016 John Wiley & Sons, Ltd.

Conley, Rebecca↗

Solution-Based Adaptivity as a Paradigm for Computational Fluid Dynamics

This is the final report for the DOE Early Career award. Through innovation in error estimation and solution-based adaptation methods we strive to dramatically improve the efficiency and robustness of computational science and engineering simulations. By solution-based error estimation and adaptation we refer to techniques for estimating numerical error and efficiently reducing it through targeted discretization changes. In such a setting, high-order methods play a key role, though they are just one mechanism for efficient accuracy improvement. Other mechanisms include well known mesh size and stretching optimization, as well as less-practiced mesh motion and basis optimization. With additional work on the latter, we are integrating these techniques into one adaptive suite that maximizes efficiency and robustness of Computational Fluid Dynamics (CFD) calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extending the Shared Socioeconomic Pathways for sub-national impacts, adaptation, and vulnerability studies

The exploration of alternative socioeconomic futures is an important aspect of understanding the potential consequences of climate change. While socioeconomic scenarios are common and, at times essential, tools for the impact, adaptation and vulnerability and integrated assessment modeling research communities, their approaches to scenario development have historically been quite distinct. However, increasing convergence of impact, adaptation and vulnerability and integrated assessment modeling research in terms of scales of analysis suggests there may be value in the development of a common framework for socioeconomic scenarios. The Shared Socioeconomic Pathways represents an opportunity for the development of such a common framework. However, the scales at which these global storylines have been developed are largely incommensurate with the sub-national scales at which impact, adaptation and vulnerability, and increasingly integrated assessment modeling, studies are conducted. Our objective for this study was to develop sub-national and sectoral extensions of the global SSP storylines in order to identify future socioeconomic challenges for adaptation for the U.S. Southeast. A set of nested qualitative socioeconomic storyline elements, integrated storylines, and accompanying quantitative indicators were developed through an application of the Factor-Actor-Sector framework. Finally, in addition to revealing challenges and opportunities associated with the use of the SSPs as a basis for more refined scenario development, this study generated sub-national storyline elements and storylines that can subsequently be used to explore the implications of alternative subnational socioeconomic futures for the assessment of climate change impacts and adaptation.

54 ENVIRONMENTAL SCIENCES↗