Results 61 to 70 of about 13,863,967 (339)
Convergence rates for the numerical approximation of the 2D stochastic Navier–Stokes equations
Numerische Mathematik, 2019 We study stochastic Navier–Stokes equations in two dimensions with respect to periodic boundary conditions. The equations are perturbed by a nonlinear multiplicative stochastic forcing with linear growth (in the velocity) driven by a cylindrical Wiener ...
D. Breit, Alan Dodgson
semanticscholar +1 more source
Convergence of Password Guessing to Optimal Success Rates
Entropy, 2020 Password guessing is one of the most common methods an attacker will use forcompromising end users. We often hear that passwords belonging to website users have beenleaked and revealed to the public.
Hazel Murray, David Malone
doaj +1 more source
Convergence Rates for Distributed Stochastic Optimization Over Random Networks [PDF]
IEEE Conference on Decision and Control, 2018 We establish the $O(\frac{1}{k})$ convergence rate for distributed stochastic gradient methods that operate over strongly convex costs and random networks. The considered class of methods is standard - each node performs a weighted average of its own and
D. Jakovetić +3 more
semanticscholar +1 more source
Complexity L0-Penalized M-Estimation: Consistency in More Dimensions
Axioms, 2013 We study the asymptotics in L2 for complexity penalized least squares regression for the discrete approximation of finite-dimensional signals on continuous domains—e.g., images—by piecewise smooth functions.
Gerhard Winkler +3 more
doaj +1 more source
Convergence Rates for Deterministic and Stochastic Subgradient Methods Without Lipschitz Continuity [PDF]
SIAM Journal on Optimization, 2017 We generalize the classic convergence rate theory for subgradient methods to apply to non-Lipschitz functions via a new measure of steepness. For the deterministic projected subgradient method, we derive a global $O(1/\sqrt{T})$ convergence rate for any ...
Benjamin Grimmer
semanticscholar +1 more source
Rate of convergence of Lawson’s algorithm [PDF]
Mathematics of Computation, 1972 The algorithm of Charles L. Lawson determines uniform approximations of functions as limits of weighted L 2
openaire +2 more sources
Mathematics, 2019 In this paper, we consider the initial value problem for the linearized compressible Navier–Stokes–Korteweg system. Asymptotic profiles and convergence rates are established by Fourier splitting frequency technique.
Yinxia Wang
doaj +1 more source
European and global financial integration: some panel evidence of the convergence of interest rates [PDF]
Banks and Bank Systems, 2016 This paper seeks to contribute to the literature on financial integration using panel estimates to test beta- and sigma-convergence across the European Union countries’ interest rates and towards two specific benchmarks — the German and US rates ...
Cândida Ferreira
doaj +1 more source
On the Rate of Convergence of Fictitious Play
Theory of Computing Systems, 2010 The article puts forward three theorems (with their proofs) concerning the convergence rate of almost all the classes of games where fictitious play is known to converge. All the three observations demonstrate that the size of the game requires in some situations exponentially many rounds until an equilibrium action is eventually played.
Felix Brandt +2 more
openaire +3 more sources
On the convergence rates of energy-stable finite-difference schemes
Journal of Computational Physics, 2019 We consider constant-coefficient initial-boundary value problems, with a first or second derivative in time and a highest spatial derivative of order q, and their semi-discrete finite difference approximations.
M. Svärd, J. Nordström
semanticscholar +1 more source