Related papers: Note on a Theoretical Justification for Approximat…

This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…

We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…

We will present an estimation of the $H_{k_{0},k_{r}}^{q}f$ $\ $and $% H_{u}^{\lambda \varphi}f$ means as a approximation versions \ of \ the Totik type generalization$(\text{see \cite{11, 12}}) $ \ of the results of \ J. Marcinkiewicz and…

There has been abundant research on the development of Approximate Circuits (ACs) for ASICs. However, previous studies have illustrated that ASIC-based ACs offer asymmetrical gains in FPGA-based accelerators. Therefore, an AC that might be…

We consider the adjacency matrix $A$ of a large random graph and study fluctuations of the function $f_n(z,u)=\frac{1}{n}\sum_{k=1}^n\exp\{-uG_{kk}(z)\}$ with $G(z)=(z-iA)^{-1}$. We prove that the moments of fluctuations normalized by…

We provide a general framework for getting expected linear time constant factor approximations (and in many cases FPTASs) to several well-known problems in Computational Geometry, such as $k$-center clustering and farthest nearest neighbor.…

We show that for every ergodic system $(X,\mu,T_1,\ldots,T_d)$ with commuting transformations, the average \[\frac{1}{N^{d+1}} \sum_{0\leq n_1,\ldots,n_d \leq N-1} \sum_{0\leq n\leq N-1} f_1(T_1^n \prod_{j=1}^d T_j^{n_j}x)f_2(T_2^n…

Given a smooth projective variety $X$ over a number field $k$ and $P\in X(k)$, the first author conjectured that in a precise sense, any sequence that approximates $P$ sufficiently well must lie on a rational curve. We prove this conjecture…

Although machine learning approaches have been widely used in the field of finance, to very successful degrees, these approaches remain bespoke to specific investigations and opaque in terms of explainability, comparability, and…

We consider the unilateral contact problem between an elastic body and a rigid foundation in a description that includes both Tresca and Coulomb friction conditions. For this problem, we present an a posteriori error analysis based on an…

Many applications, such as system identification, classification of time series, direct and inverse problems in partial differential equations, and uncertainty quantification lead to the question of approximation of a non-linear operator…

In this paper, we study the approximate minimization problem of weighted finite automata (WFAs): to compute the best possible approximation of a WFA given a bound on the number of states. By reformulating the problem in terms of Hankel…

To strengthen the effectiveness of approximate reasoning in fuzzy modus ponens (FMP) and fuzzy modus tollens (FMT) problems, three approximate reasoning schemes with aggregation functions are developed and their validity is respectively…

Let $f$ be a band-limited function in $L^2({\mathbb{R}})$. Fix $T >0$ and suppose $f^{\prime}$ exists and is integrable on $[-T, T]$. This paper gives a concrete estimate of the error incurred when approximating $f$ in the root mean square…

We develop an estimation methodology for a factor model for high-dimensional matrix-valued time series, where common stochastic trends and common stationary factors can be present. We study, in particular, the estimation of (row and column)…

We introduce the concept of a soft aura topological space $(X, \tilde{\tau}, \mathfrak{a}_E)$, obtained by equipping a soft topological space $(X, \tilde{\tau}, E)$ with a soft scope function $\mathfrak{a}_E : X \to \tilde{\tau}$ satisfying…

The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound…

Given $n$ independent random variables $X_1, X_2, ..., X_n$ and an integer $C$, we study the fundamental problem of computing the probability that the sum $X=X_1+X_2+...+X_n$ is at most $C$. We assume that each random variable $X_i$ is…

We consider the problem of under and over-approximating the image of general vector-valued functions over bounded sets, and apply the proposed solution to the estimation of reachable sets of uncertain non-linear discrete-time dynamical…

In this paper, we use Abel's summation formula to evaluate several quadratic and cubic sums of the form: \[{F_N}\left( {A,B;x} \right) := \sum\limits_{n = 1}^N {\left( {A - {A_n}} \right)\left( {B - {B_n}} \right){x^n}} ,\;x \in [ - 1,1]\]…