Results 71 to 80 of about 2,222 (176)
Zeros of polynomials in derivatives of automorphic L$L$‐functions
Abstract Let Fm$\mathfrak {F}_m$ be the set of all cuspidal automorphic representations of GLm(AQ)$\mathrm{GL}_m(\mathbb {A}_{\mathbb {Q}})$, and let F(s,π)$F(s,\bm {\pi })$ be a polynomial in the derivatives of L$L$‐functions associated with representations π∈⋃m=1∞Fm$\pi \in \bigcup _{m=1}^{\infty } \mathfrak {F}_m$. We establish an asymptotic formula
Anji Dong +2 more
wiley +1 more source
Reproducible Econometric Simulations [PDF]
Reproducibility of economic research has attracted considerable attention in recent years. So far, the discussion has focused on reproducibility of empirical analyses.
Achim Zeileis, Christian Kleiber
core +3 more sources
Schematic diagram of the whale optimization algorithm (WOA)–optimized fuzzy proportional–integral–derivative (PID) controller. The WOA is employed to dynamically tune the scaling factor expressions and fuzzy control parameters (a(e)a(e), a(ec)a(ec), βpβp, βiβi), as well as the initial PID gains (kp0kp0, ki0ki0), based on the error (ee) and its ...
Xiaosong Tian +7 more
wiley +1 more source
Optimal carry save networks [PDF]
A general theory is developed for constructing the asymptotically shallowest networks and the asymptotically smallest networks (with respect to formula size) for the carry save addition of n numbers using any given basic carry save adder as a building ...
Paterson, Michael S. +2 more
core
Self‐Similar Blowup for the Cubic Schrödinger Equation
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
Convergence of linear barycentric rational interpolation for analytic functions [PDF]
Polynomial interpolation to analytic functions can be very accurate, depending on the distribution of the interpolation nodes. However, in equispaced nodes and the like, besides being badly conditioned, these interpolants fail to converge even in exact ...
Guettel, Stefan +3 more
core +2 more sources
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
ABSTRACT We address the problem of recovering highly oscillatory operators, represented as n×n$$ n\times n $$ matrices with a fixed set of observed entries. Given that these matrices can be well compressed by butterfly matrix decomposition of L=𝒪(logn) levels requiring only O(nlogn)$$ O\left(n\log n\right) $$ degrees of freedom, we propose a novel ...
Navjot Singh +3 more
wiley +1 more source
ℓ-generalized prime factors counting functions
To study the number of extra prime factors beyond the first ℓ − 1 occurrences of a prime p in the factorization of an integer n, this paper introduces the ℓ-generalized prime factors counting arithmetic function ΩA,ℓ.
A. Gaber
semanticscholar +1 more source
Asymptotic distribution of the number of monochromatic arithmetic progressions in random colourings of the integers [PDF]
In this thesis we research arithmetic progressions in random colourings of the integers. We ask ourselves how many arithmetic progressions are contained in zero density subsets of the integers?
Rissalah, Abdellah (author)
core

