نتایج جستجو برای: newton transformation

تعداد نتایج: 240157  

2001
Luca Lusanna

In a special class of globally hyperbolic, topologically trivial, asymptotically flat at spatial infinity spacetimes selected by the requirement of absence of supertranslations (compatible with Christodoulou-Klainermann spacetimes) it is possible to define the rest-frame instant form of ADM canonical gravity by using Dirac’s strategy of adding ten extra variables at spatial infinity and ten ext...

2007
Avram Sidi Doron S. Lubinsky A. Sidi

In this work, we consider a class of numerical quadrature formulas for the infiniterange integrals R∞ 0 w(x)f(x) dx, where w(x) = xαe−x and w(x) = xEp(x), Ep(x) being the Exponential Integral. These formulas are obtained by applying the Levin L and Sidi S transformations, two effective convergence acceleration methods, to the asymptotic expansions of R∞ 0 w(x)/(z − x) dx as z → ∞, and they turn...

2017
Gradimir V. Milovanović D. Occorsio

An account on computation of integrals of highly oscillatory functions based on the so-called complex integration methods is presented. Beside the basic idea of this approach some applications in computation of Fourier and Bessel transformations are given. Also, Gaussian quadrature formulas with a modified Hermite weight are considered, including some numerical examples.

Journal: :Journal of Approximation Theory 2009
Li-Lian Wang Ben-yu Guo

We derive in this paper the asymptotic estimates of the nodes and weights of the Gauss-Lobatto-Legendre-Birkhoff (GLLB) quadrature formula, and obtain optimal error estimates for the associated GLLB interpolation in Jacobi weighted Sobolev spaces. We also present a useroriented implementation of the pseudospectral methods based on the GLLB quadrature nodes for Neumann problems. This approach al...

2007
G. Cicogna

We present some remarks on the existence and the properties of Lie point symmetries of nite dimensional dynamical systems expressed either in Newton-Lagrange or in Hamilton form. We show that the only Lie symmetries admitted by Newton-Lagrange-type problems are essentially linear symmetries, and construct the most general problem admitting such a symmetry. In the case of Hamilton problems, we d...

Journal: :Physical review 2021

In this work we explore the dynamics of generalized hybrid metric-Palatini theory gravity in weak-field, slow-motion regime. We start by introducing equivalent scalar-tensor representation theory, which contains two scalar degrees freedom, and perform a conformal transformation to Einstein frame. Linear perturbations metric Minkowskian background are then studied for both fields. The effective ...

2005
Shigeru Takano Koichi Niijima

A person identification system based on fast face learning of lifting wavelet filters is proposed. The real power of our system lies in fast learning of lifting wavelet filters adaptive to facial parts such as eyes, nose and lips, in a set of training faces. In our system, free parameters in the lifting filter are learned fast by using Newton’s method. The learned parameters are memorized in a ...

2006
Malin Sjödahl

The effects of the condition that the standard model particles live on a thin brane in the ADD-model is investigated. This is shown to result in a cut-off independent Kaluza–Klein propagator for large distance scattering and an odd number of extra dimensions. The matrix element corresponding to this propagator can also be Fourier transformed to position space, giving back the extra-dimensional ...

2010
M. K. Jain

1. Introduction. The estimation of quadrature errors for analytic functions has been considered by Davis and Rabinowitz [1]. An estimate for the error of the Gaussian quadrature formula for analytic functions was obtained by Davis [2]. McNamee [3] has also discussed the estimation of error of the Gauss-Legendre quadrature for analytic functions. Convergence of the Gaussian quadratures was discu...

Journal: :Cytometry 1993
T C Bakker Schut B G De Grooth J Greve

A cluster analysis algorithm, dedicated to analysis of flow cytometric data is described. The algorithm is written in Pascal and implemented on an MS-DOS personal computer. It uses k-means, initialized with a large number of seed points, followed by a modified nearest neighbor technique to reduce the large number of subclusters. Thus we combine the advantage of the k-means (speed) with that of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید