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 253 records · Page 14

Total least squares for anomalous change detection

A family of difference-based anomalous change detection algorithms is derived from a total least squares (TLSQ) framework. This provides an alternative to the well-known chronochrome algorithm, which is derived from ordinary least squares. In both cases, the most anomalous changes are identified with the pixels that exhibit the largest residuals with respect to the regression of the two images against each other. The family of TLSQ-based anomalous change detectors is shown to be equivalent to the subspace RX formulation for straight anomaly detection, but applied to the stacked space. However, this family is not invariant to linear coordinate transforms. On the other hand, whitened TLSQ is coordinate invariant, and furthermore it is shown to be equivalent to the optimized covariance equalization algorithm. What whitened TLSQ offers, in addition to connecting with a common language the derivations of two of the most popular anomalous change detection algorithms - chronochrome and covariance equalization - is a generalization of these algorithms with the potential for better performance.

97 MATHEMATICS AND COMPUTING↗

FAST-PT II: an algorithm to calculate convolution integrals of general tensor quantities in cosmological perturbation theory

Cosmological perturbation theory is a powerful tool to predict the statistics of large-scale structure in the weakly non-linear regime, but even at 1-loop order it results in computationally expensive mode-coupling integrals. Here we present a fast algorithm for computing 1-loop power spectra of quantities that depend on the observer's orientation, thereby generalizing the FAST-PT framework (McEwen et al., 2016) that was originally developed for scalars such as the matter density. This algorithm works for an arbitrary input power spectrum and substantially reduces the time required for numerical evaluation. We apply the algorithm to four examples: intrinsic alignments of galaxies in the tidal torque model; the Ostriker-Vishniac effect; the secondary CMB polarization due to baryon flows; and the 1-loop matter power spectrum in redshift space. Code implementing this algorithm and these applications is publicly available at https://github.com/JoeMcEwen/FAST-PT.

79 ASTRONOMY AND ASTROPHYSICS↗

Treecode-based generalized Born method

We have developed a treecode-based O(N log N) algorithm for the generalized Born (GB) implicit solvation model. Our treecode-based GB (tGB) is based on the GBr6 [J. Phys. Chem. B 111, 3055 (2007)], an analytical GB method with a pairwise descreening approximation for the R6 volume integral expression. The algorithm is composed of a cutoff scheme for the effective Born radii calculation, and a treecode implementation of the GB charge–charge pair interactions. Test results demonstrate that the tGB algorithm can reproduce the vdW surface based Poisson solvation energy with an average relative error less than 0.6% while providing an almost linear-scaling calculation for a representative set of 25 proteins with different sizes (from 2815 atoms to 65456 atoms). For a typical system of 10k atoms, the tGB calculation is three times faster than the direct summation as implemented in the original GBr6 model. Thus, our tGB method provides an efficient way for performing implicit solvent GB simulations of larger biomolecular systems at longer time scales.

59 BASIC BIOLOGICAL SCIENCES↗

Efficient evaluation of the Breit operator in the Pauli spinor basis

The frequency-independent Coulomb–Breit operator gives rise to the most accurate treatment of two-electron interaction in the non-quantum-electrodynamics regime. The Breit interaction in the Coulomb gauge consists of magnetic and gauge contributions. The high computational cost of the gauge term limits the application of the Breit interaction in relativistic molecular calculations. In this work, we apply the Pauli component integral–density matrix contraction scheme for gauge interaction with a maximum spin- and component separation scheme. We also present two different computational algorithms for evaluating gauge integrals. One is the generalized Obara–Saika algorithm, where the Laplace transformation is used to transform the gauge operator into Gaussian functions and the Obara–Saika recursion is used for reducing the angular momentum. The other algorithm is the second derivative of Coulomb interaction evaluated with Rys-quadrature. This work improves the efficiency of performing Dirac–Hartree–Fock with the variational treatment of Breit interaction for molecular systems. In conclusion, we use this formalism to examine relativistic trends in the Periodic Table and analyze the relativistic two-electron interaction contributions in heavy-element complexes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Numerical Algorithm for the Solution of a Phase-Field Model of Polycrystalline Materials

We describe an algorithm for the numerical solution of a phase-field model (PFM) of microstructure evolution in polycrystalline materials. The PFM system of equations includes a local order parameter, a quaternion representation of local orientation and a species composition parameter. The algorithm is based on the implicit integration of a semidiscretization of the PFM system using a backward difference formula (BDF) temporal discretization combined with a Newton-Krylov algorithm to solve the nonlinear system at each time step. The BDF algorithm is combined with a coordinate projection method to maintain quaternion unit length, which is related to an important solution invariant. A key element of the Newton-Krylov algorithm is the selection of a preconditioner to accelerate the convergence of the Generalized Minimum Residual algorithm used to solve the Jacobian linear system in each Newton step. Results are presented for the application of the algorithm to 2D and 3D examples.

36 MATERIALS SCIENCE↗

An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization

Abstract An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes ${\mathscr O}(\varepsilon ^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\varepsilon $ and can take ${\mathscr O}(\varepsilon ^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\varepsilon $. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularization using Cubics (arc) method and the recently proposed Trust-Region Algorithm with Contractions and Expansions (trace). The generality of our method is achieved through the introduction of generic conditions that each trial step is required to satisfy, which in particular allows for inexact regularized Newton steps to be used. These conditions center around a new subproblem that can be approximately solved to obtain trial steps that satisfy the conditions. A new instance of the framework, distinct from arc and trace, is described that may be viewed as a hybrid between quadratically and cubically regularized Newton methods. Numerical results demonstrate that our hybrid algorithm outperforms a cubically regularized Newton method.

Mathematics↗

Solving k –SAT problems with generalized quantum measurement

We generalize the projection–based quantum measurement–driven k –SAT algorithm of Benjamin, Zhao, and Fitzsimons to arbitrary strength quantum measurements, including the limit of continuous monitoring. In doing so, we clarify that this algorithm is a particular case of the measurement–driven quantum control strategy elsewhere referred to as “Zeno dragging”. We argue that the algorithm is most efficient with finite time and measurement resources in the continuum limit, where measurements have an infinitesimal strength and duration. Moreover, for solvable k -SAT problems, the dynamics generated by the algorithm converge deterministically towards target dynamics in the long–time (Zeno) limit, implying that the algorithm can successfully operate autonomously via Lindblad dissipation, without detection. We subsequently study both the conditional and unconditional dynamics of the algorithm implemented via generalized measurements, quantifying the advantages of detection for heralding errors. These strategies are investigated first in a computationally–trivial 2-qubit 2-SAT problem to build intuition, and then we consider the scaling of the algorithm on 3-SAT problems encoded with 4–10 qubits. We numerically investigate the scaling of 3-SAT with respect to algorithmic runtime and find that the optimized time to solution scales with qubit number n as λ n , where λ is slightly larger than $\sqrt{2}$ for unconditional dynamics and less than $\sqrt{2}$ for conditional dynamics. We assess the implications for using this analog measurement–driven approach to quantum computing in practice.

quantum information↗

A new class of accelerated kinetic Monte Carlo algorithms

Kinetic ( aka dynamic) Monte Carlo (KMC) is a powerful method for numerical simulations of time dependent evolution applied in a wide range of contexts including biology, chemistry, physics, nuclear sciences, financial engineering, etc. Generally, in a KMC the time evolution takes place one event at a time, where the sequence of events and the time intervals between them are selected (or sampled) using random numbers. While details of the method implementation vary depending on the model and context, there exist certain common issues that limit KMC applicability in almost all applications. Among such is the notorious 'flicker problem' where the same states of the systems are repeatedly visited but otherwise no essential evolution is observed. In its simplest form the flicker problem arises when two states are connected to each other by transitions whose rates far exceed the rates of all other transitions out of the same two states. In such cases, the model will endlessly hop between the two states otherwise producing no meaningful evolution. In most situation of practical interest, the trapping cluster includes more than two states making the flicker somewhat more difficult to detect and to deal with. Several methods have been proposed to overcome or mitigate the flicker problem, exactly or approximately. Of the exact methods, the one proposed by Novotny is perhaps most relevant to our research. Novotny formulates the problem of escaping from a trapping cluster as a Markov system with absorbing states. Given an initial state inside the cluster, it is in principle possible to solve the Master Equation for the time dependent probabilities to find the walker in a given state (transient or absorbing) of the cluster at any time in the future. Novotny then proceeds to demonstrate implementation of his general method to trapping clusters containing the initial state plus one or two transient states and all of their absorbing states. Similar methods have been subsequently proposed in [refs] but applied in a different context. The most serious deficiency of the earlier methods is that size of the trapping cluster size is fixed and often too small to bring substantial simulation speedup. Furthermore, the overhead associated with solving for the probability distribution on the trapping cluster sometimes makes such simulations less efficient than the standard KMC. Here we report on a general and exact accelerated kinetic Monte Carlo algorithm generally applicable to arbitrary Markov models1. Two different implementations are attempted both based on incremental expansion of trapping sub-set of Markov states: (1) numerical solution of the Master Equation with absorbing states and (2) incremental graph reduction followed by randomization. Of the two implementations, the 2nd one performs better allowing, for the first time, to overcome trapping basins spanning several million Markov states. The new method is used for simulations of anomalous diffusion on a 2D substrate and of the kinetics of diffusive 1st order phase transformations in binary alloys. Depending on temperature and (alloy) super-saturation conditions, speedups of 3 to 7 orders of magnitude are demonstrated, with no compromise of simulation accuracy.

97 MATHEMATICS AND COMPUTING↗

Implicit-explicit evolution of single black holes

Numerical simulations of binary black holes - an important predictive tool for the detection of gravitational waves - are computationally expensive, especially for binaries with high mass ratios or with rapidly spinning constituent holes. Existing codes for evolving binary black holes rely on explicit time-stepping methods, for which the time-step size is limited by the smallest spatial scale through the Courant-Friedrichs-Lewy condition. Binary inspiral typically involves spatial scales (the spatial resolution required by a small or rapidly spinning hole) which are orders of magnitude smaller than the relevant (orbital, precession, and radiation-reaction) time scales characterizing the inspiral. Therefore, in explicit evolutions of binary black holes, the time-step size is typically orders of magnitude smaller than the relevant physical time scales. Implicit time-stepping methods allow for larger time steps, and they often reduce the total computational cost (without significant loss of accuracy) for problems dominated by spatial rather than temporal error, such as for binary-black-hole inspiral in corotating coordinates. However, fully implicit methods can be difficult to implement for nonlinear evolution systems like the Einstein equations. Therefore, in this paper we explore implicit-explicit (IMEX) methods and use them for the first time to evolve black-hole spacetimes. Specifically, as a first step toward IMEX evolution of a full binary-black-hole spacetime, we develop an IMEX algorithm for the generalized harmonic formulation of the Einstein equations and use this algorithm to evolve stationary and perturbed single-black-hole spacetimes. Numerical experiments explore the stability and computational efficiency of our method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Multigrid Framework for SN Discretizations of the Boltzmann Transport Equation with Application to Spatially Unstructured Grids

The space-angle multiple/semi-coarsening multigrid methods of [3] for S n discretizations of the Boltzmann transport equation was developed assuming rediscretizations of the streaming collision operators on the coarser spatial grids. These rediscretized operators are directly used in the kernels of the spatial coarse-level scalar flux integral equations, which undergo the multigrid process. Since the computation is essentially performed on these integral equations, it appears that the multigrid procedure is applied directly to the finest level scalar flux integral equation, rather than to the finest level S n system. However, this procedure is actually applied implicitly to the finest level S n system, though it would be beneficial to directly relate the multiple/semi-coarsening methods to the full S n system: being able to relate the multigrid procedure directly to the full S n system will lead to a general framework that can help guide the development of multigrid algorithms for more general S n discretization settings, such as when spatial rediscretization of the integral equation kernel can not be applied. In this latter case, applying an operator-dependent Galerkin coarsening procedure to the integral operator is difficult, if not realizable, because the kernel is dense and often given by its action of numerically sweeping over all the streaming-collision operators. In this paper, we develop and analyze such a multigrid framework for the S n system. We further relate this framework to a multigrid scheme that directly coarsens the scalar flux integral equation using a Galerkin coarsening approach. For this approach, we show that an intricate operator-dependent Galerkin coarsening procedure may not be needed. In particular, this paper develops a Galerkin-principle framework for S n discretizations of the Boltzmann equation, of which the analysis shows that simple interpolation operators can be used to coarsen the integral equations operators arising from the space-angle multiple/semi-coarsening methods.

97 MATHEMATICS AND COMPUTING↗

A new FFT-based algorithm to compute Born radii in the generalized Born theory of biomolecule solvation

In this paper, a new method for calculating effective atomic radii within the generalized Born (GB) model of implicit solvation is proposed, for use in computer simulations of biomolecules. First, a new formulation for the GB radii is developed, in which smooth kernels are used to eliminate the divergence in volume integrals intrinsic in the model. Next, the fast Fourier transform (FFT) algorithm is applied to integrate smoothed functions, taking advantage of the rapid spectral decay provided by the smoothing. The total cost of the proposed algorithm scales as O(N{sup 3}logN+M) where M is the number of atoms comprised in a molecule and N is the number of FFT grid points in one dimension, which depends only on the geometry of the molecule and the spectral decay of the smooth kernel but not on M. To validate our algorithm, numerical tests are performed for three solute models: one spherical object for which exact solutions exist and two protein molecules of differing size. The tests show that our algorithm is able to reach the accuracy of other existing GB implementations, while offering much lower computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MarmotViz User Guide

MarmotViz is an illustrative visualization plug-in for ParaView. It is intended for generating enhanced visualizations of time-varying datasets on unstructured connected meshes. A detailed description of the implemented algorithms and program structure can be found in the related document: Generalized framework and algorithms for illustrative visualization of time-varying data on unstructured meshes . This document provides details for compiling/building MarmotViz, using the MarmotViz plug-in in ParaView, and extending the MarmotViz plug-in.

42 ENGINEERING↗

Accompanying coordinate expansion and recurrence relation method using a transfer relation scheme for electron repulsion integrals with high angular momenta and long contractions

An efficient algorithm for the rapid evaluation of electron repulsion integrals is proposed. The present method, denoted by accompanying coordinate expansion and transferred recurrence relation (ACE-TRR), is constructed using a transfer relation scheme based on the accompanying coordinate expansion and recurrence relation method. Furthermore, the ACE-TRR algorithm is extended for the general-contraction basis sets. Numerical assessments clarify the efficiency of the ACE-TRR method for the systems including heavy elements, whose orbitals have long contractions and high angular momenta, such as f- and g-orbitals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probabilistic Cosmological Mass Mapping from Weak Lensing Shear

We infer gravitational lensing shear and convergence fields from galaxy ellipticity catalogs under a spatial process prior for the lensing potential. We demonstrate the performance of our algorithm with simulated Gaussian-distributed cosmological lensing shear maps and a reconstruction of the mass distribution of the merging galaxy cluster Abell 781 using galaxy ellipticities measured with the Deep Lens Survey. Given interim posterior samples of lensing shear or convergence fields on the sky, we describe an algorithm to infer cosmological parameters via lens field marginalization. In the most general formulation of our algorithm we make no assumptions about weak shear or Gaussian-distributed shape noise or shears. Because we require solutions and matrix determinants of a linear system of dimension that scales with the number of galaxies, we expect our algorithm to require parallel high-performance computing resources for application to ongoing wide field lensing surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Conformal diagrams for the gravitational collapse of a spherically symmetric dust cloud

We present an algorithm for the construction of conformal coordinates in the interior of a spherically symmetric, collapsing matter cloud in general relativity. This algorithm is based on the numerical integration of radial null geodesics. As an application we generate conformal diagrams for collapsing spherical dust clouds and analyze the causal structure of the resulting spacetimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Grid-Interactive Electric Vehicle and Building Coordination Using Coupled Distributed Control: Preprint

As an increasing number of controllable devices are introduced onto the grid, they can individually provide ancillary services in support of grid stability. However, the goals of each device differ due to their type and individual objectives, causing instances where they may conflict. To reduce the chances of these devices contributing to grid instability, these devices must effectively communicate in a cooperative manner to both meet their own needs while providing services to the grid. Previous work demonstrates that the NALD (Network Lasso-ADMM - Limited Communication - DMPC) algorithm allows coordination between two subsystems that use different control algorithms (building and charging stations) to provide services to the grid and individually optimize their performance in a specific scenario. The ideal NALD algorithm should be generalized to allow plug-and-play capabilities across devices of differing characteristics. This paper takes a step toward generalizability by updating the electric vehicle charging objective and re-defining the communication scheme compared to prior work to generalize the coordination and, as a result, improve the performance of the NALD algorithm.

ADVANCED PROPULSION SYSTEMS,ENERGY CONSERVATION, C↗