Related papers: Characterization of approximation schemes satisfyi…
Random events in space and time often exhibit a locally dependent structure. When the events are very rare and dependent structure is not too complicated, various studies in the literature have shown that Poisson and compound Poisson…
System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model-based testing an approach combining random testing and…
The structure of the gaussian auxiliary field approximation in the theory of phase ordering kinetics is analysed with the aim of placing the method within the context of a systematic theory. While we are unable to do this for systems with a…
We prove the first, even super-polynomial, lower bounds on the size of tropical (min,+) and (max,+) circuits approximating given optimization problems. Many classical dynamic programming (DP) algorithms for optimization problems are pure in…
In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
In this paper, we develop an enhanced version of the catching-up algorithm for sweeping processes through an appropriate concept of approximate projections. We establish some properties of this notion of approximate projection. Then, under…
Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be…
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. In this…
The review presents a parameter switching algorithm and his applications which allows numerical approximation of any attractor of a class of continuous-time dynamical systems depending linearly on a real parameter. The considered classes of…
A general method for estimating the approximation numbers of composition operators on $\Ht$, using finite-dimensional model subspaces, is studied and applied in the case when the symbol of the operator maps the unit disc to a domain whose…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
Low rank approximation of matrices has been well studied in literature. Singular value decomposition, QR decomposition with column pivoting, rank revealing QR factorization (RRQR), Interpolative decomposition etc are classical deterministic…
The purpose of this paper is to study the approximation of vector valued mappings defined on a subset of a normed space. We investigate Korovkin-type conditions under which a given sequence of linear operators becomes a so-called…
We propose a framework for model-theoretic stability and simplicity in an approximate first-order setting and generalize some classical results.
We extend some basic results known for finite range operators to long range operators with off-diagonal decay. Namely, we prove an analogy of Sch'nol's theorem. We also establish the connection between the almost sure spectrum of long range…
The Schur-Horn theorem is a classical result in matrix analysis which characterizes the existence of positive semidefinite matrices with a given diagonal and spectrum. In recent years, this theorem has been used to characterize the…
We combine the method of exchangeable pairs with Stein's method for functional approximation. As a result, we give a general linearity condition under which an abstract Gaussian approximation theorem for stochastic processes holds. We apply…
The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for…
L\"uscher's local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation.…