Svetlana Selivanova

dblp:48/6760 · also Svetlana V. Selivanova · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
5since 2021 · last 2026
0000-0002-8180-0311ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 4 first-author · 5 since 2021
YearPublicationVenuePosition
2026 What is a Polynomial-Time Computable Square-Integrable Function?
Aras Bacho, Svetlana Selivanova, Martin Ziegler 0001
CiE2
2023 Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler 0001
J. Complex.3
2022 Computational Complexity of Classical Solutions of Partial Differential Equations
Svetlana Selivanova
CiE1
2021 Primitive Recursive Ordered Fields and Some Applications
Victor L. Selivanov, Svetlana Selivanova
CASC2
2021 Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations
Svetlana Selivanova, Florian Steinberg 0001, Holger Thies, Martin Ziegler 0001
CASC1
2018 Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract)
Svetlana Selivanova, Victor L. Selivanov
CiE1
2017 Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
abstract
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. Comment: 31 pages
Svetlana Selivanova, Victor L. Selivanov
Log. Methods Comput. Sci.1