English
Related papers

Related papers: Very badly approximable matrix functions

200 papers

This is a continuation of our earlier paper \cite{PT3}. We consider here operator-valued functions (or infinite matrix functions) on the unit circle $\T$ and study the problem of approximation by bounded analytic operator functions. We…

Functional Analysis · Mathematics 2007-05-23 V. V. Peller , S. R. Treil

We continue studying the problem of analytic approximation of matrix functions. We introduce the notion of a partial canonical factorization of a badly approximable matrix function $\Phi$ and the notion of a canonical factorization of a…

Functional Analysis · Mathematics 2007-05-23 R. B. Alexeev , V. V. Peller

We consider the problem of approximation of matrix functions of class $L^p$ on the unit circle by matrix functions analytic in the unit disk in the norm of $L^p$, $2\le p<\be$. For an $m\times n$ matrix function $\Phi$ in $L^p$, we consider…

Functional Analysis · Mathematics 2008-05-29 L. Baratchart , F. L. Nazarov , V. V. Peller

We discuss the following extremal problem and its relevance to the sum of the so-called superoptimal singular values of a matrix function: Given an $m\times n$ matrix function $\Phi$ on the unit circle $\mathbb{T}$, when is there a matrix…

Functional Analysis · Mathematics 2009-09-09 Alberto A. Condori

For a rational matrix function $\Phi$ with poles outside the unit circle, we estimate the degree of the unique superoptimal approximation $\A\Phi$ by matrix functions analytic in the unit disk. We obtain sharp estimates in the case of…

Functional Analysis · Mathematics 2007-05-23 V. V. Peller , V. I. Vasyunin

Let $\Phi$ be a continuous $n\times n$ matrix-valued function on the unit circle $\T$ such that the $(k-1)$th singular value of the Hankel operator with symbol $\Phi$ is greater than the $k$th singular value. In this case, it is well-known…

Functional Analysis · Mathematics 2011-05-24 Alberto A. Condori

Recently Koivusalo, Levesley, Ward and Zhang introduced the set of simultaneously $\Phi$-badly approximable real vectors of $\mathbb{R}^m$ with respect to an approximation function $\Phi$, and determined its Hausdorff dimension for the…

Number Theory · Mathematics 2025-03-19 Johannes Schleischitz

A pair $(A,\mathbf{b})$ of a real $m\times n$ matrix $A$ and $\mathbf{b}\in\mathbb{R}^m$ is said to be $\textit{infinitely badly approximable}$ if \[ \liminf_{\mathbf{q}\in\mathbb{Z}^n, \|\mathbf{q}\|\to\infty}…

Number Theory · Mathematics 2025-09-23 Taehyeong Kim

We study the holomorphic Hardy-Orlicz spaces H^\Phi(\Omega), where \Omega is the unit ball or, more generally, a convex domain of finite type or a strictly pseudoconvex domain in Cn . The function \Phi is in particular such that H…

Complex Variables · Mathematics 2009-02-13 Aline Bonami , Sandrine Grellier

We study the question of the existence of a dual extremal function for a bounded matrix function on the unit circle in connection with the problem of approximation by analytic matrix functions. We characterize the class of matrix functions,…

Functional Analysis · Mathematics 2008-01-03 V. V. Peller

In this paper we consider the subnormality of block Toeplitz operators $T_\Phi$, where $\Phi$ is an $n\times n$ matrix-valued function on the unit circle $\mathbb T$ of the form $$ \Phi=Q\Phi^* \quad \hbox{($Q$ is a finite Blaschke--Potapov…

Functional Analysis · Mathematics 2026-05-11 Mankunikuzhiyil Abhinand , Raul E. Curto , In Sung Hwang , Woo Young Lee , Thankarajan Prasad

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-convex if, for all $x,y\in I$, $t\in[0,1]$ it satisfies $$ f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)+t\Phi\big((1-t)|x-y|\big)+(1-t)\Phi\big(t|x-y|\big), $$ where…

Classical Analysis and ODEs · Mathematics 2020-12-23 Angshuman R. Goswami , Zsolt Páles

We study the notion of strongly badly approximable matrices in the field of power series over a field $K$. We prove a transference principle in this setting, and show that such matrices exist when $K$ is infinite.

Number Theory · Mathematics 2013-11-06 Thai Hoang Le , Jeffrey D. Vaaler

We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…

Group Theory · Mathematics 2019-10-31 Alexander Bors

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

Numerical Analysis · Mathematics 2013-04-04 Jan Vybiral

Given a matrix-valued function $\mathcal{F}(\lambda)=\sum_{i=1}^d f_i(\lambda) A_i$, with complex matrices $A_i$ and $f_i(\lambda)$ entire functions for $i=1,\ldots,d$, we discuss a method for the numerical approximation of the distance to…

Numerical Analysis · Mathematics 2025-04-11 Miryam Gnazzo , Nicola Guglielmi

On any metric space, I provide an intrinsic characterization of those complex-valued functions which are uniform limits of Lipschitz functions. There are applications to function theory on complete Riemannian manifolds and, in particular,…

Functional Analysis · Mathematics 2021-05-18 L. A. Coburn

We study uniqueness of best approximation in Orlicz spaces L$\Phi$, for different types of convex functions $\Phi$ and for some finite dimensional approximation classes of functions, where Tchebycheff spaces, and more general approximation…

Functional Analysis · Mathematics 2024-06-17 Ana Benavente , Juan Costa Ponce , Sergio Favier

For an $n\times n$ bounded matrix function $\Phi$ we study unitary interpolants $U$, i.e., unitary-valued functions $U$ such that $\hat U(j)=\hat\Phi(j)$, $j<0$. We are looking for unitary interpolants $U$ for which the Toeplitz operator…

Functional Analysis · Mathematics 2007-05-23 R. B. Alexeev , V. V. Peller

Given a redundant dictionary $\Phi$, represented by an $M \times N$ matrix ($\Phi \in \mathbb{R}^{M \times N}$) and a target signal $y \in \mathbb{R}^M$, the \emph{sparse approximation problem} asks to find an approximate representation of…

Computational Complexity · Computer Science 2011-11-29 Ali Civril
‹ Prev 1 2 3 10 Next ›