Related papers: Algebraic approximation of analytic sets and mappi…

Let F be a holomorphic map whose components satisfy some polynomial relations. We present an algorithm for constructing Nash maps locally approximating F, whose components satisfy the same relations.

Let X be an analytic set defined by polynomials whose coefficients a_1,...,a_s are holomorphic functions. We formulate conditions such that for all sequences {a_(1,n)},...,{a_(s,n)} of holomorphic functions converging locally uniformly to…

A method of local approximation of holomorphic solutions of algebraic equations is discussed

We prove that every complex analytic set X in a Runge domain D can be approximated by Nash sets on relatively compact subdomains of D. We give a necessary and sufficient condition for a complex analytic set X to admit a Nash approximation…

Let $X$ be an analytic subset of $U\times C^n$ of pure dimension $k$ such that the projection of $X$ onto $U$ is a proper mapping, where $U$ is a Runge domain in $C^k$. We show that $X$ can be approximated by algebraic sets.

We present a geometric proof of the theorem saying that holomorphic maps from Runge domains to affine algebraic varieties admit approximation by Nash maps. Next we generalize this theorem.

Let X be a complex nonsingular affine algebraic variety, K a holomorphically convex subset of X, and Y a homogeneous variety for some complex linear algebraic group. We prove that a holomorphic map f:K-->Y can be uniformly approximated on K…

It is shown that every holomorphic map $f$ from a Runge domain $\Omega$ of an affine algebraic variety $S$ into a projective algebraic manifold $X$ is a uniform limit of Nash algebraic maps $f_\nu$ defined over an exhausting sequence of…

An approximation scheme is a family of homogeneous subsets $(A_n)$ of a quasi-Banach space $X$, such that $A_1 \subsetneq A_2 \subsetneq ... \subsetneq X$, $A_n + A_n \subset A_{K(n)}$, and $\bar{\cup_n A_n} = X$. Continuing the line of…

We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…

Let $X$ be a Banach holomorphic function space on the unit disk. A linear polynomial approximation scheme for $X$ is a sequence of bounded linear operators $T_n:X\to X$ with the property that, for each $f\in X$, the functions $T_n(f)$ are…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…

We prove that each semialgebraic subset of $\R^n$ of positive codimension can be locally approximated of any order by means of an algebraic set of the same dimension. As a consequence of previous results, algebraic approximation preserving…

Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…

In a recent paper, a distributed algorithm was proposed for solving linear algebraic equations of the form $Ax = b$ assuming that the equation has at least one solution. The equation is presumed to be solved by $m$ agents assuming that each…

Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical…

We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…

Necessary and sufficient quantitative geometric conditions are given for an unbounded set A in a euclidean space R^n to have the following property with a given c > 0: For every s > 0 and for every s-nearisometry f: A -> R^n there is an…