Searcharxiv⌕ Search

arXiv subjects

Svetlana Selivanova

Publications and source records attributed to Svetlana Selivanova.

8 recordsLinked to original sources

Primitive Recursive Ordered Fields and Some Applications

We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals, and then apply them to proving primitive recursiveness of some natural problems in linear algebra and analysis. In particular, we find a partial primitive recursive analogue of Ershov-Madison's theorem about real closures of computable ordered fields, relate the corresponding fields to the primitive recursive reals, give sufficient conditions for primitive recursive root-finding, computing normal forms of matrices, and computing solution operators of some linear systems of PDE.

cs.CC↗

Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational complexity -- already regarding real numbers, not to mention more advanced (e.g. Sobolev) spaces. For a general theory of computational complexity over continuous data we introduce and justify QUANTITATIVE admissibility as requirement for sensible encodings of arbitrary compact metric spaces, a refinement of qualitative 'admissibility' due to [Kreitz&Weihrauch'85]: An admissible representation of a T0 space $X$ is a (i) continuous partial surjective mapping from the Cantor space of infinite binary sequences which is (ii) maximal w.r.t. continuous reduction. By the Kreitz-Weihrauch (aka "Main") Theorem of computability over continuous data, for fixed spaces $X,Y$ equipped with admissible representations, a function $f:X\to Y$ is continuous iff it admits continuous a code-translating mapping on Cantor space, a so-called REALIZER. We define a QUANTITATIVELY admissible representation of a compact metric space $X$ to have (i) asymptotically optimal modulus of continuity, namely close to the entropy of $X$, and (ii) be maximal w.r.t. reduction having optimal modulus of continuity in a similar sense. Careful constructions show the category of such representations to be Cartesian closed, and non-empty: every compact $X$ admits a linearly-admissible representation. Moreover such representations give rise to a tight quantitative correspondence between the modulus of continuity of a function $f:X\to Y$ on the one hand and on the other hand that of its realizer: the MAIN THEOREM of computational complexity. This suggests (how) to take into account the entropies of the spaces under consideration when measuring algorithmic cost over continuous data.

cs.LO↗

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs

We discuss possibilities of application of Numerical Analysis methods to proving computability, in the sense of the TTE approach, of solution operators of boundary-value problems for systems of PDEs. We prove computability of the solution operator for a symmetric hyperbolic system with computable real coefficients and dissipative boundary conditions, and of the Cauchy problem for the same system (we also prove computable dependence on the coefficients) in a cube $Q\subseteq\mathbb R^m$. Such systems describe a wide variety of physical processes (e.g. elasticity, acoustics, Maxwell equations). Moreover, many boundary-value problems for the wave equation also can be reduced to this case, thus we partially answer a question raised in Weihrauch and Zhong (2002). Compared with most of other existing methods of proving computability for PDEs, this method does not require existence of explicit solution formulas and is thus applicable to a broader class of (systems of) equations.

math.NA↗

Metric geometry of nonregular weighted Carnot-Carathéodory spaces

We investigate local and metric geometry of weighted Carnot-Carathéodory spaces which are a wide generalization of sub-Riemannian manifolds and arise in nonlinear control theory, subelliptic equations etc. For such spaces the intrinsic Carnot-Carathéodory metric might not exist, and some other new effects take place. We describe the local algebraic structure of such a space, endowed with a certain quasimetric (first introduced by A. Nagel, E.M. Stein and S. Wainger), and compare local geometries of the initial C-C space and its tangent cone at some fixed (possibly nonregular) point. The main results of the present paper are new even for the case of sub-Riemannian manifolds. Moreover, they yield new proofs of such classical results as the Local approximation theorem and the Tangent cone theorem, proved for Hörmander vector fields by M. Gromov, A.Bellaiche, J.Mitchell etc.

math.MG↗

Algebraic and analytic properties of quasimetric spaces with dilations

We provide an axiomatic approach to the theory of local tangent cones of regular sub-Riemannian manifolds and the differentiability of mappings between such spaces. This axiomatic approach relies on a notion of a dilation structure which is introduced in the general framework of quasimetric spaces. Considering quasimetrics allows us to cover a general case including, in particular, minimal smoothness assumptions on the vector fields defining the sub-Riemannian structure. It is important to note that the theory existing for metric spaces can not be directly extended to quasimetric spaces.

math.MG↗