Displaying 941 – 960 of 1282

Showing per page

Strongly compact algebras.

Miguel Lacruz, Victor Lomonosov, Luis Rodríguez Piazza (2006)

RACSAM

An algebra of bounded linear operators on a Hilbert space is said to be strongly compact if its unit ball is relatively compact in the strong operator topology. A bounded linear operator on a Hilbert space is said to be strongly compact if the algebra generated by the operator and the identity is strongly compact. This notion was introduced by Lomonosov as an approach to the invariant subspace problem for essentially normal operators. First of all, some basic properties of strongly compact algebras...

Strongly proximinal subspaces of finite codimension in C(K)

S. Dutta, Darapaneni Narayana (2007)

Colloquium Mathematicae

We characterize strongly proximinal subspaces of finite codimension in C(K) spaces. We give two applications of our results. First, we show that the metric projection on a strongly proximinal subspace of finite codimension in C(K) is Hausdorff metric continuous. Second, strong proximinality is a transitive relation for finite-codimensional subspaces of C(K).

Structural aspects of truncated archimedean vector lattices: good sequences, simple elements

Richard N. Ball (2021)

Commentationes Mathematicae Universitatis Carolinae

The truncation operation facilitates the articulation and analysis of several aspects of the structure of archimedean vector lattices; we investigate two such aspects in this article. We refer to archimedean vector lattices equipped with a truncation as truncs. In the first part of the article we review the basic definitions, state the (pointed) Yosida representation theorem for truncs, and then prove a representation theorem which subsumes and extends the (pointfree) Madden representation theorem....

Structural Properties of Solutions to Total Variation Regularization Problems

Wolfgang Ring (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In dimension one it is proved that the solution to a total variation-regularized least-squares problem is always a function which is "constant almost everywhere" , provided that the data are in a certain sense outside the range of the operator to be inverted. A similar, but weaker result is derived in dimension two.

Currently displaying 941 – 960 of 1282