974 resultados para Approximate spelling
Resumo:
In cases whazo zotatLon of the seoondazy pztncipal 8tzo,ae axes along tha light path ,exists, it is always poaeible to detezmlna two dizactions along which plane-polazlaad light ,antazlng the model ,amerCe8 as plene-pela~l,aed light fzom the model. Puzth,az the nat zstazdatton Pot any light path is dlff,azant Prom the lntsgtatad zetazd,ation Pat the l£ght path nogZsctlng the ePfsct or z,atation.
Resumo:
The motion of a bore over a sloping beach, earlier considered numerically by Keller, Levine & Whitham (1960), is studied by an approximate analytic technique. This technique is an extension of Whitham's (1958) approach for the propagation of shocks into a non-uniform medium. It gives the entire flow behind the bore and is shown to be equivalent to the theory of modulated simple waves of Varley, Ventakaraman & Cumberbatch (1971).
Resumo:
We derive a very general expression of the survival probability and the first passage time distribution for a particle executing Brownian motion in full phase space with an absorbing boundary condition at a point in the position space, which is valid irrespective of the statistical nature of the dynamics. The expression, together with the Jensen's inequality, naturally leads to a lower bound to the actual survival probability and an approximate first passage time distribution. These are expressed in terms of the position-position, velocity-velocity, and position-velocity variances. Knowledge of these variances enables one to compute a lower bound to the survival probability and consequently the first passage distribution function. As examples, we compute these for a Gaussian Markovian process and, in the case of non-Markovian process, with an exponentially decaying friction kernel and also with a power law friction kernel. Our analysis shows that the survival probability decays exponentially at the long time irrespective of the nature of the dynamics with an exponent equal to the transition state rate constant.
Resumo:
The possibility of applying two approximate methods for determining the salient features of response of undamped non-linear spring mass systems subjected to a step input, is examined. The results obtained on the basis of these approximate methods are compared with the exact results that are available for some particular types of spring characteristics. The extension of the approximate methods for non-linear systems with general polynomial restoring force characteristics is indicated.
Resumo:
Approximate solutions of the B-G-K model equation are obtained for the structure of a plane shock, using various moment methods and a least squares technique. Comparison with available exact solution shows that while none of the methods is uniformly satisfactory, some of them can provide accurate values for the density slope shock thickness delta n . A detailed error analysis provides explanations for this result. An asymptotic analysis of delta n for largeMach numbers shows that it scales with theMaxwell mean free path on the hot side of the shock, and that their ratio is relatively insensitive to the viscosity law for the gas.
An approximate analysis of non-linear non-conservative systems subjected to step function excitation
Resumo:
This paper deals with the approximate analysis of the step response of non-linear nonconservative systems by the application of ultraspherical polynomials. From the differential equations for amplitude and phase, set up by the method of variation of parameters, the approximate solutions are obtained by a generalized averaging technique based on ultraspherical polynomial expansions. The Krylov-Bogoliubov results are given by a particular set of these polynomials. The method has been applied to study the step response of a cubic spring mass system in presence of viscous, material, quadratic, and mixed types of damping. The approximate results are compared with the digital and analogue computer solutions and a close agreement has been found between the analytical and the exact results.
Resumo:
Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms.
Resumo:
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(m log m) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is deduced and simulation results on an AWGN channel using tail-biting trellises for two rate 1/2 convolutional codes with memory 4 and 6 respectively, are reported.
Resumo:
A simple, sufficiently accurate and efficient method for approximate solutions of the Falkner-Skan equation is proposed here for a wide range of the pressure gradient parameter. The proposed approximate solutions are obtained utilising a known solution of another differential equation.
Resumo:
Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].
Resumo:
In this study we present approximate analytical expressions for estimating the variation in multipole expansion coefficients as a function of the size of the apertures in the electrodes in axially symmetric (3D) and two-dimensional (2D) ion trap ion traps. Following the approach adopted in our earlier studies which focused on the role of apertures to fields within the traps, here too, the analytical expression we develop is a sum of two terms, A(n,noAperiure), the multipole expansion coefficient for a trap with no apertures and A(n,dueToAperture), the multipole expansion coefficient contributed by the aperture. A(n,noAperture) has been obtained numerically and A(n,dueToAperture) is obtained from the n th derivative of the potential within the trap. The expressions derived have been tested on two 3D geometries and two 2D geometries. These include the quadrupole ion trap (QIT) and the cylindrical ion trap (CIT) for 3D geometries and the linear ion trap (LIT) and the rectilinear ion trap (RIT) for the 2D geometries. Multipole expansion coefficients A(2) to A(12), estimated by our analytical expressions, were compared with the values obtained numerically (using the boundary element method) for aperture sizes varying up to 50% of the trap dimension. In all the plots presented, it is observed that our analytical expression for the variation of multipole expansion coefficients versus aperture size closely follows the trend of the numerical evaluations for the range of aperture sizes considered. The maximum relative percentage errors, which provide an estimate of the deviation of our values from those obtained numerically for each multipole expansion coefficient, are seen to be largely in the range of 10-15%. The leading multipole expansion coefficient, A(2), however, is seen to be estimated very well by our expressions, with most values being within 1% of the numerically determined values, with larger deviations seen for the QIT and the LIT for large aperture sizes. (C) 2010 Elsevier B.V. All rights reserved.