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 865 records · Page 48

The origin of linear scaling Fock matrix calculation with density prescreening

A theorem was proven, which reads that the number of nonzero two-electron integrals scales linearly with respect to the number of basis functions for large molecular systems. This permits to show that linear scaling property of the Fock matrix calculation with using density prescreening arises due to linear scaling properties of the number of nonzero two-electron integrals and the number of leading matrix elements of density matrix. This property is reinforced by employing the density prescreening technique. The use of the density difference prescreening further improves the linear scaling property of the Fock matrix calculation method. As a result, the linear scaling regime of the Fock matrix calculation can begin from the number of basis functions of 2000–3000 in dependence on the basis function type in molecular calculations. It was also shown that the conventional algorithm of Fock matrix calculation from stored nonzero two-electron integrals with density prescreening possesses linear scaling property.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Syntheses of terminal control for nonlinear stationary controlled system under incomplete information

By constructing a Luenberger-type asymptotic observer, a method of finding the control function, that ensures the translation of a class of nonlinear stationary control systems of ordinary differential equations from the initial state to a given final state taking into account the actual measured values, was developed. A constructive criterion guaranteeing the existence of solution of this problem was found. An algorithm is proposed for constructing a control function that transfer wide class of nonlinear systems of ordinary differential equations from an initial state to an fixed state. The algorithm is convenient for numerical implementation. A constructive condition is obtained for which this transfer is possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal quantum computation by discontinuous quantum walk

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum ''walker'' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This ''discontinuous'' quantum walk employs perfect quantum-state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one time step apart.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simultaneous depth determination of multiple objects by focus analysis in digital holography

Focus analysis techniques from computer vision are applied to digital holography to determine the depth (range) of multiple objects and their surfaces from a single hologram capture. With this method the depths of objects can be determined from a single hologram capture without the need for manual focusing and without prior information on object location. Variance and the Laplacian of Gaussian are analyzed as focus measures, and techniques are proposed for focus plane determination from the focus measure curves. The algorithm is described in detail and demonstrated through simulation and optical experiment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Information and meaning revisiting Shannon's theory of communication and extending it to address today s technical problems.

This paper has three goals. The first is to review Shannon's theory of information and the subsequent advances leading to today's statistics-based text analysis algorithms, showing that the semantics of the text is neglected. The second goal is to propose an extension of Shannon's original model that can take into account semantics, where the 'semantics' of a message is understood in terms of the intended or actual changes on the recipient of a message. The third goal is to propose several lines of research that naturally fall out of the proposed model. Each computational approach to solving some problem rests on an underlying model or set of models that describe how key phenomena in the real world are represented and how they are manipulated. These models are both liberating and constraining. They are liberating in that they suggest a path of development for new tools and algorithms. They are constraining in that they intentionally ignore other potential paths of development. Modern statistical-based text analysis algorithms have a specific intellectual history and set of underlying models rooted in Shannon's theory of communication. For Shannon, language is treated as a stochastic generator of symbol sequences. Shannon himself, subsequently Weaver, and at least one of his predecessors are all explicit in their decision to exclude semantics from their models. This rejection of semantics as 'irrelevant to the engineering problem' is elegant and combined with developments particularly by Salton and subsequently by Latent Semantic Analysis, has led to a whole collection of powerful algorithms and an industry for data mining technologies. However, the kinds of problems currently facing us go beyond what can be accounted for by this stochastic model. Today's problems increasingly focus on the semantics of specific pieces of information. And although progress is being made with the old models, it seems natural to develop or extend information theory to account for semantics. By developing such theory, we can improve the quality of the next generation analytical tools. Far from being a mere intellectual curiosity, a new theory can provide the means for us to take into account information that has been to date ignored by the algorithms and technologies we develop. This paper will begin with an examination of Shannon's theory of communication, discussing the contributions and the limitations of the theory and how that theory gets expanded into today's statistical text analysis algorithms. Next, we will expand Shannon's model. We'll suggest a transactional definition of semantics that focuses on the intended and actual change that messages are intended to have on the recipient. Finally, we will examine implications of the model for algorithm development.

99 GENERAL AND MISCELLANEOUS↗

A numerical algorithm to propagate navigation error covariance matrices associated with generalized strapdown inertial measurement units

The design and operation of a Strapdown Navigation Analysis Program (SNAP) developed to perform covariance analysis on spacecraft inertial-measurement-unit (IMU) navigation errors are described and demonstrated. Consideration is given to the IMU modeling subroutine (with user-specified sensor characteristics), the data input procedures, state updates and the simulation of instrument failures, the determination of the nominal trajectory, the mapping-matrix and Monte Carlo covariance-matrix propagation methods, and aided-navigation simulation. Numerical results are presented in tables for sample applications involving (1) the Galileo/IUS spacecraft from its deployment from the Space Shuttle to a point 10 to the 8th ft from the center of the earth and (2) the TDRS-C/IUS spacecraft from Space Shuttle liftoff to a point about 2 h before IUS deployment. SNAP is shown to give reliable results for both cases, with good general agreement between the mapping-matrix and Monte Carlo predictions.

Weir, Kent A.↗

Mystic: Implementation of the Static Dynamic Optimal Control Algorithm for High-Fidelity, Low-Thrust Trajectory Design

Mystic software is designed to compute, analyze, and visualize optimal high-fidelity, low-thrust trajectories, The software can be used to analyze inter-planetary, planetocentric, and combination trajectories, Mystic also provides utilities to assist in the operation and navigation of low-thrust spacecraft. Mystic will be used to design and navigate the NASA's Dawn Discovery mission to orbit the two largest asteroids, The underlying optimization algorithm used in the Mystic software is called Static/Dynamic Optimal Control (SDC). SDC is a nonlinear optimal control method designed to optimize both 'static variables' (parameters) and dynamic variables (functions of time) simultaneously. SDC is a general nonlinear optimal control algorithm based on Bellman's principal.

low thrust↗

Probabilistic Independence Networks for Hidden Markov Probability Models

In this paper we explore hidden Markov models(HMMs) and related structures within the general framework of probabilistic independence networks (PINs). The paper contains a self-contained review of the basic principles of PINs. It is shown that the well-known forward-backward (F-B) and Viterbi algorithms for HMMs are special cases of more general enference algorithms for arbitrary PINs.

random variables pattern recognition signal proces↗

A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids

A solution procedure for solving nonlinear time-marching problems is presented. The nonsymmetric systems of equations arising from a Newton-type linearization of these time-marching problems are solved using an iterative strategy based on the generalized minimal residual (GMRES) algorithm. Matrix-free techniques leading to reduction in storage are presented. Incorporation of a linesearch algorithm in the Newton-GMRES scheme is discussed. An automatic time-increment control strategy is developed to increase the stability of the time-marching process. High-speed flow computations demonstrate the effectiveness of these algorithms.

Johan, Zdenek↗

A Multilevel Algorithm for the Solution of Second Order Elliptic Differential Equations on Sparse Grids

A multilevel algorithm is presented that solves general second order elliptic partial differential equations on adaptive sparse grids. The multilevel algorithm consists of several V-cycles. Suitable discretizations provide that the discrete equation system can be solved in an efficient way. Numerical experiments show a convergence rate of order Omicron(1) for the multilevel algorithm.

Pflaum, Christoph↗

Parallelized event chain algorithm for dense hard sphere and polymer systems

We combine parallelization and cluster Monte Carlo for hard sphere systems and present a parallelized event chain algorithm for the hard disk system in two dimensions. For parallelization we use a spatial partitioning approach into simulation cells. We find that it is crucial for correctness to ensure detailed balance on the level of Monte Carlo sweeps by drawing the starting sphere of event chains within each simulation cell with replacement. We analyze the performance gains for the parallelized event chain and find a criterion for an optimal degree of parallelization. Because of the cluster nature of event chain moves massive parallelization will not be optimal. Finally, we discuss first applications of the event chain algorithm to dense polymer systems, i.e., bundle-forming solutions of attractive semiflexible polymers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Integration of Quantum Mechanical Wave Equations by Unitary Transforms

The integration of time dependent quantum mechanical wave equations is a fundamental problem in computational physics and computational chemistry. The energy and momentum spectrum of a wave function imposes fundamental limits on the performance of numerical algorithms for this problem. We demonstrate how unitary transforms can help to surmount these limitations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How to efficiently select an arbitrary Clifford group element

We give an algorithm which produces a unique element of the Clifford group on n qubits (C{sub n}) from an integer 0≤i<|C{sub n}| (the number of elements in the group). The algorithm involves O(n{sup 3}) operations and provides, in addition to a canonical mapping from the integers to group elements g, a factorization of g into a sequence of at most 4n symplectic transvections. The algorithm can be used to efficiently select random elements of C{sub n} which are often useful in quantum information theory and quantum computation. We also give an algorithm for the inverse map, indexing a group element in time O(n{sup 3})

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The NIFTY way of Bayesian signal inference

We introduce NIFTY, 'Numerical Information Field Theory', a software package for the development of Bayesian signal inference algorithms that operate independently from any underlying spatial grid and its resolution. A large number of Bayesian and Maximum Entropy methods for 1D signal reconstruction, 2D imaging, as well as 3D tomography, appear formally similar, but one often finds individualized implementations that are neither flexible nor easily transferable. Signal inference in the framework of NIFTY can be done in an abstract way, such that algorithms, prototyped in 1D, can be applied to real world problems in higher-dimensional settings. NIFTY as a versatile library is applicable and already has been applied in 1D, 2D, 3D and spherical settings. A recent application is the D{sup 3}PO algorithm targeting the non-trivial task of denoising, deconvolving, and decomposing photon observations in high energy astronomy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluation of an analytic linear Boltzmann transport equation solver for high-density inhomogeneities

Purpose: Acuros external beam (Acuros XB) is a novel dose calculation algorithm implemented through the ECLIPSE treatment planning system. The algorithm finds a deterministic solution to the linear Boltzmann transport equation, the same equation commonly solved stochastically by Monte Carlo methods. This work is an evaluation of Acuros XB, by comparison with Monte Carlo, for dose calculation applications involving high-density materials. Existing non-Monte Carlo clinical dose calculation algorithms, such as the analytic anisotropic algorithm (AAA), do not accurately model dose perturbations due to increased electron scatter within high-density volumes. Methods: Acuros XB, AAA, and EGSnrc based Monte Carlo are used to calculate dose distributions from 18 MV and 6 MV photon beams delivered to a cubic water phantom containing a rectangular high density (4.0-8.0 g/cm{sup 3}) volume at its center. The algorithms are also used to recalculate a clinical prostate treatment plan involving a unilateral hip prosthesis, originally evaluated using AAA. These results are compared graphically and numerically using gamma-index analysis. Radio-chromic film measurements are presented to augment Monte Carlo and Acuros XB dose perturbation data. Results: Using a 2% and 1 mm gamma-analysis, between 91.3% and 96.8% of Acuros XB dose voxels containing greater than 50% the normalized dose were in agreement with Monte Carlo data for virtual phantoms involving 18 MV and 6 MV photons, stainless steel and titanium alloy implants and for on-axis and oblique field delivery. A similar gamma-analysis of AAA against Monte Carlo data showed between 80.8% and 87.3% agreement. Comparing Acuros XB and AAA evaluations of a clinical prostate patient plan involving a unilateral hip prosthesis, Acuros XB showed good overall agreement with Monte Carlo while AAA underestimated dose on the upstream medial surface of the prosthesis due to electron scatter from the high-density material. Film measurements support the dose perturbations demonstrated by Monte Carlo and Acuros XB data. Conclusions: Acuros XB is shown to perform as well as Monte Carlo methods and better than existing clinical algorithms for dose calculations involving high-density volumes.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-E-I-81: Assessment of CT Radiation Dose and Image Quality for An Automated Tube Potential Selection Algorithm Using Adult Anthropomorphic and ACR Phantoms

Purpose: To assess the impact of General Electrics (GE) automated tube potential algorithm, kV assist (kVa) on radiation dose and image quality, with an emphasis on optimizing protocols based on noise texture. Methods: Radiation dose was assessed by inserting optically stimulated luminescence dosimeters (OSLs) throughout the body of an adult anthropomorphic phantom (CIRS). The baseline protocol was: 120 kVp, Auto mA (180 to 380 mA), noise index (NI) = 14, adaptive iterative statistical reconstruction (ASiR) of 20%, 0.8s rotation time. Image quality was evaluated by calculating the contrast to noise ratio (CNR) and noise power spectrum (NPS) from the ACR CT accreditation phantom. CNRs were calculated according to the steps described in ACR CT phantom testing document. NPS was determined by taking the 3D FFT of the uniformity section of the ACR phantom. NPS and CNR were evaluated with and without kVa and for all available adaptive iterative statistical reconstruction (ASiR) settings, ranging from 0 to 100%. Each NPS was also evaluated for its peak frequency difference (PFD) with respect to the baseline protocol. Results: The CNR for the adult male was found to decrease from CNR = 0.912 ± 0.045 for the baseline protocol without kVa to a CNR = 0.756 ± 0.049 with kVa activated. When compared against the baseline protocol, the PFD at ASiR of 40% yielded a decrease in noise magnitude as realized by the increase in CNR = 0.903 ± 0.023. The difference in the central liver dose with and without kVa was found to be 0.07%. Conclusion: Dose reduction was insignificant in the adult phantom. As determined by NPS analysis, ASiR of 40% produced images with similar noise texture to the baseline protocol. However, the CNR at ASiR of 40% with kVa fails to meet the current ACR CNR passing requirement of 1.0.

60 APPLIED LIFE SCIENCES↗

The Voronoi Tessellation Cluster Finder in 2 1 Dimensions

We present a detailed description of the Voronoi Tessellation (VT) cluster finder algorithm in 2+1 dimensions, which improves on past implementations of this technique. The need for cluster finder algorithms able to produce reliable cluster catalogs up to redshift 1 or beyond and down to 10{sup 13.5} solar masses is paramount especially in light of upcoming surveys aiming at cosmological constraints from galaxy cluster number counts. We build the VT in photometric redshift shells and use the two-point correlation function of the galaxies in the field to both determine the density threshold for detection of cluster candidates and to establish their significance. This allows us to detect clusters in a self-consistent way without any assumptions about their astrophysical properties. We apply the VT to mock catalogs which extend to redshift 1.4 reproducing the ?CDM cosmology and the clustering properties observed in the Sloan Digital Sky Survey data. An objective estimate of the cluster selection function in terms of the completeness and purity as a function of mass and redshift is as important as having a reliable cluster finder. We measure these quantities by matching the VT cluster catalog with the mock truth table. We show that the VT can produce a cluster catalog with completeness and purity >80% for the redshift range up to {approx}1 and mass range down to {approx}10{sup 13.5} solar masses.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The computer-based model of quantum measurements

Quantum theory of measurements is an extremely important part of quantum mechanics. Currently perturbations by quantum measurements of observable quantities of atomic systems are rarely taken into account in computing algorithms and calculations. In the previous studies of the authors, constructive model of quantum measurements has been developed and implemented in the form of symbolic and numerical calculations for the hydrogen-like atoms. This work describes a generalization of these results to the alkali metal atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗