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 307 records · Page 17

Time-Domain Simulation of RF Couplers

We have developed a finite-difference time-domain (FDTD) fluid-like approach to integrated plasma-and-coupler simulation [1], and show how it can be used to model LH and ICRF couplers in the MST and larger tokamaks.[2] This approach permits very accurate 3-D representation of coupler geometry, and easily includes non-axi-symmetry in vessel wall, magnetic equilibrium, and plasma density. The plasma is integrated with the FDTD Maxwell solver in an implicit solve that steps over electron time-scales, and permits tenuous plasma in the coupler itself, without any need to distinguish or interface between different regions of vacuum and/or plasma. The FDTD algorithm is also generalized to incorporate a time-domain sheath potential [3] on metal structures within the simulation, to look for situations where the sheath potential might generate local sputtering opportunities. Benchmarking of the time-domain sheath algorithm has been reported in the references. Finally, the time-domain software [4] permits the use of particles, either as field diagnostic (test particles) or to self-consistently compute plasma current from the applied RF power.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Transmission integral analysis of Mössbauer spectra displaying hyperfine parameter distributions with arbitrary profile

Accurate quantitative analysis of Mössbauer spectra displaying thickness effects requires the consideration of the so-called transmission integral when modeling the spectral shape. Whereas this is straightforward when the correct model for the decomposition of the absorber's nuclear resonance absorption cross-section into individual components is a priori known, in the absence of such knowledge and notably in the presence of hyperfine parameter distributions with an unknown profile, the so-called model-independent evaluation methods could be used to fit the spectra. However, the methods available for this purpose were developed for the analysis of spectra for which the thin absorber approximation is valid, and thus they do not take the sample thickness and related effects into account. Consequently, in order to use them for spectra displaying thickness effects, their usage needs to be generalized by combining them with transmission integral fitting. A new algorithm realizing such a generalized version of the Hesse-Rübartsch model-independent evaluation method was developed recently as an integral part of the MossWinn program. In the present work, the working principle of the newly developed algorithm is described in details along with examples illustrating the capabilities of the method for the case of {sup 57}Fe Mössbauer spectroscopy.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multi-Attribute Subset Selection enables prediction of representative phenotypes across microbial populations

The interpretation of complex biological datasets requires the identification of representative variables that describe the data without critical information loss. This is particularly important in the analysis of large phenotypic datasets (phenomics). Here we introduce Multi-Attribute Subset Selection (MASS), an algorithm which separates a matrix of phenotypes (e.g., yield across microbial species and environmental conditions) into predictor and response sets of conditions. Using mixed integer linear programming, MASS expresses the response conditions as a linear combination of the predictor conditions, while simultaneously searching for the optimally descriptive set of predictors. We apply the algorithm to three microbial datasets and identify environmental conditions that predict phenotypes under other conditions, providing biologically interpretable axes for strain discrimination. MASS could be used to reduce the number of experiments needed to identify species or to map their metabolic capabilities. The generality of the algorithm allows addressing subset selection problems in areas beyond biology.

59 BASIC BIOLOGICAL SCIENCES↗

On the regularity of the covariance matrix of a discretized scalar field on the sphere

We present a comprehensive study of the regularity of the covariance matrix of a discretized field on the sphere. In a particular situation, the rank of the matrix depends on the number of pixels, the number of spherical harmonics, the symmetries of the pixelization scheme and the presence of a mask. Taking into account the above mentioned components, we provide analytical expressions that constrain the rank of the matrix. They are obtained by expanding the determinant of the covariance matrix as a sum of determinants of matrices made up of spherical harmonics. We investigate these constraints for five different pixelizations that have been used in the context of Cosmic Microwave Background (CMB) data analysis: Cube, Icosahedron, Igloo, GLESP and HEALPix, finding that, at least in the considered cases, the HEALPix pixelization tends to provide a covariance matrix with a rank closer to the maximum expected theoretical value than the other pixelizations. The effect of the propagation of numerical errors in the regularity of the covariance matrix is also studied for different computational precisions, as well as the effect of adding a certain level of noise in order to regularize the matrix. In addition, we investigate the application of the previous results to a particular example that requires the inversion of the covariance matrix: the estimation of the CMB temperature power spectrum through the Quadratic Maximum Likelihood algorithm. Finally, some general considerations in order to achieve a regular covariance matrix are also presented.

79 ASTRONOMY AND ASTROPHYSICS↗

Calculation of QCD loops using tree-level matrix elements

The possibility of treating colour in one-loop amplitude calculations alike the other quantum numbers is briefly discussed for semi-numerical algorithms based on generalized unitarity and parametric integration techniques. Numerical results are presented for the calculation of virtual corrections in multi-gluon scattering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Discrimination of unitary transformations in the Deutsch-Jozsa algorithm: Implications for thermal-equilibrium-ensemble implementations

A general framework for regarding oracle-assisted quantum algorithms as tools for discriminating among unitary transformations is described. This framework is applied to the Deutsch-Jozsa problem and all possible quantum algorithms which solve the problem with certainty using oracle unitaries in a particular form are derived. It is also used to show that any quantum algorithm that solves the Deutsch-Jozsa problem starting with a quantum system in a particular class of initial, thermal equilibrium-based states of the type encountered in solution-state NMR can only succeed with greater probability than a classical algorithm when the problem size n exceeds {approx}10{sup 5}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum mixed state compiling

The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generalization of previous VQAs that aimed at learning preparation circuits for pure states. We consider two different ansätze for compiling the target state; the first is based on learning a purification of the state and the second on representing it as a convex combination of pure states. In both cases, the resources required to store and manipulate the compiled state grow with the rank of the approximation. Thus, by learning a lower rank approximation of the target state, our algorithm provides a means of compressing a state for more efficient processing. As a byproduct of our algorithm, one effectively learns the principal components of the target state, and hence our algorithm further provides a new method for principal component analysis. We investigate the efficacy of our algorithm through extensive numerical implementations, showing that typical random states and thermal states of many body systems may be learnt this way. Additionally, we demonstrate on quantum hardware how our algorithm can be used to study hardware noise-induced states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case

This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse non-symmetric matrices. We assume a general sparse matrix A has been decomposed as $PAQ$ = $LU$ on a distributed memory parallel machine, where L, U are lower and upper triangular matrices, and P, Q are permutation matrices, respectively. The PSelInvmethod computes selected elements of $A$ -1 . The selection is confined by the sparsity pattern of the matrix A T . Here our algorithm does not assume any symmetry properties of A, and our parallel implementation is memory efficient, in the sense that the computed elements of $A$ -T overwrites the sparse matrix $L + U$ in situ . PSelInv involves a large number of collective data communication activities within different processor groups of various sizes. In order to minimize idle time and improve load balancing, tree-based asynchronous communication is used to coordinate all such collective communication. Numerical results demonstrate that PSelInv can scale efficiently to 6,400 cores for a variety of matrices.

97 MATHEMATICS AND COMPUTING↗

NP-hardness of decoding quantum error-correction codes

Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Controlled transitions between cupolets of chaotic systems

We present an efficient control scheme that stabilizes the unstable periodic orbits of a chaotic system. The resulting orbits are known as cupolets and collectively provide an important skeleton for the dynamical system. Cupolets exhibit the interesting property that a given sequence of controls will uniquely identify a cupolet, regardless of the system's initial state. This makes it possible to transition between cupolets, and thus unstable periodic orbits, simply by switching control sequences. We demonstrate that although these transitions require minimal controls, they may also involve significant chaotic transients unless carefully controlled. As a result, we present an effective technique that relies on Dijkstra's shortest path algorithm from algebraic graph theory to minimize the transients and also to induce certainty into the control of nonlinear systems, effectively providing an efficient algorithm for the steering and targeting of chaotic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Density-Matrix Based Extended Lagrangian Born–Oppenheimer Molecular Dynamics

Extended Lagrangian Born–Oppenheimer molecular dynamics [ Phys. Rev. Lett. 2008, 100, 123004] is presented for Hartree–Fock theory, where the extended electronic degrees of freedom are represented by a density matrix, including fractional occupation numbers at elevated electronic temperatures. In contrast to regular direct Born–Oppenheimer molecular dynamics simulations, no iterative self-consistent field optimization is required prior to the force evaluations. To sample regions of the potential energy landscape where the gap is small or vanishing, which leads to particular convergence problems in regular direct Born–Oppenheimer molecular dynamics simulations, an adaptive integration scheme for the extended electronic degrees of freedom is presented. The integration scheme is based on a tunable, low-rank approximation of a fourth-order kernel, K, that determines the metric tensor, T ≡ K T K, used in the extended harmonic oscillator of the Lagrangian that generates the dynamics of the electronic degrees of freedom. Here, the formulation and algorithms provide a general guide to implement extended Lagrangian Born–Oppenheimer molecular dynamics for quantum chemistry, density functional theory, and semiempirical methods using a density matrix formalism.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Atomistic hybrid DSMC/NEMD method for nonequilibrium multiscale simulations

A multiscale hybrid method for coupling the direct simulation Monte Carlo (DSMC) method to the nonequilibrium molecular dynamics (NEMD) method is introduced. The method addresses Knudsen layer type gas flows within a few mean free paths of an interface or about an object with dimensions of the order of a few mean free paths. It employs the NEMD method to resolve nanoscale phenomena closest to the interface along with coupled DSMC simulation of the remainder of the Knudsen layer. The hybrid DSMC/NEMD method is a particle based algorithm without a buffer zone. It incorporates a new, modified generalized soft sphere (MGSS) molecular collision model to improve the poor computational efficiency of the traditional generalized soft sphere GSS model and to achieve DSMC compatibility with Lennard-Jones NEMD molecular interactions. An equilibrium gas, a Fourier thermal flow, and an oscillatory Couette flow, are simulated to validate the method. The method shows good agreement with Maxwell-Boltzmann theory for the equilibrium system, Chapman-Enskog theory for Fourier flow, and pure DSMC simulations for oscillatory Couette flow. Speedup in CPU time of the hybrid solver is benchmarked against a pure NEMD solver baseline for different system sizes and solver domain partitions. Finally, the hybrid method is applied to investigate interaction of argon gas with solid surface molecules in a parametric study of the influence of wetting effects and solid molecular mass on energy transfer and thermal accommodation coefficients. It is determined that wetting effect strength and solid molecular mass have a significant impact on the energy transfer between gas and solid phases and thermal accommodation coefficient.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-classical hybrid algorithm for the simulation of all-electron correlation

While chemical systems containing hundreds to thousands of electrons remain beyond the reach of quantum devices, hybrid quantum-classical algorithms present a promising pathway toward a quantum advantage. Hybrid algorithms treat the exponentially scaling part of the calculation-the static correlation-on the quantum computer and the non-exponentially scaling part-the dynamic correlation-on the classical computer. While a variety of algorithms have been proposed, the dependence of many methods on the total wave function limits the development of easy-to-use classical post-processing implementations. Here, we present a novel combination of quantum and classical algorithms, which computes the all-electron energy of a strongly correlated molecular system on the classical computer from the 2-electron reduced density matrix (2-RDM) evaluated on the quantum device. Significantly, we circumvent the wave function in the all-electron calculations by using density matrix methods that only require input of the statically correlated 2-RDM. Although the algorithm is completely general, we test it with two classical density matrix methods, the anti-Hermitian contracted Schrödinger equation (ACSE) and multiconfiguration pair-density functional theories, using the recently developed quantum ACSE method for simulating the statically correlated 2-RDM. Furthermore, we obtain experimental accuracy for the relative energies of all three benzyne isomers and thereby demonstrate the ability of the developed algorithm to achieve chemically relevant and accurate results on noisy intermediate-scale quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SCONCE : a cosmic web finder for spherical and conic geometries

The latticework structure known as the cosmic web provides a valuable insight into the assembly history of large-scale structures. Despite the variety of methods to identify the cosmic web structures, they mostly rely on the assumption that galaxies are embedded in a Euclidean geometric space. Here, we present a novel cosmic web identifier called SCONCE (Spherical and CONic Cosmic wEb finder) that inherently considers the 2D (RA, DEC) spherical or the 3D (RA, DEC, z) conic geometry. The proposed algorithms in sconce generalize the well-known subspace constrained mean shift (SCMS) method and primarily address the predominant filament detection problem. They are intrinsic to the spherical/conic geometry and invariant to data rotations. We further test the efficacy of our method with an artificial cross-shaped filament example and apply it to the SDSS galaxy catalogue, revealing that the 2D spherical version of our algorithms is robust even in regions of high declination. Finally, using N-body simulations from Illustris, we show that the 3D conic version of our algorithms is more robust in detecting filaments than the standard SCMS method under the redshift distortions caused by the peculiar velocities of haloes. Our cosmic web finder is packaged in python as SCONCE-SCMS and has been made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗

Decoding {beta}-decay systematics: A global statistical model for {beta}{sup -} half-lives

Statistical modeling of nuclear data provides a novel approach to nuclear systematics complementary to established theoretical and phenomenological approaches based on quantum theory. Continuing previous studies in which global statistical modeling is pursued within the general framework of machine learning theory, we implement advances in training algorithms designed to improve generalization, in application to the problem of reproducing and predicting the half-lives of nuclear ground states that decay 100% by the {beta}{sup -} mode. More specifically, fully connected, multilayer feed-forward artificial neural network models are developed using the Levenberg-Marquardt optimization algorithm together with Bayesian regularization and cross-validation. The predictive performance of models emerging from extensive computer experiments is compared with that of traditional microscopic and phenomenological models as well as with the performance of other learning systems, including earlier neural network models as well as the support vector machines recently applied to the same problem. In discussing the results, emphasis is placed on predictions for nuclei that are far from the stability line, and especially those involved in r-process nucleosynthesis. It is found that the new statistical models can match or even surpass the predictive performance of conventional models for {beta}-decay systematics and accordingly should provide a valuable additional tool for exploring the expanding nuclear landscape.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evaluating iterative reconstruction performance in computed tomography

Purpose: Iterative reconstruction (IR) offers notable advantages in computed tomography (CT). However, its performance characterization is complicated by its potentially nonlinear behavior, impacting performance in terms of specific tasks. This study aimed to evaluate the performance of IR with both task-specific and task-generic strategies. Methods: The performance of IR in CT was mathematically assessed with an observer model that predicted the detection accuracy in terms of the detectability index (d′). d′ was calculated based on the properties of the image noise and resolution, the observer, and the detection task. The characterizations of image noise and resolution were extended to accommodate the nonlinearity of IR. A library of tasks was mathematically modeled at a range of sizes (radius 1–4 mm), contrast levels (10–100 HU), and edge profiles (sharp and soft). Unique d′ values were calculated for each task with respect to five radiation exposure levels (volume CT dose index, CTDI{sub vol}: 3.4–64.8 mGy) and four reconstruction algorithms (filtered backprojection reconstruction, FBP; iterative reconstruction in imaging space, IRIS; and sinogram affirmed iterative reconstruction with strengths of 3 and 5, SAFIRE3 and SAFIRE5; all provided by Siemens Healthcare, Forchheim, Germany). The d′ values were translated into the areas under the receiver operating characteristic curve (AUC) to represent human observer performance. For each task and reconstruction algorithm, a threshold dose was derived as the minimum dose required to achieve a threshold AUC of 0.9. A task-specific dose reduction potential of IR was calculated as the difference between the threshold doses for IR and FBP. A task-generic comparison was further made between IR and FBP in terms of the percent of all tasks yielding an AUC higher than the threshold. Results: IR required less dose than FBP to achieve the threshold AUC. In general, SAFIRE5 showed the most significant dose reduction potentials (11–54 mGy, 77%–84%), followed by SAFIRE3 (7–36 mGy, 50%–61%) and IRIS (6–26 mGy, 37%–50%). The dose reduction potentials highly depended on task size and task contrast, with tasks of lower contrasts and smaller sizes, i.e., more challenging tasks, indicating higher dose reductions. Softer edge profile showed higher dose reduction potentials with SAFIRE3 and SAFIRE5, but not with IRIS. The task-generic comparison between IR and FBP demonstrated the overall superiority of IR performance, as IR allowed a larger percent of tasks to exceed the threshold AUC: IRIS, 8%–12%; SAFIRE3, 10%–16%; and SAFIRE5, 20%–33%. The improvement with IR was generally more pronounced at lower dose levels. Conclusions: Expanding beyond traditional contrast and noise based assessments of IR, we performed both task-specific and task-generic evaluations of IR performance. The task-specific evaluation demonstrated the dependency of IR’s dose reduction potential on task attributes, which can be employed to optimize IR for clinical indications with specific range of size and contrast. The task-generic evaluation demonstrated IR’s overall superiority over FBP in terms of the range of tasks exceeding a threshold performance level, which can be employed for general comparisons between algorithms.

60 APPLIED LIFE SCIENCES↗