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 505 records · Page 28

Parallel implementation of multireference coupled-cluster theories based on the reference-level parallelism

A novel algorithm for implementing general type of multireference coupled-cluster (MRCC) theory based on the Jeziorski-Monkhorst exponential Ansatz [B. Jeziorski, H.J. Monkhorst, Phys. Rev. A 24, 1668 (1981)] is introduced. The proposed algorithm utilizes processor groups to calculate the equations for the MRCC amplitudes. In the basic formulation each processor group constructs the equations related to a specific subset of references. By flexible choice of processor groups and subset of reference-specific sufficiency conditions designated to a given group one can assure optimum utilization of available computing resources. The performance of this algorithm is illustrated on the examples of the Brillouin-Wigner and Mukherjee MRCC methods with singles and doubles (BW-MRCCSD and Mk-MRCCSD). A significant improvement in scalability and in reduction of time to solution is reported with respect to recently reported parallel implementation of the BW-MRCCSD formalism [J.Brabec, H.J.J. van Dam, K. Kowalski, J. Pittner, Chem. Phys. Lett. 514, 347 (2011)].

99 GENERAL AND MISCELLANEOUS↗

Generalized Multiscale Inversion for Heterogeneous Problems

In this work, we propose a generalized multiscale inversion algorithm for heterogeneous problems that aims at solving an inverse problem on a computational coarse grid. Previous inversion techniques for multiscale problems seek a coarse-grid medium properties, e.g., permeability and conductivity, and by doing so, they assume that there exists a homogenized representation of the underlying fine-scale permeability field on a coarse grid. Generally such assumptions do not hold for highly heterogeneous fields, e.g., fracture media or channelized fields, where the width of channels are very small compared to the scale of coarse grids. In these cases, grid refinement can lead to many degrees of freedom, and thus numerically unattractive to apply. The proposed algorithm is based on the Generalized Multiscale Finite Element Method (GMsFEM), which uses local spectral problems to identify non-localized features, i.e., channels (high-conductivity inclusions that connect the boundaries of the coarse-grid block). The inclusion of these features in the coarse space enables one to achieve a good accuracy. The approach is valid under the assumption that the solution can be well represented in a reduced-dimensional space spanned by multiscale basis functions. In practice, these basis functions are non-observable as we do not identify the fine-scale features of the permeability field. Our inversion algorithm finds the discretization parameters of the resulting system on the coarse grid. By doing so, we identify the appropriate coarse-grid parameters representing the permeability field instead of fine-grid permeability field. We illustrate the potential of the approach by numerical results for fractured media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Bayesian framework for adaptive selection, calibration, and validation of coarse-grained models of atomistic systems

A general adaptive modeling algorithm for selection and validation of coarse-grained models of atomistic systems is presented. A Bayesian framework is developed to address uncertainties in parameters, data, and model selection. Algorithms for computing output sensitivities to parameter variances, model evidence and posterior model plausibilities for given data, and for computing what are referred to as Occam Categories in reference to a rough measure of model simplicity, make up components of the overall approach. Computational results are provided for representative applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced order feedback control equations for linear time and frequency domain analysis

An algorithm was developed which can be used to obtain the equations. In a more general context, the algorithm computes a real nonsingular similarity transformation matrix which reduces a real nonsymmetric matrix to block diagonal form, each block of which is a real quasi upper triangular matrix. The algorithm works with both defective and derogatory matrices and when and if it fails, the resultant output can be used as a guide for the reformulation of the mathematical equations that lead up to the ill conditioned matrix which could not be block diagonalized.

Frisch, H. P.↗

Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer

Many eigenvalue problems arising in practice are often of the generalized form A x = λ B x . One particularly important case is symmetric, namely A , B are Hermitian and B is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than the standard one based on quantum phase estimation. Moreover, it works for a wider case than symmetric: B is invertible, B - 1 A is diagonalizable and all the eigenvalues are real.

Science & Technology - Other Topics↗

Preparing Ground States of Quantum Many-Body Systems on a Quantum Computer

Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to determine the one with lowest energy, requiring a running time proportional to N. A quantum computer, if it could be built, could solve this problem in time {radical}(N). Here, we present a powerful extension of this result to the case of interacting quantum particles, demonstrating that a quantum computer can prepare the ground state of a quantum system as efficiently as it does for classical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A spectral-Lagrangian Boltzmann solver for a multi-energy level gas

In this paper a spectral-Lagrangian method is proposed for the full, non-linear Boltzmann equation for a multi-energy level gas typical of a hypersonic re-entry flow. Internal energy levels are treated as separate species and inelastic collisions (leading to internal energy excitation and relaxation) are accounted for. The formulation developed can also be used for the case of a gas mixture made of monatomic gases without internal energy (where only elastic collisions occur). The advantage of the spectral-Lagrangian method lies in the generality of the algorithm in use for the evaluation of the elastic and inelastic collision operators, as well as the conservation of mass, momentum and energy during collisions. The latter is realized through the solution of constrained optimization problems. The computational procedure is based on the Fourier transform of the partial elastic and inelastic collision operators and exploits the fact that these can be written as weighted convolutions in Fourier space with no restriction on the cross-section model. The feasibility of the proposed approach is demonstrated through numerical examples for both space homogeneous and in-homogeneous problems. Computational results are compared with those obtained by means of the DSMC method in order to assess the accuracy of the proposed spectral-Lagrangian method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uniformity measurements and new positioning algorithms for wavelength-shifting fiber neutron detectors

Wavelength-shifting (WLS) fiber scintillator detectors were successfully installed at two neutron powder diffractometers at the Spallation Neutron Source (SNS). But, they have the following second-order disadvantages: (i). they cannot have both high efficiency and images free of ghosting (position misassignment) concomitantly; (ii). the apparent detection efficiency and spatial resolution are not uniform. These issues are related to the diffusion of scintillation photons and the fluctuation in the number of photons (quantum noise) collected by photo-multiplier tubes (PMTs). Therefore, to mitigate these two issues, we developed two statistics-based positioning algorithms, i.e., a centroid algorithm (CEA) and a correlation algorithm (CA). Compared with the generally used maximum-photon algorithm (MPA), CEA eliminates the ghosting with only about a 10% loss in detection efficiency, and provides better uniformity in detection efficiency and intrinsic background. CA can effectively eliminate ghosting too, but the loss of efficiency at the group boundaries of PMTs is large. Our results indicate that both algorithms can reduce the influence of quantum noise on the neutron positioning.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SparseLU, A Novel Algorithm and Math Library for Sparse LU Factorization

Decomposing sparse matrices into lower and upper triangular matrices (sparse LU factorization) is a key operation in many computational scientific applications. We developed SparseLU, a sparse linear algebra library that implements a new algorithm for LU factorization on general sparse matrices. The new algorithm divides the input matrix into tiles to which OpenMP tasks are created for factorization computation, where only tiles that contain nonzero elements are computed. For comparative performance analysis, we used the reference library SuperLU. Testing was performed on synthetically generated matrices which replicate the conditions of the real-world matrices. SparseLU is able to reach a mean speedup of ~29× compared to SuperLU.

Valero Lara, Pedro↗

Parallel projected variable metric algorithms for unconstrained optimization

The parallel variable metric optimization algorithms of Straeter (1973) and van Laarhoven (1985) are reviewed, and the possible drawbacks of the algorithms are noted. By including Davidon (1975) projections in the variable metric updating, researchers can generalize Straeter's algorithm to a family of parallel projected variable metric algorithms which do not suffer the above drawbacks and which retain quadratic termination. Finally researchers consider the numerical performance of one member of the family on several standard example problems and illustrate how the choice of the displacement vectors affects the performance of the algorithm.

Freeman, T. L.↗

Improved quantum algorithms for linear and nonlinear differential equations

We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A non-linearly stable implicit finite element algorithm for hypersonic aerodynamics

A generalized curvilinear coordinate Taylor weak statement implicit finite element algorithm is developed for the two-dimensional and axisymmetric compressible Navier-Stokes equations for ideal and reacting gases. For accurate hypersonic simulation, air is modeled as a mixture of five perfect gases, i.e., molecular and atomic oxygen and nitrogen as well as nitric oxide. The associated pressure is then determined via Newton solution of the classical chemical equilibrium equation system. The directional semidiscretization is achieved using an optimal metric data Galerkin finite element weak statement, on a developed 'companion conservation law system', permitting classical test and trial space definitions. Utilizing an implicit Runge-Kutta scheme, the terminal algorithm is then nonlinearly stable, and second-order accurate in space and time on arbitrary curvilinear coordinates. Subsequently, a matrix tensor product factorization procedure permits an efficient numerical linear algebra handling for large Courant numbers. For ideal- and real-gas hypersonic flows, the algorithm generates essentially nonoscillatory numerical solutions in the presence of strong detached shocks and boundary layer-inviscid flow interactions.

Iannelli, G. S.↗

Equations of condition for high order Runge-Kutta-Nystrom formulae

Derivation of the equations of condition of order eight for a general system of second-order differential equations approximated by the basic Runge-Kutta-Nystrom algorithm. For this general case, the number of equations of condition is considerably larger than for the special case where the first derivative is not present. Specifically, it is shown that, for orders two through eight, the number of equations for each order is 1, 1, 1, 2, 3, 5, and 9 for the special case and is 1, 1, 2, 5, 13, 34, and 95 for the general case.

Bettis, D. G.↗

The Marshall Automated Wind Algorithm for Geostationary Satellite Wind Applications

The Marshall Automated Wind (MAW) algorithm was developed over a decade ago in support of specialized studies of mesoscale meteorology. In recent years, the algorithm has been generalized to address global climate issues and other specific objectives related to NASA missions. The MAW algorithm uses a tracking scheme which minimizes image brightness temperature differences in a sequence of satellite images to determine feature displacement (winds). With the appropriate methodology accurate satellite derived winds can be obtained from visible, infrared, and water vapor imagery. Typical errors are less than 4 m/s but depend on the quality and control constraints used in post-processing. Key to this success is the judicious use of template size and search area used for tracking, image resolution and time sampling, and selection of appropriate statistical constraints which may vary with image type and desired application. The conference paper and subsequent poster will provide details of the technique and examples of its application.

Jedlovec, Gary J.↗

Autonomous star referenced attitude determination

A general star pattern recognition algorithm has been used to develop JPL's redundant, microcomputer-equipped ASTROS II CCD star tracker into a full-sky autonomous star tracker (FAST), capable of determining its attitude about all three axes without requiring any a priori attitude knowledge. A large field of view allows the number of guide stars in the all-sky data-base of the tracker to be limited to a manageable number, while high accuracy ensures that the pattern formed by the observed guide stars is unique. The recognition algorithm can also be used for automating the acquisition of celestial targets by astronomy telescopes, for autonomously updating the attitude of gyro-based attitude control systems, and for automating ground-based attitude recognition. Using both Monte Carlo simulations and a quasi-analytical method, it is shown that the general recognition algorithm and a less software-intensive special algorithm can be used to reliably automate the acquisition of celestial targets by astronomy telescopes.

Van Bezooijen, R. W. H.↗