Search results for "Approx"

The Isgur-Wise function from the lattice

1995

We calculate the Isgur-Wise function by measuring the elastic scattering amplitude of a $D$ meson in the quenched approximation on a $24^3\times48$ lattice at $\beta=6.2$, using an $O(a)$-improved fermion action. Fitting the resulting chirally-extrapolated Isgur-Wise function to Stech's relativistic-oscillator parametrization, we obtain a slope parameter $\rho^2=1.2+7-3. We then use this result, in conjunction with heavy-quark symmetry, to extract $V_{cb}$\ from the experimentally measured $\bar B\to D^*l\bar\nu\,$\ differential decay width. We find $|V_{cb}|\sqrt{\tau_B/1.48{\mathrm ps}}= 0.038 +2-2 +8-3, where the first set of errors is due to experimental uncertainties, while the second …

Yet Another New Variant of Szász–Mirakyan Operator

2021

In this paper, we construct a new variant of the classical Szász–Mirakyan operators, Mn, which fixes the functions 1 and eax,x≥0,a∈R. For these operators, we provide a quantitative Voronovskaya-type result. The uniform weighted convergence of Mn and a direct quantitative estimate are obtained. The symmetry of the properties of the classical Szász–Mirakyan operator and of the properties of the new sequence is investigated. Our results improve and extend similar ones on this topic, established in the last decade by many authors.

Optimal selection of thek best of a sequence withk stops

1997

We first consider the situation in which the decision-maker is allowed to have five choices with purpose to choose exactly the five absolute best candidates fromN applicants. The optimal stopping rule and the maximum probability of making the right five-choice are given for largeN eN, the maximum asymptotic value of the probability of the best choice being limN→∝P (win) ≈ 0.104305. Then, we study the general problem of selecting thek best of a sequence withk stops, constructing first a rough solution for this problem. Using this suboptimal solution, we find an approximation for the optimal probability valuesPk of the form $$P_k \approx \frac{1}{{(e - 1)k + 1}}$$ for any k eN.

Exploiting Numerical Behaviors in SPH.

2010

Smoothed Particle Hydrodynamics is a meshless particle method able to evaluate unknown field functions and relative differential operators. This evaluation is done by performing an integral representation based on a suitable smoothing kernel function which, in the discrete formulation, involves a set of particles scattered in the problem domain. Two fundamental aspects strongly characterizing the development of the method are the smoothing kernel function and the particle distribution. Their choice could lead to the so-called particle inconsistency problem causing a loose of accuracy in the approximation; several corrective strategies can be adopted to overcome this problem. This paper focu…

Approximate solutions for two-level optimization problems

1988

This paper is devoted to general results for approximating two-level optimization problems in which the set of solutions to the lower level problem is not a singleton.

A Note on the Density of Rational Functions in A ∞(Ω)

2018

We present a sufficient condition to ensure the density of the set of rational functions with prescribed poles in the algebra A ∞ (Ω).

An order-adaptive compact approximation Taylor method for systems of conservation laws

2021

Abstract We present a new family of high-order shock-capturing finite difference numerical methods for systems of conservation laws. These methods, called Adaptive Compact Approximation Taylor (ACAT) schemes, use centered ( 2 p + 1 ) -point stencils, where p may take values in { 1 , 2 , … , P } according to a new family of smoothness indicators in the stencils. The methods are based on a combination of a robust first order scheme and the Compact Approximate Taylor (CAT) methods of order 2p-order, p = 1 , 2 , … , P so that they are first order accurate near discontinuities and have order 2p in smooth regions, where ( 2 p + 1 ) is the size of the biggest stencil in which large gradients are n…

Indexed Two-Dimensional String Matching

2016

Speeding up the Consensus Clustering methodology for microarray data analysis

2010

Abstract Background The inference of the number of clusters in a dataset, a fundamental problem in Statistics, Data Analysis and Classification, is usually addressed via internal validation measures. The stated problem is quite difficult, in particular for microarrays, since the inferred prediction must be sensible enough to capture the inherent biological structure in a dataset, e.g., functionally related genes. Despite the rich literature present in that area, the identification of an internal validation measure that is both fast and precise has proved to be elusive. In order to partially fill this gap, we propose a speed-up of Consensus (Consensus Clustering), a methodology whose purpose…

A fast BEM for the analysis of plates with bonded piezoelectric patches

2010

In this paper a fast boundary element method for the elastodynamic analysis of 3D structures with bonded piezoelectric patches is presented. The elastodynamic analysis is performed in the Laplace domain and the time history of the relevant quantities is obtained by inverse Laplace transform. The bonded patches are modelled using a semi-analytical state-space variational approach. The computational features of the technique, in terms of required storage memory and solution time, are improved by a fast solver based on the use of hierarchical matrices. The presented numerical results show the potential of the technique in the study of structural health monitoring (SHM) systems.