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 523 records · Page 29

Matrix phased array (MPA) imaging technology for resistance spot welds

A three-dimensional MPA probe has been incorporated with a high speed phased array electronic board to visualize nugget images of resistance spot welds. The primary application area of this battery operated portable MPA ultrasonic imaging system is in the automotive industry which a conventional destructive testing process is commonly adopted to check the quality of resistance spot welds in auto bodies. Considering an average of five-thousand spot welds in a medium size passenger vehicle, the amount of time and effort given to popping the welds and measuring nugget size are immeasurable in addition to the millions of dollars' worth of scrap metals recycled per plant per year. This wasteful labor intensive destructive testing process has become less reliable as auto body sheet metal has transitioned from thick and heavy mild steels to thin and light high strength steels. Consequently, the necessity of developing a non-destructive inspection methodology has become inevitable. In this paper, the fundamental aspects of the current 3-D probe design, data acquisition algorithms, and weld nugget imaging process are discussed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Identification of parameters of discrete-continuous models

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-BRB-05: Collision Avoidance Mapping Using Consumer 3D Camera

Purpose: To develop a fast and economical method of scanning a patient’s full body contour for use in collision avoidance mapping without the use of ionizing radiation. Methods: Two consumer level 3D cameras used in electronic gaming were placed in a CT simulator room to scan a phantom patient set up in a high collision probability position. A registration pattern and computer vision algorithms were used to transform the scan into the appropriate coordinate systems. The cameras were then used to scan the surface of a gantry in the treatment vault. Each scan was converted into a polygon mesh for collision testing in a general purpose polygon interference algorithm. All clinically relevant transforms were applied to the gantry and patient support to create a map of all possible collisions. The map was then tested for accuracy by physically testing the collisions with the phantom in the vault. Results: The scanning fidelity of both the gantry and patient was sufficient to produce a collision prediction accuracy of 97.1% with 64620 geometry states tested in 11.5 s. The total scanning time including computation, transformation, and generation was 22.3 seconds. Conclusion: Our results demonstrate an economical system to generate collision avoidance maps. Future work includes testing the speed of the framework in real-time collision avoidance scenarios. Research partially supported by a grant from Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗

Small-angle Coulomb collision model for particle-in-cell simulations

We construct and investigate a set of stochastic differential equations that incorporate the physics of velocity-dependent small-angle Coulomb collisions among the plasma particles in a particle-in-cell simulation. Each particle is scattered stochastically from all the other particles in a simulation cell modeled as one or more Maxwellians. Total energy and momentum are conserved by linear transformation of the velocity increments. In two test simulations the proposed 'particle-moment' collision algorithm performs well with time steps as large as 10% of the relaxation time - far larger than a particle-pairing collision algorithm, in which pairs of particles are scattered from one another, requires to achieve the same accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fast and stable method for rotating spherical harmonic expansions

In this paper, we present a simple and efficient method for rotating a spherical harmonic expansion. This is a well-studied problem, arising in classical scattering theory, quantum mechanics and numerical analysis, usually addressed through the explicit construction of the Wigner rotation matrices. We show that rotation can be carried out easily and stably through 'pseudospectral' projection, without ever constructing the matrix entries themselves. Existing fast algorithms, based on recurrence relations, are subject to a variety of instabilities, limiting the effectiveness of the approach for expansions of high degree.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable parallel methods for monolithic coupling in fluid-structure interaction with application to blood flow modeling

We introduce and study numerically a scalable parallel finite element solver for the simulation of blood flow in compliant arteries. The incompressible Navier-Stokes equations are used to model the fluid and coupled to an incompressible linear elastic model for the blood vessel walls. Our method features an unstructured dynamic mesh capable of modeling complicated geometries, an arbitrary Lagrangian-Eulerian framework that allows for large displacements of the moving fluid domain, monolithic coupling between the fluid and structure equations, and fully implicit time discretization. Simulations based on blood vessel geometries derived from patient-specific clinical data are performed on large supercomputers using scalable Newton-Krylov algorithms preconditioned with an overlapping restricted additive Schwarz method that preconditions the entire fluid-structure system together. The algorithm is shown to be robust and scalable for a variety of physical parameters, scaling to hundreds of processors and millions of unknowns.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New perspectives on superparameterization for geophysical turbulence

This is a research expository paper regarding superparameterization, a class of multi-scale numerical methods designed to cope with the intermittent multi-scale effects of inhomogeneous geophysical turbulence where energy often inverse-cascades from the unresolved scales to the large scales through the effects of waves, jets, vortices, and latent heat release from moist processes. Original as well as sparse space–time superparameterization algorithms are discussed for the important case of moist atmospheric convection including the role of multi-scale asymptotic methods in providing self-consistent constraints on superparameterization algorithms and related deterministic and stochastic multi-cloud parameterizations. Test models for the statistical numerical analysis of superparameterization algorithms are discussed both to elucidate the performance of the basic algorithms and to test their potential role in efficient multi-scale data assimilation. The very recent development of grid-free seamless stochastic superparameterization methods for geophysical turbulence appropriate for “eddy-permitting” mesoscale ocean turbulence is presented here including a general formulation and illustrative applications to two-layer quasigeostrophic turbulence, and another difficult test case involving one-dimensional models of dispersive wave turbulence. This last test case has randomly generated solitons as coherent structures which collapse and radiate wave energy back to the larger scales, resulting in strong direct and inverse turbulent energy cascades.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantitative grating-based x-ray dark-field computed tomography

Grating-based x-ray dark-field computed tomography is a functional method that utilizes the scattering contrast mechanism to explore the inaccessible spatially resolved internal structure of the sample. In this letter, we show that the second moment of the scattering angle distribution can be expressed as the minus logarithm of the visibility degradation of the oscillation curve in grating-based imaging. According to the conclusion of Khelashvili et al. [Phys. Med. Biol. 51, 221 (2006)], the minus logarithm of the visibility ratio fulfills the line integral condition; consequently the scattering information can be reconstructed quantitatively by conventional computed tomography algorithms. Results from a computer simulation and from an actual experiment both validate our deduction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstruction of apparent orthotropic conductivity tensor image using magnetic resonance electrical impedance tomography

Magnetic resonance electrical impedance tomography visualizes current density and/or conductivity distributions inside an electrically conductive object. Injecting currents into the imaging object along at least two different directions, induced magnetic flux density data can be measured using a magnetic resonance imaging scanner. Without rotating the object inside the scanner, we can measure only one component of the magnetic flux density denoted as B{sub z}. Since the biological tissues such as skeletal muscle and brain white matter show strong anisotropic properties, the reconstruction of anisotropic conductivity tensor is indispensable for the accurate observations in the biological systems. In this paper, we propose a direct method to reconstruct an axial apparent orthotropic conductivity tensor by using multiple B{sub z} data subject to multiple injection currents. To investigate the anisotropic conductivity properties, we first recover the internal current density from the measured B{sub z} data. From the recovered internal current density and the curl-free condition of the electric field, we derive an over-determined matrix system for determining the internal absolute orthotropic conductivity tensor. The over-determined matrix system is designed to use a combination of two loops around each pixel. Numerical simulations and phantom experimental results demonstrate that the proposed algorithm stably determines the orthotropic conductivity tensor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerated optimization and automated discovery with covariance matrix adaptation for experimental quantum control

Optimization of quantum systems by closed-loop adaptive pulse shaping offers a rich domain for the development and application of specialized evolutionary algorithms. Derandomized evolution strategies (DESs) are presented here as a robust class of optimizers for experimental quantum control. The combination of stochastic and quasi-local search embodied by these algorithms is especially amenable to the inherent topology of quantum control landscapes. Implementation of DES in the laboratory results in efficiency gains of up to {approx}9 times that of the standard genetic algorithm, and thus is a promising tool for optimization of unstable or fragile systems. The statistical learning upon which these algorithms are predicated also provide the means for obtaining a control problem's Hessian matrix with no additional experimental overhead. The forced optimal covariance adaptive learning (FOCAL) method is introduced to enable retrieval of the Hessian matrix, which can reveal information about the landscape's local structure and dynamic mechanism. Exploitation of such algorithms in quantum control experiments should enhance their efficiency and provide additional fundamental insights.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical methods for high-dimensional probability density function equations

In this paper we address the problem of computing the numerical solution to kinetic partial differential equations involving many phase variables. These types of equations arise naturally in many different areas of mathematical physics, e.g., in particle systems (Liouville and Boltzmann equations), stochastic dynamical systems (Fokker–Planck and Dostupov–Pugachev equations), random wave theory (Malakhov–Saichev equations) and coarse-grained stochastic systems (Mori–Zwanzig equations). We propose three different classes of new algorithms addressing high-dimensionality: The first one is based on separated series expansions resulting in a sequence of low-dimensional problems that can be solved recursively and in parallel by using alternating direction methods. The second class of algorithms relies on truncation of interaction in low-orders that resembles the Bogoliubov–Born–Green–Kirkwood–Yvon (BBGKY) framework of kinetic gas theory and it yields a hierarchy of coupled probability density function equations. The third class of algorithms is based on high-dimensional model representations, e.g., the ANOVA method and probabilistic collocation methods. A common feature of all these approaches is that they are reducible to the problem of computing the solution to high-dimensional equations via a sequence of low-dimensional problems. The effectiveness of the new algorithms is demonstrated in numerical examples involving nonlinear stochastic dynamical systems and partial differential equations, with up to 120 variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A sparse matrix based full-configuration interaction algorithm

We present an algorithm related to the full-configuration interaction (FCI) method that makes complete use of the sparse nature of the coefficient vector representing the many-electron wave function in a determinantal basis. Main achievements of the presented sparse FCI (SFCI) algorithm are (i) development of an iteration procedure that avoids the storage of FCI size vectors; (ii) development of an efficient algorithm to evaluate the effect of the Hamiltonian when both the initial and the product vectors are sparse. As a result of point (i) large disk operations can be skipped which otherwise may be a bottleneck of the procedure. At point (ii) we progress by adopting the implementation of the linear transformation by Olsen et al. [J. Chem Phys. 89, 2185 (1988)] for the sparse case, getting the algorithm applicable to larger systems and faster at the same time. The error of a SFCI calculation depends only on the dropout thresholds for the sparse vectors, and can be tuned by controlling the amount of system memory passed to the procedure. The algorithm permits to perform FCI calculations on single node workstations for systems previously accessible only by supercomputers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural and Fuzzy Adaptive Control of Induction Motor Drives

This paper proposes an adaptive neural network speed control scheme for an induction motor (IM) drive. The proposed scheme consists of an adaptive neural network identifier (ANNI) and an adaptive neural network controller (ANNC). For learning the quoted neural networks, a back propagation algorithm was used to automatically adjust the weights of the ANNI and ANNC in order to minimize the performance functions. Here, the ANNI can quickly estimate the plant parameters and the ANNC is used to provide on-line identification of the command and to produce a control force, such that the motor speed can accurately track the reference command. By combining artificial neural network techniques with fuzzy logic concept, a neural and fuzzy adaptive control scheme is developed. Fuzzy logic was used for the adaptation of the neural controller to improve the robustness of the generated command. The developed method is robust to load torque disturbance and the speed target variations when it ensures precise trajectory tracking with the prescribed dynamics. The algorithm was verified by simulation and the results obtained demonstrate the effectiveness of the IM designed controller.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long range surface plasmon resonance with ultra-high penetration depth for self-referenced sensing and ultra-low detection limit using diverging beam approach

Using an insulator-metal-insulator structure with dielectric having refractive index (RI) larger than the analyte, long range surface plasmon (SP) resonance exhibiting ultra-high penetration depth is demonstrated for sensing applications of large bioentities at wavelengths in the visible range. Based on the diverging beam approach in Kretschmann-Raether configuration, one of the SP resonances is shown to shift in response to changes in the analyte RI while the other is fixed; thus, it can be used as a built in reference. The combination of the high sensitivity, high penetration depth and self-reference using the diverging beam approach in which a dark line is detected of the high sensitivity, high penetration depth, self-reference, and the diverging beam approach in which a dark line is detected using large number of camera pixels with a smart algorithm for sub-pixel resolution, a sensor with ultra-low detection limit is demonstrated suitable for large bioentities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Kohn–Sham exchange-correlation potentials from second-order reduced density matrices

We describe a practical algorithm for constructing the Kohn–Sham exchange-correlation potential corresponding to a given second-order reduced density matrix. Unlike conventional Kohn–Sham inversion methods in which such potentials are extracted from ground-state electron densities, the proposed technique delivers unambiguous results in finite basis sets. The approach can also be used to separate approximately the exchange and correlation potentials for a many-electron system for which the reduced density matrix is known. The algorithm is implemented for configuration-interaction wave functions and its performance is illustrated with numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exactness of the original Grover search algorithm

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum tests for the linearity and permutation invariance of Boolean functions

The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement range of phase retrieval in optical surface and wavefront metrology

Phase retrieval employs very simple data collection hardware and iterative algorithms to determine the phase of an optical field. We have derived limitations on phase retrieval, as applied to optical surface and wavefront metrology, in terms of the speed of beam (i.e., f-number or numerical aperture) and amount of aberration using arguments based on sampling theory and geometrical optics. These limitations suggest methodologies for expanding these ranges by increasing the complexity of the measurement arrangement, the phase-retrieval algorithm, or both. We have simulated one of these methods where a surface is measured at unusual conjugates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗