Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 1,801 records · Page 100

Parallel In Situ Coupling of a Simulation with a Fully Featured Visualization System

There is a widening gap between compute performance and the ability to store computation results. Complex scientific codes are the most affected since they must save massive files containing meshes and fields for offline analysis. Time and storage costs instead dictate that data analysis and visualization be combined with the simulations themselves, being done in situ so data are transformed to a manageable size before they are stored. Earlier approaches to in situ processing involved combining specific visualization algorithms into the simulation code, limiting flexibility. We introduce a new library which instead allows a fully-featured visualization tool, VisIt, to request data as needed from the simulation and apply visualization algorithms in situ with minimal modification to the application code.

99 GENERAL AND MISCELLANEOUS↗

Planar graphical models which are easy

We describe a rich family of binary variables statistical mechanics models on planar graphs which are equivalent to Gaussian Grassmann Graphical models (free fermions). Calculation of partition function (weighted counting) in the models is easy (of polynomial complexity) as reduced to evaluation of determinants of matrixes linear in the number of variables. In particular, this family of models covers Holographic Algorithms of Valiant and extends on the Gauge Transformations discussed in our previous works.

99 GENERAL AND MISCELLANEOUS↗

CPOPT : optimization for fitting CANDECOMP/PARAFAC models.

Tensor decompositions (e.g., higher-order analogues of matrix decompositions) are powerful tools for data analysis. In particular, the CANDECOMP/PARAFAC (CP) model has proved useful in many applications such chemometrics, signal processing, and web analysis; see for details. The problem of computing the CP decomposition is typically solved using an alternating least squares (ALS) approach. We discuss the use of optimization-based algorithms for CP, including how to efficiently compute the derivatives necessary for the optimization methods. Numerical studies highlight the positive features of our CPOPT algorithms, as compared with ALS and Gauss-Newton approaches.

99 GENERAL AND MISCELLANEOUS↗

Accelerating Numerical Calculation on the Cray XMT

The Cray XMT provides hardware support for parallel algorithms that would be communication- or memory-bound on other machines. Unfortunately, even if an algorithm meets these criteria, performance suffers if the algorithm is too numerically intensive. We present a lookup-based approach that achieves a significant performance advantage over explicit calculation. We describe an approach to balancing memory bandwidth against on-chip floating point capabilities, leading to further speedup. Finally, we provide table lookup algorithms for a number of common functions.

97 MATHEMATICS AND COMPUTING↗

Turnpike solutions of control problems in quantum systems

The model of a quantum system of interacting spins based on the Shrödinger equation with unbounded linear control is transformed to an equivalent derived system (known from the degenerate problems theory). It consists of a regular differential system with new control and description of impulse control modes. This reveals the general turnpike structure of control processes and allows to propose some effective algorithms of their investigation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the degree conjecture for separability of multipartite quantum states

We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein et al. [Phys. Rev. A 73, 012320 (2006)]. The conjecture states that a multipartite quantum state is separable if and only if the degree matrix of the graph associated with the state is equal to the degree matrix of the partial transpose of this graph. We call this statement to be the strong form of the conjecture. In its weak version, the conjecture requires only the necessity, that is, if the state is separable, the corresponding degree matrices match. We prove the strong form of the conjecture for pure multipartite quantum states using the modified tensor product of graphs defined by Hassan and Joag [J. Phys. A 40, 10251 (2007)], as both necessary and sufficient condition for separability. Based on this proof, we give a polynomial-time algorithm for completely factorizing any pure multipartite quantum state. By polynomial-time algorithm, we mean that the execution time of this algorithm increases as a polynomial in m, where m is the number of parts of the quantum system. We give a counterexample to show that the conjecture fails, in general, even in its weak form, for multipartite mixed states. Finally, we prove this conjecture, in its weak form, for a class of multipartite mixed states, giving only a necessary condition for separability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Abstract Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Medrano, Fernando Antonio↗

Multimodal Event Detection in Twitter Hashtag Networks

In this study, event detection in a multimodal Twitter dataset is considered. We treat the hashtags in the dataset as instances with two modes: text and geolocation features. The text feature consists of a bag-of-words representation. The geolocation feature consists of geotags (i.e., geographical coordinates) of the tweets. Fusing the multimodal data we aim to detect, in terms of topic and geolocation, the interesting events and the associated hashtags. To this end, a generative latent variable model is assumed, and a generalized expectation-maximization (EM) algorithm is derived to learn the model parameters. The proposed method is computationally efficient, and lends itself to big datasets. Lastly, experimental results on a Twitter dataset from August 2014 show the efficacy of the proposed method.

97 MATHEMATICS AND COMPUTING↗

An approach based on dwindling filter method for positive definite generalized eigenvalue problem

In this paper, we present a new spectral residual method for solving large-scale positive definite generalized eigenvalue problems. The proposed algorithm is equipped with a dwindling multidimensional nonmonotone filter, in which the envelope dwindles as the step length decreases. We have also employed a relaxed nonmonotone line search technique in the structure of the algorithm which allows it to enjoy the nonmonotonicity from scratch. Under some mild and standard assumptions, the global convergence property of the proposed algorithm is established. An implementation of the new algorithm on some test problems shows the efficiency and effectiveness of the proposed algorithm in practice.

97 MATHEMATICS AND COMPUTING↗

Simulation-based optimal Bayesian experimental design for nonlinear systems

The optimal selection of experimental conditions is essential to maximizing the value of data for inference and prediction, particularly in situations where experiments are time-consuming and expensive to conduct. We propose a general mathematical framework and an algorithmic approach for optimal experimental design with nonlinear simulation-based models; in particular, we focus on finding sets of experiments that provide the most information about targeted sets of parameters. Our framework employs a Bayesian statistical setting, which provides a foundation for inference from noisy, indirect, and incomplete data, and a natural mechanism for incorporating heterogeneous sources of information. An objective function is constructed from information theoretic measures, reflecting expected information gain from proposed combinations of experiments. Polynomial chaos approximations and a two-stage Monte Carlo sampling method are used to evaluate the expected information gain. Stochastic approximation algorithms are then used to make optimization feasible in computationally intensive and high-dimensional settings. These algorithms are demonstrated on model problems and on nonlinear parameter inference problems arising in detailed combustion kinetics.

97 MATHEMATICS AND COMPUTING↗

Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models

Stochastic particle-resolved methods have proven useful for simulating multi-dimensional systems such as composition-resolved aerosol size distributions. While particle-resolved methods have substantial benefits for highly detailed simulations, these techniques suffer from high computational cost, motivating efforts to improve their algorithmic efficiency. Here we formulate an algorithm for accelerating particle removal processes by aggregating particles of similar size into bins. We present the Binned Algorithm for particle removal processes and analyze its performance with application to the atmospherically relevant process of aerosol dry deposition. We show that the Binned Algorithm can dramatically improve the efficiency of particle removals, particularly for low removal rates, and that computational cost is reduced without introducing additional error. In simulations of aerosol particle removal by dry deposition in atmospherically relevant conditions, we demonstrate about 50-times increase in algorithm efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated Sequence Design of 3D Polyhedral Wireframe DNA Origami with Honeycomb Edges

3D polyhedral wireframe DNA nanoparticles (DNA-NPs) fabricated using scaffolded DNA origami offer complete and independent control over NP size, structure, and asymmetric functionalization on the 10–100 nm scale. However, the complex DNA sequence design needed for the synthesis of these versatile DNA-NPs has limited their widespread use to date. While the automated sequence design algorithms DAEDALUS and vHelix-BSCOR apply to DNA-NPs synthesized using either uniformly dual or hybrid single-dual duplex edges, respectively, these DNA-NPs are relatively compliant mechanically and are therefore of limited utility for some applications. Further, these algorithms are incapable of handling DNA-NP edge designs composed of more than two duplexes, which are needed to enhance DNA-NP mechanical stiffness. As an alternative, here we introduce the scaffolded DNA origami sequence design algorithm TALOS, which is a generalized procedure for the fully automated design of wireframe 3D polyhedra composed of edges of any cross section with an even number of duplexes, and apply it to DNA-NPs composed uniformly of single honeycomb edges. We also introduce a multiway vertex design that enables the fabrication of DNA-NPs with arbitrary edge lengths and vertex angles and apply it to synthesize a highly asymmetric origami object. Sequence designs are demonstrated to fold robustly into target DNA-NP shapes with high folding efficiency and structural fidelity that is verified using single particle cryo-electron microscopy and 3D reconstruction. Furthermore, in order to test its generality, we apply TALOS to design an in silico library of over 200 DNA-NPs of distinct symmetries and sizes, and for broad impact, we also provide the software as open source for the generation of custom NP designs.

3D cryo-EM reconstruction↗

Km‐Scale Simulations of Mesoscale Convective Systems Over South America—A Feature Tracker Intercomparison

Mesoscale convective systems (MCSs) are clusters of thunderstorms that are important in Earth's water and energy cycle. Additionally, they are responsible for extreme events such as large hail, strong winds, and extreme precipitation. Automated object-based analyses that track MCSs have become popular since they allow us to identify and follow MCSs over their entire life cycle in a Lagrangian framework. This rise in popularity was accompanied by an increasing number of MCS tracking algorithms, however, little is known about how sensitive analyses are concerning the MCS tracker formulation. Here, we assess differences between six MCS tracking algorithms on South American MCS characteristics and evaluate MCSs in kilometer-scale simulations with observational-based MCSs over 3 years. All trackers are run with a common set of MCS classification criteria to isolate tracker formulation differences. The tracker formulation substantially impacts MCS characteristics such as frequency, size, duration, and contribution to total precipitation. The evaluation of simulated MCS characteristics is less sensitive to the tracker formulation and all trackers agree that the model can capture MCS characteristics well across different South American climate zones. Dominant sources of uncertainty are the segmentation of cloud systems in space and time and the treatment of how MCSs are linked in time. Our results highlight that comparing MCS analyses that use different tracking algorithms is challenging. We provide general guidelines on how MCS characteristics compare between trackers to facilitate a more robust assessment of MCS statistics in future studies.

54 ENVIRONMENTAL SCIENCES↗

Deep reaction network exploration at a heterogeneous catalytic interface

Characterizing the reaction energies and barriers of reaction networks is central to catalyst development. However, heterogeneous catalytic surfaces pose several unique challenges to automatic reaction network characterization, including large sizes and open-ended reactant sets, that make ad hoc network construction the current state-of-the-art. Here, we show how automated network exploration algorithms can be adapted to the constraints of heterogeneous systems using ethylene oligomerization on silica-supported single-site Ga 3+ as a model system. Using only graph-based rules for exploring the network and elementary constraints based on activation energy and size for identifying network terminations, a comprehensive reaction network is generated and validated against standard methods. The algorithm (re)discovers the Ga-alkyl-centered Cossee-Arlman mechanism that is hypothesized to drive major product formation while also predicting several new pathways for producing alkanes and coke precursors. These results demonstrate that automated reaction exploration algorithms are rapidly maturing towards general purpose capability for exploratory catalytic applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bootstrap performance profiles in stochastic algorithms assessment

Optimization with stochastic algorithms has become a relevant research field. Due to its stochastic nature, its assessment is not straightforward and involves integrating accuracy and precision. Performance profiles for the mean do not show the trade-off between accuracy and precision, and parametric stochastic profiles require strong distributional assumptions and are limited to the mean performance for a large number of runs. In this work, bootstrap performance profiles are used to compare stochastic algorithms for different statistics. This technique allows the estimation of the sampling distribution of almost any statistic even with small samples. Multiple comparison profiles are presented for more than two algorithms. The advantages and drawbacks of each assessment methodology are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling L 2,3 -edge X-ray absorption spectroscopy with linear response exact two-component relativistic time-dependent density functional theory

X-ray absorption spectroscopy (XAS) is a powerful tool that can provide physical insights into element-specific chemical processes and reactivities. Although relativistic time-dependent density functional theory (TDDFT) has been previously applied to model the L-edge region in XAS, there has not been a more comprehensive study of the choices of basis sets and density functional kernels available for variational relativistic excited state methods. In this work, we introduce the implementation of the generalized preconditioned locally harmonic residual algorithm to solve the complex-valued relativistic TDDFT for modeling the L-edge X-ray absorption spectra. Further, we investigate the L 2,3 -edge spectra of a series of molecular complexes using relativistic linear response TDDFT with a hybrid iterative diagonalization algorithm. A systematic error analysis was carried out with a focus on the energetics, intensities, and magnitude of L 2 –L 3 splitting compared to experiments. Additionally, the results from relativistic TDDFT calculations are compared to those computed using other theoretical methods, and the multideterminantal effects on the L-edge XAS were investigated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Holographic phase retrieval and reference design

Here, a general mathematical framework and recovery algorithm is introduced for the holographic phase retrieval problem. In this problem, which arises in holographic coherent diffraction imaging, a 'reference' portion of the signal to be recovered via phase retrieval is a priori known from experimental design. A generic formula is additionally derived for the expected recovery error when the measurement data is corrupted by Poisson shot noise. This facilitates an optimization perspective towards reference design and analysis. We employ this optimization perspective towards quantifying the performance of various reference choices.

97 MATHEMATICS AND COMPUTING↗

Refine your search to explore more results.