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 883 records · Page 49

Cover art: Issues in the metric-guided and metric-less placement of random and stochastic template banks

The efficient placement of signal templates in source-parameter space is a crucial requisite for exhaustive matched-filtering searches of modeled gravitational-wave sources, as well as other searches based on more general detection statistics. Unfortunately, the current placement algorithms based on regular parameter-space meshes are difficult to generalize beyond simple signal models with few parameters. Various authors have suggested that a general, flexible, yet efficient alternative can be found in randomized placement strategies such as random placement and stochastic placement, which enhances random placement by selectively rejecting templates that are too close to others. In this article we explore several theoretical and practical issues in randomized placement: the size and performance of the resulting template banks; the very general, purely geometric effects of parameter-space boundaries; the use of quasirandom (self-avoiding) number sequences; most important, the implementation of these algorithms in curved signal manifolds with and without the use of a Riemannian signal metric, which may be difficult to obtain. Specifically, we show how the metric can be replaced with a discrete triangulation-based representation of local geometry. We argue that the broad class of randomized placement algorithms offers a promising answer to many search problems, but that the specific choice of a scheme and its implementation details will still need to be fine-tuned separately for each problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Particle filtering with path sampling and an application to a bimodal ocean current model

This paper introduces a recursive particle filtering algorithm designed to filter high dimensional systems with complicated non-linear and non-Gaussian effects. The method incorporates a parallel marginalization (PMMC) step in conjunction with the hybrid Monte Carlo (HMC) scheme to improve samples generated by standard particle filters. Parallel marginalization is an efficient Markov chain Monte Carlo (MCMC) strategy that uses lower dimensional approximate marginal distributions of the target distribution to accelerate equilibration. As a validation the algorithm is tested on a 2516 dimensional, bimodal, stochastic model motivated by the Kuroshio current that runs along the Japanese coast. The results of this test indicate that the method is an attractive alternative for problems that require the generality of a particle filter but have been inaccessible due to the limitations of standard particle filtering strategies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal block-tridiagonalization of matrices for coherent charge transport

Numerical quantum transport calculations are commonly based on a tight-binding formulation. A wide class of quantum transport algorithms require the tight-binding Hamiltonian to be in the form of a block-tridiagonal matrix. Here, we develop a matrix reordering algorithm based on graph partitioning techniques that yields the optimal block-tridiagonal form for quantum transport. The reordered Hamiltonian can lead to significant performance gains in transport calculations, and allows to apply conventional two-terminal algorithms to arbitrarily complex geometries, including multi-terminal structures. The block-tridiagonalization algorithm can thus be the foundation for a generic quantum transport code, applicable to arbitrary tight-binding systems. We demonstrate the power of this approach by applying the block-tridiagonalization algorithm together with the recursive Green's function algorithm to various examples of mesoscopic transport in two-dimensional electron gases in semiconductors and graphene.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DEDICATED FILTER FOR DEFECTS CLUSTERING IN RADIOGRAPHIC IMAGE

Defect clusters such as linear or clustered porosity are in some cases even more important than single flaws. This paper presents two methods of defect clustering and algorithm for calculation of distances between flaws in digital radiographic image. Dedicated lookup table based filter is used for calculation of distances between objects in the specified range. For defect clustering two functions were developed. First one is based on MMD (Minimum Mean Distance) algorithm. Second one uses hierarchical procedures for clustering defects of various types, shapes and size.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ULTRASONIC IMAGING USING A FLEXIBLE ARRAY: IMPROVEMENTS TO THE MAXIMUM CONTRAST AUTOFOCUS ALGORITHM

In previous work, we have presented the maximum contrast autofocus algorithm for estimating unknown imaging parameters, e.g., for imaging through complicated surfaces using a flexible ultrasonic array. This paper details recent improvements to the algorithm. The algorithm operates by maximizing the image contrast metric with respect to the imaging parameters. For a flexible array, the relative positions of the array elements are parameterized using a cubic spline function and the spline control points are estimated by iterative maximisation of the image contrast via simulated annealing. The resultant spline gives an estimate of the array geometry and the profile of the surface that it has conformed to, allowing the generation of a well-focused image. A pre-processing step is introduced to obtain an initial estimate of the array geometry, reducing the time taken for the algorithm to convergence. Experimental results are demonstrated using a flexible array prototype.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the construction of coherent states of position dependent mass Schroedinger equation endowed with effective potential

In this paper, we propose an algorithm to construct coherent states for an exactly solvable position dependent mass Schroedinger equation. We use point canonical transformation method and obtain ground state eigenfunction of the position dependent mass Schroedinger equation. We fix the ladder operators in the deformed form and obtain explicit expression of the deformed superpotential in terms of mass distribution and its derivative. We also prove that these deformed operators lead to minimum uncertainty relations. Further, we illustrate our algorithm with two examples, in which the coherent states given for the second example are new.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Concept and realization of unmanned aerial system with different modes of operation

In this paper we describe the development process of unmanned aerial system, its mechanical components, electronics and software solutions. During the stage of design, we have formulated some necessary requirements for the multirotor vehicle and ground control station in order to build an optimal system which can be used for the reconnaissance missions. Platform is controlled by use of the ground control station (GCS) and has possibility of accomplishing video based observation tasks. In order to fulfill this requirement the on-board payload consists of mechanically stabilized camera augmented with machine vision algorithms to enable object tracking tasks. Novelty of the system are four modes of flight, which give full functionality of the developed UAV system. Designed ground control station is consisted not only of the application itself, but also a built-in dedicated components located inside the chassis, which together creates an advanced UAV system supporting the control and management of the flight. Mechanical part of quadrotor is designed to ensure its robustness while meeting objectives of minimizing weight of the platform. Finally the designed electronics allows for implementation of control and estimation algorithms without the needs for their excessive computational optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-linear approximation of continuous functions by the Faber-Schauder system

The existence of a function f{sub 0}(x) element of C{sub [0,1]} for which the greedy algorithm in the Faber-Schauder system is divergent in measure on [0,1] is established. It is shown that for each {epsilon}, 0<{epsilon}<1, there exists a measurable subset E of [0,1] of measure |E|>1-{epsilon} such that for each f(x) element of C{sub [0,1]} one can find a function f-tilde(x) element of C{sub [0,1]} coinciding with f(x) on E, whose greedy algorithm in the Faber-Schauder system converges uniformly on [0,1]. Bibliography: 33 titles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PARAMETER ESTIMATION FROM TIME-SERIES DATA WITH CORRELATED ERRORS: A WAVELET-BASED METHOD AND ITS APPLICATION TO TRANSIT LIGHT CURVES

We consider the problem of fitting a parametric model to time-series data that are afflicted by correlated noise. The noise is represented by a sum of two stationary Gaussian processes: one that is uncorrelated in time, and another that has a power spectral density varying as 1/f{sup g}amma. We present an accurate and fast [O(N)] algorithm for parameter estimation based on computing the likelihood in a wavelet basis. The method is illustrated and tested using simulated time-series photometry of exoplanetary transits, with particular attention to estimating the mid-transit time. We compare our method to two other methods that have been used in the literature, the time-averaging method and the residual-permutation method. For noise processes that obey our assumptions, the algorithm presented here gives more accurate results for mid-transit times and truer estimates of their uncertainties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Informational power of quantum measurements

We introduce the informational power of a quantum measurement as the maximum amount of classical information that the measurement can extract from any ensemble of quantum states. We prove the additivity by showing that the informational power corresponds to the classical capacity of a quantum-classical channel. We restate the problem of evaluating the informational power as the maximization of the accessible information of a suitable ensemble. We provide a numerical algorithm to find an optimal ensemble and quantify the informational power.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient simulation of relativistic fermions via vertex models

We have developed an efficient simulation algorithm for strongly interacting relativistic fermions in two-dimensional field theories based on a formulation as a loop gas. It essentially eliminates critical slowing down by sampling two-point correlation functions and allows simulations directly in the massless limit at the critical point. It generates loop configurations with fluctuating topological boundary conditions enabling one to simulate fermions with arbitrary periodic or antiperiodic boundary conditions. As illustrative examples, the algorithm is applied to the Gross-Neveu model and to the Schwinger model in the strong coupling limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

One-loop diagrams in lattice QCD with Wilson fermions

A large number of one-loop integrals emerging in a gauge perturbation theory on a lattice with Wilson fermions at r = 1 are evaluated with the use of the Burgio-Caracciolo-Pelissetto algorithm and the FORMpackage. In the bosonic case, an explicit analytical form of the recursion relations is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Frequency-guided windowed Fourier ridges technique for automatic demodulation of a single closed fringe pattern

A frequency-guided windowed Fourier ridges (FG-WFR) technique for phase extraction from a single closed fringe pattern is proposed. The algorithm begins with a selected seed point and is then guided by the local frequency of the computed pixels. For the seed point, the whole spectral range is examined with WFR to provide reliable local frequency and phase estimation. However, for the rest of the pixels, the WFR algorithm is performed in a more narrow spectral range centered at the determined frequency of its computed neighboring pixel, which not only enforces the continuity of the local frequency between adjacent pixels but also reduces computation consumption significantly. Besides, since phase unwrapping can be readily implemented after demodulation of each pixel, the algorithm directly offers a continuous phase map. The proposed FG-WFR algorithm is verified by successfully demodulating two computer simulated fringe patterns and one noisy experimental fringe pattern.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Autonomous Sub-Pixel Satellite Track Endpoint Determination for Space Based Images

An algorithm for determining satellite track endpoints with sub-pixel resolution in spaced-based images is presented. The algorithm allows for significant curvature in the imaged track due to rotation of the spacecraft capturing the image. The motivation behind the subpixel endpoint determination is first presented, followed by a description of the methodology used. Results from running the algorithm on real ground-based and simulated spaced-based images are shown to highlight its effectiveness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A solution algorithm for the fluid dynamic equations based on a stochastic model for molecular motion

In this paper, a stochastic model is presented to simulate the flow of gases, which are not in thermodynamic equilibrium, like in rarefied or micro situations. For the interaction of a particle with others, statistical moments of the local ensemble have to be evaluated, but unlike in molecular dynamics simulations or DSMC, no collisions between computational particles are considered. In addition, a novel integration technique allows for time steps independent of the stochastic time scale. The stochastic model represents a Fokker-Planck equation in the kinetic description, which can be viewed as an approximation to the Boltzmann equation. This allows for a rigorous investigation of the relation between the new model and classical fluid and kinetic equations. The fluid dynamic equations of Navier-Stokes and Fourier are fully recovered for small relaxation times, while for larger values the new model extents into the kinetic regime. Numerical studies demonstrate that the stochastic model is consistent with Navier-Stokes in that limit, but also that the results become significantly different, if the conditions for equilibrium are invalid. The application to the Knudsen paradox demonstrates the correctness and relevance of this development, and comparisons with existing kinetic equations and standard solution algorithms reveal its advantages. Moreover, results of a test case with geometrically complex boundaries are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence analysis of two-node CMFD method for two-group neutron diffusion eigenvalue problem

In this paper, the nonlinear coarse-mesh finite difference method with two-node local problem (CMFD2N) is proven to be unconditionally stable for neutron diffusion eigenvalue problems. The explicit current correction factor (CCF) is derived based on the two-node analytic nodal method (ANM2N), and a Fourier stability analysis is applied to the linearized algorithm. It is shown that the analytic convergence rate obtained by the Fourier analysis compares very well with the numerically measured convergence rate. It is also shown that the theoretical convergence rate is only governed by the converged second harmonic buckling and the mesh size. It is also noted that the convergence rate of the CCF of the CMFD2N algorithm is dependent on the mesh size, but not on the total problem size. This is contrary to expectation for eigenvalue problem. The novel points of this paper are the analytical derivation of the convergence rate of the CMFD2N algorithm for eigenvalue problem, and the convergence analysis based on the analytic derivations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for computing the 2D structure of fast rotating stars

Stars may be understood as self-gravitating masses of a compressible fluid whose radiative cooling is compensated by nuclear reactions or gravitational contraction. The understanding of their time evolution requires the use of detailed models that account for a complex microphysics including that of opacities, equation of state and nuclear reactions. The present stellar models are essentially one-dimensional, namely spherically symmetric. However, the interpretation of recent data like the surface abundances of elements or the distribution of internal rotation have reached the limits of validity of one-dimensional models because of their very simplified representation of large-scale fluid flows. In this article, we describe the ESTER code, which is the first code able to compute in a consistent way a two-dimensional model of a fast rotating star including its large-scale flows. Compared to classical 1D stellar evolution codes, many numerical innovations have been introduced to deal with this complex problem. First, the spectral discretization based on spherical harmonics and Chebyshev polynomials is used to represent the 2D axisymmetric fields. A nonlinear mapping maps the spheroidal star and allows a smooth spectral representation of the fields. The properties of Picard and Newton iterations for solving the nonlinear partial differential equations of the problem are discussed. It turns out that the Picard scheme is efficient on the computation of the simple polytropic stars, but Newton algorithm is unsurpassed when stellar models include complex microphysics. Finally, we discuss the numerical efficiency of our solver of Newton iterations. This linear solver combines the iterative Conjugate Gradient Squared algorithm together with an LU-factorization serving as a preconditioner of the Jacobian matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 ↗