Related papers: Parameter estimation of monomial-exponential sums
We introduce a new method for Estimation of Signal Parameters based on Iterative Rational Approximation (ESPIRA) for sparse exponential sums. Our algorithm uses the AAA algorithm for rational approximation of the discrete Fourier transform…
A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…
The matrix exponential spatial models exhibit similarities to the conventional spatial autoregressive model in spatial econometrics but offer analytical, computational, and interpretive advantages. This paper provides a comprehensive review…
A symbolic method is used to establish some properties of the Bernoulli-Barnes polynomials.
We develop an algorithm for sampling from the unitary invariant random matrix ensembles. The algorithm is based on the representation of their eigenvalues as a determinantal point process whose kernel is given in terms of orthogonal…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
This paper proposes a new semi-parametric identification and estimation approach to multinomial choice models in a panel data setting with individual fixed effects. Our approach is based on cyclic monotonicity, which is a defining feature…
We give an estimate of exponential sums over singular binary quintic forms in a characteristic-free form, based on the Waring decomposition of binary forms. This extends the method on our preceding result on the space of binary quartics to…
We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…
The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…
In his paper, W. M. Schmidt obtained an exponential sum estimate for systems of polynomials not including linear polynomials, which was then used to apply the Hardy-Littlewood circle method. We prove an analogous estimate for systems…
In this note, we presented a new decomposition of elements of finite fields of even order and illustrated that it is an effective tool in evaluation of some specific exponential sums over finite fields, the explicit value of some…
A parameter estimation problem is considered for a stochastic parabolic equation with multiplicative noise under the assumption that the equation can be reduced to an infinite system of uncoupled diffusion processes. From the point of view…
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…
In this work, we consider symmetric positive definite pencils depending on two parameters. That is, we are concerned with the generalized eigenvalue problem $A(x)-\lambda B(x)$, where $A$ and $B$ are symmetric matrix valued functions in…
Prony's method is a standard tool exploited for solving many imaging and data analysis problems that result in parameter identification in sparse exponential sums $$f(k)=\sum_{j=1}^{T}c_{j}e^{-2\pi i\langle t_{j},k\rangle},\quad k\in…
In this paper, we have developed a new class of sampling schemes for estimating parameters of binomial and Poisson distributions. Without any information of the unknown parameters, our sampling schemes rigorously guarantee prescribed levels…
We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…
A general method to express in terms of Gauss sums the number of rational points of subschemes of projective schemes over finite fields is applied to the image of the triple embedding $\mathbb{P}^1\hookrightarrow\mathbb{P}^3$. As a…