Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex computing”

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 55 records · Page 3

Mathematical model and software complex for computer simulation of field emission electron sources

The software complex developed in MATLAB allows modelling of function of diode and triode structures based on field emission electron sources with complex sub-micron geometry, their volt-ampere characteristics, calculating distribution of electric field for educational and research needs. The goal of this paper is describing the physical-mathematical model, calculation methods and algorithms the software complex is based on, demonstrating the principles of its function and showing results of its work. For getting to know the complex, a demo version with graphical user interface is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations II: Adaptivity and generalizations

This is part II of our paper in which we propose and develop a dynamically bi-orthogonal method (DyBO) to study a class of time-dependent stochastic partial differential equations (SPDEs) whose solutions enjoy a low-dimensional structure. In part I of our paper [9], we derived the DyBO formulation and proposed numerical algorithms based on this formulation. Some important theoretical results regarding consistency and bi-orthogonality preservation were also established in the first part along with a range of numerical examples to illustrate the effectiveness of the DyBO method. In this paper, we focus on the computational complexity analysis and develop an effective adaptivity strategy to add or remove modes dynamically. Our complexity analysis shows that the ratio of computational complexities between the DyBO method and a generalized polynomial chaos method (gPC) is roughly of order O((m/N{sub p}){sup 3}) for a quadratic nonlinear SPDE, where m is the number of mode pairs used in the DyBO method and N{sub p} is the number of elements in the polynomial basis in gPC. The effective dimensions of the stochastic solutions have been found to be small in many applications, so we can expect m is much smaller than N{sub p} and computational savings of our DyBO method against gPC are dramatic. The adaptive strategy plays an essential role for the DyBO method to be effective in solving some challenging problems. Another important contribution of this paper is the generalization of the DyBO formulation for a system of time-dependent SPDEs. Several numerical examples are provided to demonstrate the effectiveness of our method, including the Navier–Stokes equations and the Boussinesq approximation with Brownian forcing.

97 MATHEMATICS AND COMPUTING↗

A molecular approach to understanding complex systems: computational statistical mechanics using state-of-the-art algorithms on terascale computational platforms

Presented herein, is our recent progress towards a molecular picture of reactions in complex fluids and there interfaces. In particular, we highlight the important statistical mechanical methodology as well as the electronic structure methods and algorithms that are used to tackle important unresolved questions in the chemical sciences. Moreover, we demonstrate that though the simulation protocol outlined, in conjunction with current and next generation computer hardware, that the elucidation of complex chemical problems in the condensed phase are within reach. This work was supported by the U.S. Department of Energy's (DOE) Office of Basic Energy Sciences, Chemical Sciences program. The Pacific Northwest National Laboratory is operated by Battelle for DOE.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Leveraging dendritic complexity for neuromorphic computing

Abstract Beyond-von Neumann computing approaches are necessary to sustain the growth of microelectronics and the increasing appetite for artificial intelligence/machine learning algorithms. Neuromorphic computing is an emerging paradigm that takes inspiration from the brain to provide a path forward to improve the computational efficiency and computational density of next-generation computing architectures. In nature, we observe brains performing complex computations with a much smaller energy footprint than conventional computing approaches. Current neuromorphic systems are focused primarily on scalability, namely, increasing the number of computational units (neurons) and connections between units (synapses). However, for brain-like cognition and efficiency in next-generation computing hardware, we need increased complexity in function, as well as improved connection density for scalability. Here, we present our work that aims to incorporate dendrites for ‘compute-on-wire’ in neuromorphic architectures to increase the computational complexity (e.g. number of programmable parameters, nonlinear dynamics) as well as computational efficiency (energy/compute) of artificial neural networks (ANNs). We do this by showcasing neuromorphic dendrite elements that can be leveraged for various applications. We will present examples of neuroscience-inspired direction-selective circuits and an ANN with active dendrites leveraging shunting inhibition. We also demonstrate the benefits of using dendrites in deep neural networks. To conclude, we discuss how we can utilize emerging hardware devices in these systems and design next-generation neuromorphic architectures with dendrites.

Cardwell, Suma G. (ORCID:0000000226575545)↗

Bridge-Mediated Metal-to-Metal Electron and Hole Transfer in a Supermolecular Dinuclear Complex: A Computational Study Using Quantum Electron–Nuclear Dynamics

Bimetallic electron donor–acceptor complexes can facilitate electron and energy transfer with excellent structural control through synthetic design. In this work, we investigate the photochemical dynamics in a Ru–Cu bimetallic complex after photoexcitation of the Ru-centered charge transfer state. The physical underpinnings of the metal-to-metal directional charge transfer process are unraveled via analyses of the quantum electronic dynamics and electron–nuclear trajectories. Here, the effects of molecular vibrations in the photoexcited state on the charge transfer processes are also analyzed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FLAME: A platform for high performance computing of complex systems, applied for three case studies

FLAME allows complex models to be automatically parallelised on High Performance Computing (HPC) grids enabling large number of agents to be simulated over short periods of time. Modellers are hindered by complexities of porting models on parallel platforms and time taken to run large simulations on a single machine, which FLAME overcomes. Three case studies from different disciplines were modelled using FLAME, and are presented along with their performance results on a grid.

97 MATHEMATICS AND COMPUTING↗

Building a Foundation for Structure-Based Cellulosome Design for Cellulosic Ethanol: Insight into Cohesin-Dockerin Complexation from Computer Simulation

The organization and assembly of the cellulosome, an extracellular multienzyme complex produced by anaerobic bacteria, is mediated by the high-affinity interaction of cohesin domains from scaffolding proteins with dockerins of cellulosomal enzymes. We have performed molecular dynamics simulations and free energy calculations on both the wild type (WT) and D39N mutant of the C. thermocellum Type I cohesin-dockerin complex in aqueous solution. The D39N mutation has been experimentally demonstrated to disrupt cohesin-dockerin binding. The present MD simulations indicate that the substitution triggers significant protein flexibility and causes a major change of the hydrogen-bonding network in the recognition strips - the conserved loop regions previously proposed to be involved in binding - through electrostatic and salt-bridge interactions between {beta}-strands 3 and 5 of the cohesin and {alpha}-helix 3 of the dockerin. The mutation-induced subtle disturbance in the local hydrogen-bond network is accompanied by conformational rearrangements of the protein side chains and bound water molecules. Additional free energy perturbation calculations of the D39N mutation provide differences in the cohesin-dockerin binding energy, thus offering a direct, quantitative comparison with experiments. The underlying molecular mechanism of cohesin-dockerin complexation is further investigated through the free energy profile, that is, potential of mean force (PMF) calculations of WT cohesin-dockerin complex. The PMF shows a high-free energy barrier against the dissociation and reveals a stepwise pattern involving both the central {beta}-sheet interface and its adjacent solvent-exposed loop/turn regions clustered at both ends of the {beta}-barrel structure.

adaptive biasing force↗

Scalable Hyper-parameter Estimation for Gaussian Process Based Time Series Analysis

Gaussian process (GP) is increasingly becoming popular as a kernel machine learning tool for non-parametric data analysis. Recently, GP has been applied to model non-linear dependencies in time series data. GP based analysis can be used to solve problems of time series prediction, forecasting, missing data imputation, change point detection, anomaly detection, etc. But the use of GP to handle massive scientific time series data sets has been limited, owing to its expensive computational complexity. The primary bottleneck is the handling of the covariance matrix whose size is quadratic in the length of the time series. In this paper we propose a scalable method that exploit the special structure of the covariance matrix for hyper-parameter estimation in GP based learning. The proposed method allows estimation of hyper parameters associated with GP in quadratic time, which is an order of magnitude improvement over standard methods with cubic complexity. Moreover, the proposed method does not require explicit computation of the covariance matrix and hence has memory requirement linear to the length of the time series as opposed to the quadratic memory requirement of standard methods. To further improve the computational complexity of the proposed method, we provide a parallel version to concurrently estimate the log likelihood for a set of time series which is the key step in the hyper-parameter estimation. Performance results on a multi-core system show that our proposed method provides significant speedups as high as 1000, even when running in serial mode, while maintaining a small memory footprint. The parallel version exploits the natural parallelization potential of the serial algorithm and is shown to perform significantly better than the serial faster algorithm, with speedups as high as 10.

Chandola, Varun↗

Capturing provenance as a diagnostic tool for workflow performance evaluation and optimization

In extreme-scale computing environments such as the DOE Leadership Computing Facilities scientific workflows are routinely used to coordinate software processes for the execution of complex, computational applications that perform in-silico experiments. Monitoring the performance of workflows without also simultaneously tracking provenance is not sufficient to understand variations between runs, configurations, versions of a code, and between changes in an implemented stack, and systems, i.e. the variability of performance metrics data in their historical context. We take a provenance-based approach and demonstrate that provenance is useful as a tool for evaluating and optimizing workflow performance in extreme-scale HPC environments. We present Chimbuko, a framework for the analysis and visualization of the provenance of performance. Chimbuko implements a method for the evaluation of workflow performance from multiple components that enables the exploration of performance metrics data at scale.

97 MATHEMATICS AND COMPUTING↗

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Optimization of Large Wind Farms for Real-Time Control: Preprint

Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. Properly coordinating turbines, by operating some turbines suboptimally, within a wind farm has the potential to improve overall wind farm performance. Computing the optimal control strategy under varying atmospheric conditions can be computationally intense for large wind farms. As wind power farms increase in size and related models become more complex, computationally efficient algorithms are needed to perform real-time optimization and control. This study proposes a distributed optimization framework and computationally efficient wake steering wind farm control strategy that uses the yaw angle of a turbine to alter the behavior of a turbine wake and minimize turbine interactions. This computational efficiency allows the strategy to be feasible for real-time control.

17 WIND ENERGY↗

Foundations of Feature Selection and Classification for Non-Gaussian Distributed Targets

This report describes the author’s research toward creating algorithms for selecting useful statistical features in pattern/target classification problems in which the features are non-Gaussian distributed. In engineering practice, it is common to either (1) Not perform any feature selection procedure, or (2) Use a feature selection algorithm that assumes the features are Gaussian distributed. This process can be far from optimal if the data are actually non-Gaussian, as they frequently are in practice. This research has the goal of mitigating that problem by creating a useful algorithm that can be used in practice. The approach is to focus on the performance indices used in common feature selection algorithms, such as Branch and Bound algorithms and the Sequential Forward Selection Algorithm. Ordinarily, the performance index used to measure the class separation in feature space involves assuming the data are Gaussian and deriving tractable performance indices that use closed form equations that represent the probability density functions of the class data. The advantage of this approach is that it produces feature selection algorithms that have low computational complexity and do not require knowledge of the actual data densities. The disadvantage is that these algorithms may not perform reasonably when the data are non-Gaussian, as they commonly are in practice. This research examines the use of information-theoretic class separability measures that can deal with the non-Gaussian case. In particular, this work shows that the Hellinger Distance (a divergence measure), has very desirable mathematical properties and can be useful for feature selection. The work in this paper employs a multivariate kernel density estimator along with the Hellinger Distance and an optimal subset selection algorithm to do feature selection. This report (1) Defines the classification and feature selection problems, (2) Describes the continuous variable Hellinger distance in one dimension and discusses its mathematical properties in comparison with other distance measures, (3) Develops the discrete variable Hellinger distance expression for one and two dimensions, and shows that the discrete Hellinger distance for multiple dimensions is a straightforward extension, and (4) Presents experimental density estimation results using a new MATLAB implementation of a multivariate kernel density estimator. The draft of this report served as a starting point for Ensign Matthew Wilder’s MSEE thesis work at the Naval Postgraduate School (NPS) in 2010 and 2011. Ensign Wilder completed his thesis and graduated from NPS in June 2011 (M. J. Wilder, “Automatic Target Recognition: Statistical Feature Selection of Non-Gaussian Distributed Target Classes,” MSEE Thesis, Naval Postgraduate School, Thesis Advisor: Grace A. Clark, Second Reader: Monique P. Fargues, June 2011). In the thesis, Ensign Wilder created implementations of the Branch and Bound and Sequential Feature Selection algorithms, extended the multivariate kernel density estimator code, and evaluated the performance of Hellinger Distance-based feature selection algorithms using both simulated data and data from a real-world benchmark data set. The new algorithm was shown to be very effective for both Gaussian and non-Gaussian data sets. The advantages gained for non-Gaussian data come at the cost of increased computational complexity. Using a laptop computer for practical problems, we generally use initial feature vectors containing no more than about ten or twelve features. Proposed future research lies in creating faster kernel density estimator algorithms that would allow for the use of higher dimensional data.

42 ENGINEERING↗

Multiphysics Simulations: Challenges and Opportunities

We consider multiphysics applications from algorithmic and architectural perspectives, where ‘‘algorithmic’’ includes both mathematical analysis and computational complexity, and ‘‘architectural’’ includes both software and hardware environments. Many diverse multiphysics applications can be reduced, en route to their computational simulation, to a common algebraic coupling paradigm. Mathematical analysis of multiphysics coupling in this form is not always practical for realistic applications, but model problems representative of applications discussed herein can provide insight. A variety of software frameworks for multiphysics applications have been constructed and refined within disciplinary communities and executed on leading-edge computer systems. We examine several of these, expose some commonalities among them, and attempt to extrapolate best practices to future systems. From our study, we summarize challenges and forecast opportunities.

Keyes, David↗

Multisource Data Fusion Outage Location in Distribution Systems via Probabilistic Graphical Models

Efficient outage location is critical to enhancing the resilience of power distribution systems. However, accurate outage location requires combining massive evidence received from diverse data sources, including smart meter (SM) last gasp signals, customer trouble calls, social media messages, weather data, vegetation information, and physical parameters of the network. This is a computationally complex task due to the high dimensionality of data in distribution grids. In this paper, we propose a multi-source data fusion approach to locate outage events in partially observable distribution systems using Bayesian networks (BNs). A novel aspect of the proposed approach is that it takes multi-source evidence and the complex structure of distribution systems into account using a probabilistic graphical method. Our method can radically reduce the computational complexity of outage location inference in high-dimensional spaces. The graphical structure of the proposed BN is established based on the network’s topology and the causal relationship between random variables, such as the states of branches/customers and evidence. Utilizing this graphical model, accurate outage locations are obtained by leveraging a Gibbs sampling (GS) method, to infer the probabilities of de-energization for all branches. Compared with commonly-used exact inference methods that have exponential complexity in the size of the BN, GS quantifies the target conditional probability distributions in a timely manner. As a result, a case study of several real-world distribution systems is presented to validate the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Acoustic Source Localization via Time Difference of Arrival Estimation for Distributed Sensor Networks Using Tera‐Scale Optical Core Devices

For real‐time acoustic source localization applications, one of the primary challenges is the considerable growth in computational complexity associated with the emergence of ever larger, active or passive, distributed sensor networks. These sensors rely heavily on battery‐operated system components to achieve highly functional automation in signal and information processing. In order to keep communication requirements minimal, it is desirable to perform as much processing on the receiver platforms as possible. However, the complexity of the calculations needed to achieve accurate source localization increases dramatically with the size of sensor arrays, resulting in substantial growth of computational requirements that cannot be readily met with standard hardware. One option to meet this challenge builds upon the emergence of digital optical‐core devices. The objective of this work was to explore the implementation of key building block algorithms used in underwater source localization on the optical‐core digital processing platform recently introduced by Lenslet Inc. This demonstration of considerably faster signal processing capability should be of substantial significance to the design and innovation of future generations of distributed sensor networks.

Imam, Neena↗

A fast and efficient algorithm for Slater determinant updates in quantum Monte Carlo simulations

We present an efficient low-rank updating algorithm for updating the trial wave functions used in quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational complexity of the algorithm is O(kN) during the kth step compared to traditional algorithms that require O(N{sup 2}) computations, where N is the system size. For single determinant trial wave functions the new algorithm is faster than the traditional O(N{sup 2}) Sherman-Morrison algorithm for up to O(N) updates. For multideterminant configuration-interaction-type trial wave functions of M+1 determinants, the new algorithm is significantly more efficient, saving both O(MN{sup 2}) work and O(MN{sup 2}) storage. The algorithm enables more accurate and significantly more efficient QMC calculations using configuration-interaction-type wave functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Field programmable gate array-assigned complex-valued computation and its limits

We discuss how leveraging Field Programmable Gate Array (FPGA) technology as part of a high performance computing platform reduces latency to meet the demanding real time constraints of a quantum optics simulation. Implementations of complex-valued operations using fixed point numeric on a Virtex-5 FPGA compare favorably to more conventional solutions on a central processing unit. Our investigation explores the performance of multiple fixed point options along with a traditional 64 bits floating point version. With this information, the lowest execution times can be estimated. Relative error is examined to ensure simulation accuracy is maintained.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Fractional modeling of viscoelasticity in 3D cerebral arteries and aneurysms

We develop efficient numerical methods for fractional order PDEs, and employ them to investigate viscoelastic constitutive laws for arterial wall mechanics. Recent simulations using one-dimensional models [1] have indicated that fractional order models may offer a more powerful alternative for modeling the arterial wall response, exhibiting reduced sensitivity to parametric uncertainties compared with the integer-calculus-based models. Here, we study three-dimensional (3D) fractional PDEs that naturally model the continuous relaxation properties of soft tissue, and for the first time employ them to simulate flow structure interactions for patient-specific brain aneurysms. To deal with the high memory requirements and in order to accelerate the numerical evaluation of hereditary integrals, we employ a fast convolution method [2] that reduces the memory cost to O(log(N)) and the computational complexity to O(N log(N)). Furthermore, we combine the fast convolution with high-order backward differentiation to achieve third-order time integration accuracy. We confirm that in 3D viscoelastic simulations, the integer order models strongly depends on the relaxation parameters, while the fractional order models are less sensitive. As an application to long-time simulations in complex geometries, we also apply the method to modeling fluid-structure interaction of a 3D patient-specific compliant cerebral artery with an aneurysm. Taken together, our findings demonstrate that fractional calculus can be employed effectively in modeling complex behavior of materials in realistic 3D time-dependent problems if properly designed efficient algorithms are employed to overcome the extra memory requirements and computational complexity associated with the non-local character of fractional derivatives.

Computer Science↗