Papers
Topics
Authors
Recent
Search
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$.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.