This work deals with the decomposition of a signal into a collection of intrinsic mode functions. More specifically, we aim to revisit Empirical Mode Decomposition (EMD) based on a sifting process step, which highly depends on the choice of an interpolation method, the number of inner iterations, and that does not have any convergence guarantees. The proposed alternative to the sifting process ...

Hierarchical equations of motion theory for Drude dissipation is optimized, with a convenient convergence criterion proposed in advance of numerical propagations. The theoretical construction is on the basis of a Padé spectrum decomposition that has been qualified to be the best sum-over-poles scheme for quantum distribution function. The resulting hierarchical dynamics under the a priori conve...

We propose a simple framework for estimating derivatives without fitting the regression function in nonparametric regression. Unlike most existing methods that use the symmetric difference quotients, our method is constructed as a linear combination of observations. It is hence very flexible and applicable to both interior and boundary points, including most existing methods as special cases of...

Analysis of real life problems often results in linear systems of equations for which solutions are sought. The method to employ depends, to some extent, on the properties of the coefficient matrix. It is not always feasible to solve linear systems of equations by direct methods, as such the need to use an iterative method becomes imperative. Before an iterative method can be employed to solve ...

Recently, Girardi gave a characterization of relative strong L 1 R-compactness in terms of relative weak L 1 R-compactness and the Bocce criterion 18]. Here this result is generalized and extended by presenting a less stringent oscillation restriction condition (ORC) which enforces the transcendence of weak into an appropiately reformulated form of strong convergence in L 1 E , for E a separabl...

Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc-identification). His machine, on the successive graph points of f , outputs a corresponding infinite sequence of programs p0, p1, p2, . . ., and, for some i, the programs pi, pi+1, pi+2, . . . each compute a variant of f which differs from f at only finitel...

This paper evaluates the Pugh Controlled Convergence method and its relationship to recent developments in design theory. Computer executable models are proposed simulating a team of people involved in iterated cycles of evaluation, ideation, and investigation. The models suggest that: (1) convergence of the set of design concepts is facilitated by the selection of a strong datum concept; (2) i...

In this paper, we focus on different convergence results of the long-term return 1 t rudu 0 t ∫ , where the short interest rate r follows an extension of the Cox, Ingersoll and Ross1 model. Using the theory of Bessel processes, we proved the convergence almost everywhere of 1 t Xudu 0 t ∫ , where Xu ( )u≥0 denotes a generalisation of a Besselsquare process with drift. We also studied the conver...

A hierarchical finite difference method to match analogous contours is presented. Our approach has been inspired by the method due to Duncan, who proposed a scheme for matching two contours based on the minimization of a quadratic fitting criterion. This criterion consists of a curvature dependent bending energy term and a smoothness term. Cohen improved this method by ensuring that the resulti...

Near-field radiative transfer between two objects can be computed using Rytov's theory of fluctuational electrodynamics in which the strength of electromagnetic sources is related to temperature through the fluctuation-dissipation theorem, and the resultant energy transfer is described using the dyadic Green's function of the vector Helmholtz equation. When the two objects are spheres, the dyad...