Results 51 to 60 of about 149 (131)
Quantitative asymptotics for polynomial patterns in the primes
Abstract We prove quantitative estimates for averages of the von Mangoldt and Möbius functions along polynomial progressions n+P1(m),…,n+Pk(m)$n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials Pi$P_i$. The error terms obtained save an arbitrary power of logarithm, matching the classical Siegel–Walfisz error term.
Lilian Matthiesen +2 more
wiley +1 more source
Fourier Mass Lower Bounds for Batchelor‐Regime Passive Scalars
ABSTRACT Batchelor predicted that a passive scalar ψν$\psi ^\nu$ with diffusivity ν$\nu$, advected by a smooth fluid velocity, should typically have Fourier mass distributed as |ψ̂ν|2(k)≈|k|−d$|\widehat{\psi }^\nu |^2(k) \approx |k|^{-d}$ for |k|≪ν−1/2$|k| \ll \nu ^{-1/2}$.
William Cooperman, Keefer Rowan
wiley +1 more source
Energy Minimisers with Prescribed Jacobian. [PDF]
Guerra A, Koch L, Lindberg S.
europepmc +1 more source
The study introduces a model‐free data‐driven control strategy combining sliding mode control with a projection recurrent neural network to regulate HIV dynamics. The method eliminates dependence on mathematical models, ensures constrained optimal drug dosing, and robustly drives HIV states to a healthy equilibrium despite uncertainty. ABSTRACT In this
Ashkan Zarghami +2 more
wiley +1 more source
Compatibility of state constraints and dynamics for multiagent control systems. [PDF]
Cavagnari G, Marigonda A, Quincampoix M.
europepmc +1 more source
ABSTRACT In this paper, we assess the performance of adaptive and nested factorized sparse approximate inverses as smoothers in multilevel V‐cycles, when smoothing is performed following the Chebyshev iteration of the fourth kind, for the efficient solution of linear systems arising from a conforming discretization of higher‐order partial differential ...
Pablo Jiménez Recio +1 more
wiley +1 more source
On Rectifiable Measures in Carnot Groups: Existence of Density. [PDF]
Antonelli G, Merlo A.
europepmc +1 more source
Row‐Aware Randomized SVD With Applications
ABSTRACT The randomized singular value decomposition proposed in [28] has certainly become one of the most well‐established randomization‐based algorithms in numerical linear algebra. The key ingredient of the entire procedure is the computation of a subspace which is close to the column space of the target matrix A∈ℝm×n$$ \mathbf{A}\in {\mathbb{R}}^{m\
Davide Palitta, Sascha Portaro
wiley +1 more source
Diversities and the Generalized Circumradius. [PDF]
Bryant D +3 more
europepmc +1 more source
On MAP Estimates and Source Conditions for Drift Identification in SDEs
ABSTRACT We consider the inverse problem of identifying the drift in an stochastic differential equation (SDE) from n$n$ observations of its solution at M+1$M+1$ distinct time points. We derive a corresponding maximum a posteriori (MAP) estimate, we prove differentiability properties as well as a so‐called tangential cone condition for the forward ...
Daniel Tenbrinck +3 more
wiley +1 more source

