Results 271 to 280 of about 1,035,375 (308)
Some of the next articles are maybe not open access.
Asymptotic convergence of degree‐raising
Advances in Computational Mathematics, 2000Let \(g\) be a polynomial of degree \(n\) and let \(A_n(g)\) be the polynomial of degree \(\leq n\) interpolating the degree \(n\) control points of \(g\) determined by the Bernstein-Bézier coefficients of \(g\). In this paper the authors study some results associated with \(A_n(g)\).
Michael S. Floater, Tom Lyche
openaire +3 more sources
On the Convergence Rate in Precise Asymptotics
Theory of Probability & Its Applications, 2023We study some aspects of estimation of the convergence rate in the so-called “exact asymptotics.” In particular, we obtain asymptotic expansions in powers of $\varepsilon$ of sums of the form $\sum_{n\ge 1} n^s\,\mathbf P(\xi_{\alpha}> \varepsilon n^{\delta})$, where a random variable $\xi_{\alpha}$ has a stable distribution with an exponent $\alpha\
openaire +1 more source
Asymptotic expansions by Γ-convergence
Continuum Mechanics and Thermodynamics, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braides A., Truskinovsky L.
openaire +2 more sources
Convergence of Univariate Non-Stationary Subdivision Schemes via Asymptotic Similarity
A new equivalence notion between non-stationary subdivision schemes, termed asymptotic similarity, which is weaker than asymptotic equivalence, is introduced and studied. It is known that asymptotic equivalence between a non-stationary subdivision scheme
Costanza Conti, Carla Manni, N Dyn
exaly +2 more sources
Asymptotic development by ?-convergence
Applied Mathematics & Optimization, 1993A description of the asymptotic development of a family of minimum problems is proposed by a suitable iteration of Γ-limit procedures. An example of asymptotic development for a family of functionals related to phase transformations is also given.
Gabriele Anzellotti, Sisto Baldo
openaire +1 more source
Asymptotic Convergence of an SMO Algorithm Without Any Assumptions
The asymptotic convergence in Lin [6] can be applied to a modified SMO algorithm by Keerthi et al. [5] with some assumptions.
Chih-Jen Lin
exaly +1 more source
Well-Tempered Metadynamics Converges Asymptotically
Physical Review Letters, 2014Metadynamics is a versatile and capable enhanced sampling method for the computational study of soft matter materials and biomolecular systems. However, over a decade of application and several attempts to give this adaptive umbrella sampling method a firm theoretical grounding prove that a rigorous convergence analysis is elusive.
James F. Dama +2 more
openaire +3 more sources
Asymptotic convergence results
1987Essential to the convergence proof for the homogeneous algorithm is the fact that, under certain conditions, the stationary distribution of a homogeneous Markov chain exists. The stationary distribution is defined as the vector q whose i-th component is given by [FELL50] $${q_i} = \mathop {\lim }\limits_{k \to \infty } \Pr \{ X(k) = i|X(0) = j\} ,$$
Peter J. M. van Laarhoven +1 more
openaire +1 more source
Asymptotic convergence of the ensemble Kalman filter
2008 15th IEEE International Conference on Image Processing, 2008This paper formally addresses the asymptotic convergence of the ensemble Kalman filter (EnKF), a state estimation procedure that, when combined with a technique called localization, provides computationally tractable solutions to large-dimensional state estimation problems.
Mark D. Butala +4 more
openaire +1 more source
IDeC — Convergence independent of error asymptotics
BIT, 1987The method of iterated defect correction [cf. \textit{R. Frank}, Numer. Math. 25, 409-419 (1976; Zbl 0346.65034) and ibid. 27, 407-420 (1977; Zbl 0366.65034)] is applied to the boundary value problem \(y''(t)=f(t,y(t))\) \(t\in (0,1)\), \(y(0)=A\), \(y(1)=B\), where \(\partial /\partial yf(t,y)\geq 0\), and analyzed for efficient and highly accurate ...
Auzinger, W., Monnet, J. P.
openaire +2 more sources

