27 resultados para Linear Approximation Operators

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

Relevância:

90.00% 90.00%

Publicador:

Resumo:

MSC 2010: 54C35, 54C60.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

* The author was supported by NSF Grant No. DMS 9706883.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

For a polish space M and a Banach space E let B1 (M, E) be the space of first Baire class functions from M to E, endowed with the pointwise weak topology. We study the compact subsets of B1 (M, E) and show that the fundamental results proved by Rosenthal, Bourgain, Fremlin, Talagrand and Godefroy, in case E = R, also hold true in the general case. For instance: a subset of B1 (M, E) is compact iff it is sequentially (resp. countably) compact, the convex hull of a compact bounded subset of B1 (M, E) is relatively compact, etc. We also show that our class includes Gulko compact. In the second part of the paper we examine under which conditions a bounded linear operator T : X ∗ → Y so that T |BX ∗ : (BX ∗ , w∗ ) → Y is a Baire-1 function, is a pointwise limit of a sequence (Tn ) of operators with T |BX ∗ : (BX ∗ , w∗ ) → (Y, · ) continuous for all n ∈ N. Our results in this case are connected with classical results of Choquet, Odell and Rosenthal.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

AMS Subject Classification 2010: 41A25, 41A35, 41A40, 41A63, 41A65, 42A38, 42A85, 42B10, 42B20

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 47A48, 93B28, 47A65; Secondary 34C94.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

AMS classification: 41A36, 41A10, 41A25, 41Al7.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

AMS Subject Classification 2010: 41A25, 41A27, 41A35, 41A36, 41A40, 42Al6, 42A85.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-96-1-1003

Relevância:

30.00% 30.00%

Publicador:

Resumo:

* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army Research Office Contract Nr. DAAD 19-02-1-0028, the National Science Foundation grants DMS-0221642 and DMS-0200665, the Deutsche Forschungsgemeinschaft grant SFB 401, the IHP Network “Breaking Complexity” funded by the European Commission and the Alexan- der von Humboldt Foundation.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Two jamming cancellation algorithms are developed based on a stable solution of least squares problem (LSP) provided by regularization. They are based on filtered singular value decomposition (SVD) and modifications of the Greville formula. Both algorithms allow an efficient hardware implementation. Testing results on artificial data modeling difficult real-world situations are also provided.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 26A33 (primary), 35S15 (secondary)

Relevância:

30.00% 30.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35