English
Related papers

Related papers: Problems of approximation theory in abstract linea…

200 papers

This review paper highlights the main aspects of the development of research related to the solution of extreme problems in the theory of approximation in the spaces ${\mathcal S}^p$ and $B{\mathcal S}^p$ of periodic and almost periodic…

Classical Analysis and ODEs · Mathematics 2025-09-30 Anatolii Serdyuk , Andrii Shidlich

Direct and inverse approximation theorems are proved in the Besicovitch-Stepanets spaces $B{\mathcal S}^{p}$ of almost periodic functions in terms of the best approximations of functions and their generalized moduli of smoothness.

Classical Analysis and ODEs · Mathematics 2025-09-30 Anatolii Serdyuk , Andrii Shidlich

In this paper, we shall investigate and analyse a new study on the best simultaneous approximation in the context of linear 2-normed spaces inspired by Elumalai and his coworkers in Elumalai. The basis of this investigation is to extend and…

Functional Analysis · Mathematics 2012-05-16 Mehmet Acikgoz

The theory of abstract convexity, also known as convexity without linearity, is an extension of the classical convex analysis. There are a number of remarkable results, mostly concerning duality, and some numerical methods, however, this…

Optimization and Control · Mathematics 2025-02-20 Reinier Díaz Millán , Nadezda Sukhorukova , Julien Ugon

We study best approximations to compact operators between Banach spaces and Hilbert spaces, from the point of view of Birkhoff-James orthogonality and semi-inner-products. As an application of the present study, some distance formulae are…

Functional Analysis · Mathematics 2021-04-30 Debmalya Sain

We give an abstract approach to approximations with a wide range of regularity classes $X$ in spaces of pseudocontinuable functions $K^p_\vartheta$, where $\vartheta$ is an inner function and $p>0$. More precisely, we demonstrate a general…

Functional Analysis · Mathematics 2021-06-21 Adem Limani , Bartosz Malman

We generalize a classical result by A.Macintyre and W.Rogosinski on best $H^p$--approximation in $L^p$ of rational functions. For each inner function $\theta$ we give a description of $H^p$--badly approximable functions in $\bar \theta…

Complex Variables · Mathematics 2013-09-26 R. V. Bessonov

A common problem in applied mathematics is to find a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In the present paper we study the question of the existence of solutions…

Functional Analysis · Mathematics 2009-05-22 P. L. Combettes , N. N. Reyes

The review presents the development of an approach of constructing approximate solutions to complicated physics problems, starting from asymptotic series, through optimized perturbation theory, to self-similar approximation theory. The…

Statistical Mechanics · Physics 2021-11-02 V. I. Yukalov , E. P. Yukalova

The goal of this PhD thesis is to study a diophantine approximation problem stated by Schmidt in 1967. The problem aim to study the approximation of a subspace of $\mathbb{R}^n$ by rational subspaces, not necessarily of the same dimension,…

Number Theory · Mathematics 2021-06-07 Elio Joseph

This paper studies approximation properties of linear sampling operators in general Banach lattices $X$. We obtain matching direct and inverse approximation estimates, convergence criteria, equivalence results involving special…

Functional Analysis · Mathematics 2026-01-28 Yurii Kolomoitsev

We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…

Computational Complexity · Computer Science 2020-05-05 Gregorio Malajovich , Mike Shub

Two classical results characterizing regularity of a convergence space in terms of continuous extensions of maps on one hand, and in terms of continuity of limits for the continuous convergence on the other, are extended to…

General Topology · Mathematics 2014-10-31 Eva Colebunders , Frédéric Mynard , Will Trott

Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…

General Mathematics · Mathematics 2015-02-24 M. Abo-Elhamayel

We study the computational complexity of (deterministic or randomized) algorithms based on point samples for approximating or integrating functions that can be well approximated by neural networks. Such algorithms (most prominently…

Machine Learning · Computer Science 2021-04-08 Philipp Grohs , Felix Voigtlaender

The area of research called \textquotedblleft Lineability\textquotedblright% \ looks for linear structures inside exotic subsets of vector spaces. In the last decade lineability/spaceability has been investigated in rather general settings;…

Functional Analysis · Mathematics 2018-09-10 Vinícius Fávaro , Daniel Pellegrino , Daniel Tomaz

In this paper we consider $L_p$-approximation, $p \in \{2,\infty\}$, of periodic functions from weighted Korobov spaces. In particular, we discuss tractability properties of such problems, which means that we aim to relate the dependence of…

Numerical Analysis · Mathematics 2022-01-26 Adrian Ebert , Peter Kritzer , Friedrich Pillichshammer

Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…

Number Theory · Mathematics 2024-03-20 Jonathan M. Fraser , Henna Koivusalo , Felipe A. Ramirez

For Banach spaces $X,Y,$ we consider a distance problem in the space of bounded linear operators $\mathcal{L}(X,Y).$ Motivated by a recent paper \cite{RAO21}, we obtain sufficient conditions so that for a compact operator…

Functional Analysis · Mathematics 2022-03-22 Arpita Mal

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

Data Structures and Algorithms · Computer Science 2011-01-04 Amit Deshpande , Kasturi Varadarajan , Madhur Tulsiani , Nisheeth K. Vishnoi
‹ Prev 1 2 3 10 Next ›