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,441 records · Page 80

The average length of reduced regular continued fractions

Let l(a/b) be the number of steps of the by-excess Euclidean algorithm applied to the numbers a and b. In this paper we obtain a three-term asymptotic formula for the expectation of the random value l(a/b), when 1{<=}a{<=}b{<=}R and R{yields}{infinity}. Bibliography: 11 titles.

97 MATHEMATICS AND COMPUTING↗

Algorithms for propagating uncertainty across heterogeneous domains

We address an important research area in stochastic multi-scale modeling, namely the propagation of uncertainty across heterogeneous domains characterized by partially correlated processes with vastly different correlation lengths. This class of problems arise very often when computing stochastic PDEs and particle models with stochastic/stochastic domain interaction but also with stochastic/deterministic coupling. The domains may be fully embedded, adjacent or partially overlapping. The fundamental open question we address is the construction of proper transmission boundary conditions that preserve global statistical properties of the solution across different subdomains. Often, the codes that model different parts of the domains are black-box and hence a domain decomposition technique is required. No rigorous theory or even effective empirical algorithms have yet been developed for this purpose, although interfaces defined in terms of functionals of random fields (e.g., multi-point cumulants) can overcome the computationally prohibitive problem of preserving sample-path continuity across domains. The key idea of the different methods we propose relies on combining local reduced-order representations of random fields with multi-level domain decomposition. Specifically, we propose two new algorithms: The first one enforces the continuity of the conditional mean and variance of the solution across adjacent subdomains by using Schwarz iterations. The second algorithm is based on PDE-constrained multi-objective optimization, and it allows us to set more general interface conditions. The effectiveness of these new algorithms is demonstrated in numerical examples involving elliptic problems with random diffusion coefficients, stochastically advected scalar fields, and nonlinear advection-reaction problems with random reaction rates.

Cho, Heyrim↗

Laser-plasma interactions with a Fourier-Bessel particle-in-cell method

A new spectral particle-in-cell (PIC) method for plasma modeling is presented and discussed. In the proposed scheme, the Fourier-Bessel transform is used to translate the Maxwell equations to the quasi-cylindrical spectral domain. In this domain, the equations are solved analytically in time, and the spatial derivatives are approximated with high accuracy. In contrast to the finite-difference time domain (FDTD) methods, that are used commonly in PIC, the developed method does not produce numerical dispersion and does not involve grid staggering for the electric and magnetic fields. These features are especially valuable in modeling the wakefield acceleration of particles in plasmas. The proposed algorithm is implemented in the code PLARES-PIC, and the test simulations of laser plasma interactions are compared to the ones done with the quasi-cylindrical FDTD PIC code CALDER-CIRC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Combined protein construct and synthetic gene engineering for heterologous protein expression and crystallization using Gene Composer

With the goal of improving yield and success rates of heterologous protein production for structural studies we have developed the database and algorithm software package Gene Composer. This freely available electronic tool facilitates the information-rich design of protein constructs and their engineered synthetic gene sequences, as detailed in the accompanying manuscript. In this report, we compare heterologous protein expression levels from native sequences to that of codon engineered synthetic gene constructs designed by Gene Composer. A test set of proteins including a human kinase (P38{alpha}), viral polymerase (HCV NS5B), and bacterial structural protein (FtsZ) were expressed in both E. coli and a cell-free wheat germ translation system. We also compare the protein expression levels in E. coli for a set of 11 different proteins with greatly varied G:C content and codon bias. The results consistently demonstrate that protein yields from codon engineered Gene Composer designs are as good as or better than those achieved from the synonymous native genes. Moreover, structure guided N- and C-terminal deletion constructs designed with the aid of Gene Composer can lead to greater success in gene to structure work as exemplified by the X-ray crystallographic structure determination of FtsZ from Bacillus subtilis. These results validate the Gene Composer algorithms, and suggest that using a combination of synthetic gene and protein construct engineering tools can improve the economics of gene to structure research.

59 BASIC BIOLOGICAL SCIENCES↗

Correlated speckle noise in white-light interferometry: theoretical analysis of measurement uncertainty

The partial coherent illumination of the specimen, which is required for white-light interferometric measurements of optically rough surfaces, directly leads to speckle. The electric field of such speckle patterns strongly fluctuates in amplitude and phase. This spatially correlated noise influences the accuracy of the measuring device. Although a variety of noise sources in white-light interferometry has been studied in recent years, they do not account for spatial correlation and, hence, they cannot be applied to speckle noise. Thus, we derive a new model enabling quantitative predictions for measurement uncertainty caused by speckle. The model reveals that the accuracy can be attributed mainly to the degree of spatial correlation, i.e., the average size of a speckle, and to the coherence length of the light source. The same parameters define the signal-to-noise ratio in the spectral domain. The model helps to design filter functions that are perfectly adapted to the noise characteristics of the respective device, thus improving the accuracy of postprocessing algorithms for envelope detection. The derived expressions are also compared to numerical simulations and experimental data of two different types of interferometers. These results are a first validation of the theoretical considerations of this article.

36 MATERIALS SCIENCE↗

Verification of the Coupled Fluid/Solid Transfer in a CASL Grid-to-Rod-Fretting Simulation: A Technical Brief on the Analysis of Convergence Behavior and Demonstration of Software Tools for Verification

For a CASL grid-to-rod fretting problem, Sandia's Percept software was used in conjunction with the Sierra Mechanics suite to analyze the convergence behavior of the data transfer from a fluid simulation to a solid mechanics simulation. An analytic function, with properties relatively close to numerically computed fluid approximations, was chosen to represent the pressure solution in the fluid domain. The analytic pressure was interpolated on a sequence of grids on the fluid domain, and transferred onto a separate sequence of grids in the solid domain. The error in the resulting pressure in the solid domain was measured with respect to the analytic pressure. The error in pressure approached zero as both the fluid and solids meshes were refined. The convergence of the transfer algorithm was limited by whether the source grid resolution was the same or finer than the target grid resolution. In addition, using a feature coverage analysis, we found gaps in the solid mechanics code verification test suite directly relevant to the prototype CASL GTRF simulations.

99 GENERAL AND MISCELLANEOUS↗

EEG analyses with SOBI.

The motivating vision behind Sandia's MENTOR/PAL LDRD project has been that of systems which use real-time psychophysiological data to support and enhance human performance, both individually and of groups. Relevant and significant psychophysiological data being a necessary prerequisite to such systems, this LDRD has focused on identifying and refining such signals. The project has focused in particular on EEG (electroencephalogram) data as a promising candidate signal because it (potentially) provides a broad window on brain activity with relatively low cost and logistical constraints. We report here on two analyses performed on EEG data collected in this project using the SOBI (Second Order Blind Identification) algorithm to identify two independent sources of brain activity: one in the frontal lobe and one in the occipital. The first study looks at directional influences between the two components, while the second study looks at inferring gender based upon the frontal component.

99 GENERAL AND MISCELLANEOUS↗

PV output variability modeling using satellite imagery.

High frequency irradiance variability measured on the ground is caused by the formation, dissipation, and passage of clouds in the sky. If we can identify and associate different cloud types/patterns from satellite imagery, we may be able to predict irradiance variability in areas lacking sensors. With satellite imagery covering the entire U.S., this allows for more accurate integration planning and power flow modeling over wide areas. Satellite imagery from southern Nevada was analyzed at 15 minute intervals over a year. Methods for image stabilization, cloud detection, and textural classification of clouds were developed and tested. High Performance Computing parallel processing algorithms were also investigated and tested. Artificial Neural Networks using imagery as inputs were trained on ground-based measurements of irradiance to model the variability and were tested to show some promise as a means for predicting irradiance variability.

99 GENERAL AND MISCELLANEOUS↗

Rigorous Computation of Diffusion Coefficients for Expanding Maps

For real analytic expanding interval maps, a novel method is given for rigorously approximating the diffusion coefficient of real analytic observables. As a theoretical algorithm, our approximation scheme is shown to give quadratic exponential convergence to the diffusion coefficient. The method for converting this rapid convergence into explicit high precision rigorous bounds is illustrated in the setting of Lanford’s map x↦2x+(1/2)x(1−x) (mod 1).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum adiabatic computation with a constant gap is not useful in one dimension

We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state. The proof relies on a recently proven area law for such systems, implying the existence of a good matrix product representation of the ground state, combined with an appropriate algorithm to update the matrix product state as the Hamiltonian is changed. This implies that adiabatic evolution with such Hamiltonians is not useful for universal quantum computation. Therefore, adiabatic algorithms which are useful for universal quantum computation either require a spectral gap tending to zero or need to be implemented in more than one dimension (we leave open the question of the computational power of adiabatic simulation with a constant gap in more than one dimension).

99 GENERAL AND MISCELLANEOUS↗

Convergence behavior of a new DSMC algorithm.

The convergence rate of a new direct simulation Monte Carlo (DSMC) method, termed 'sophisticated DSMC', is investigated for one-dimensional Fourier flow. An argon-like hard-sphere gas at 273.15K and 266.644Pa is confined between two parallel, fully accommodating walls 1mm apart that have unequal temperatures. The simulations are performed using a one-dimensional implementation of the sophisticated DSMC algorithm. In harmony with previous work, the primary convergence metric studied is the ratio of the DSMC-calculated thermal conductivity to its corresponding infinite-approximation Chapman-Enskog theoretical value. As discretization errors are reduced, the sophisticated DSMC algorithm is shown to approach the theoretical values to high precision. The convergence behavior of sophisticated DSMC is compared to that of original DSMC. The convergence of the new algorithm in a three-dimensional implementation is also characterized. Implementations using transient adaptive sub-cells and virtual sub-cells are compared. The new algorithm is shown to significantly reduce the computational resources required for a DSMC simulation to achieve a particular level of accuracy, thus improving the efficiency of the method by a factor of 2.

97 MATHEMATICS AND COMPUTING↗

Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation

We present a fast algorithm to compute the partial transformation of a function represented in an adaptive pseudo-spectral multi-wavelet representation to a partial Fourier representation. Such fast transformations are useful in many contexts in physics and engineering, where changes of representation from a piece wise polynomial basis to a Fourier basis. The algorithm is demonstrated for a Gaussian in one and in three dimensions. For 2D, we apply this approach to a Gaussian in a periodic domain. The accuracy and the performance of this method is compared with direct summation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State-of-the-art in hterogeneous computing

Node level heterogeneous architectures have become attractive during the last decade for several reasons: compared to traditional symmetric CPUs, they offer high peak performance and are energy and/or cost efficient. With the increase of fine-grained parallelism in high-performance computing, as well as the introduction of parallelism in workstations, there is an acute need for a good overview and understanding of these architectures. We give an overview of the state-of-the-art in heterogeneous computing, focusing on three commonly found architectures: the Cell Broadband Engine Architecture, graphics processing units (GPUs), and field programmable gate arrays (FPGAs).We present a review of hardware, available software tools, and an overview of state-of-the-art techniques and algorithms. Furthermore, we present a qualitative and quantitative comparison of the architectures, and give our view on the future of heterogeneous computing.

99 GENERAL AND MISCELLANEOUS↗

Computational algebraic geometry for statistical modeling FY09Q2 progress.

This is a progress report on polynomial system solving for statistical modeling. This is a progress report on polynomial system solving for statistical modeling. This quarter we have developed our first model of shock response data and an algorithm for identifying the chamber cone containing a polynomial system in n variables with n+k terms within polynomial time - a significant improvement over previous algorithms, all having exponential worst-case complexity. We have implemented and verified the chamber cone algorithm for n+3 and are working to extend the implementation to handle arbitrary k. Later sections of this report explain chamber cones in more detail; the next section provides an overview of the project and how the current progress fits into it.

99 GENERAL AND MISCELLANEOUS↗

A Novel Local Learning based Approach With Application to Breast Cancer Diagnosis

The purpose of this study is to develop and evaluate a novel local learning-based approach for computer-assisted diagnosis of breast cancer. Our new local learning based algorithm using the linear logistic regression method as its base learner is described. Overall, our algorithm will perform its stochastic searching process until the total allowed computing time is used up by our random walk process in identifying the most suitable population subdivision scheme and their corresponding individual base learners. The proposed local learning-based approach was applied for the prediction of breast cancer given 11 mammographic and clinical findings reported by physicians using the BI-RADS lexicon. Our database consisted of 850 patients with biopsy confirmed diagnosis (290 malignant and 560 benign). We also compared the performance of our method with a collection of publicly available state-of-the-art machine learning methods. Predictive performance for all classifiers was evaluated using 10-fold cross validation and Receiver Operating Characteristics (ROC) analysis. Figure 1 reports the performance of 54 machine learning methods implemented in the machine learning toolkit Weka (version 3.0). We introduced a novel local learning-based classifier and compared it with an extensive list of other classifiers for the problem of breast cancer diagnosis. Our experiments show that the algorithm superior prediction performance outperforming a wide range of other well established machine learning techniques. Our conclusion complements the existing understanding in the machine learning field that local learning may capture complicated, non-linear relationships exhibited by real-world datasets.

59 BASIC BIOLOGICAL SCIENCES↗

An efficient algorithm for solving the phase field crystal model

We present and discuss the development of an unconditionally stable algorithm used to solve the evolution equations of the phase field crystal (PFC) model. This algorithm allows for an arbitrarily large algorithmic time step. As the basis for our analysis of the accuracy of this algorithm, we determine an effective time step in Fourier space. We then compare our calculations with a set of representative numerical results, and demonstrate that this algorithm is an effective approach for the study of the PFC models, yielding a time step effectively 180 times larger than the Euler algorithm for a representative set of material parameters. As the PFC model is just a simple example of a wide class of density functional theories, we expect this method will have wide applicability to modeling systems of considerable interest to the materials modeling communities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Electronic representation of wave equation

The Taylor series method for solving differential equations represents a non-traditional way of a numerical solution. Even though this method is not much preferred in the literature, experimental calculations done at the Department of Intelligent Systems of the Faculty of Information Technology of TU Brno have verified that the accuracy and stability of the Taylor series method exceeds the currently used algorithms for numerically solving differential equations. This paper deals with solution of Telegraph equation using modelling of a series small pieces of the wire. Corresponding differential equations are solved by the Modern Taylor Series Method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved Multiple-Coarsening Methods for Sn Discretizations of the Boltzmann Equation

In a recent series of articles, the author presented a multiple-coarsening multigrid method for solving $S_n$ discretizations of the Boltzmann transport equation. This algorithm is applied to an integral equation for the scalar flux or moments. Although this algorithm is very efficient over parameter regimes that describe realistic neutron/photon transport applications, improved methods that can reduce the computational cost are presented in this paper. These improved methods are derived through a careful examination of the frequencies, particularly the near-nullspace, of the integral equation. In the earlier articles, the near-nullspace components were shown to be smooth in angle in the sense that the angular fluxes generated by these components are smooth in angle. In this paper, we present a spatial description of these near-nullspace components. Using the angular description of the earlier papers together with the spatial description reveals the intrinsic space-angle dependence of the integral equation's frequencies. This space-angle dependence is used to determine the appropriate space-angle grids to represent and efficiently attenuate the near-nullspace error components on. It will be shown that these components can have multiple spatial scales. By using only the appropriate space-angle grids that can represent these spatial scales in the original multiple-coarsening algorithm, an improved algorithm is obtained. Moreover, particularly for anisotropic scattering, recognizing the strong angle dependence of the angular fluxes generated by the high frequencies of the integral equation, another improved multiple-coarsening scheme is derived. Restricting this scheme to the appropriate space-angle grids produces a very efficient method.

99 GENERAL AND MISCELLANEOUS↗