2000 character limit reached
On the best coapproximation problem in $\ell_1^n$
Published 29 Jul 2024 in math.FA | (2407.20102v1)
Abstract: We study the best coapproximation problem in the Banach space $ \ell_1n, $ by using Birkhoff-James orthogonality techniques. Given a subspace $\mathbb{{Y}}$ of $\ell_1n$, we completely identify the elements $x$ in $\ell_1n,$ for which best coapproximations to $x$ out of $\mathbb{{Y}}$ exist. The methods developed in this article are computationally effective and it allows us to present an algorithmic approach to the concerned problem. We also identify the coproximinal subspaces and co-Chebyshev subspaces of $\ell_1n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.