Zobrazeno 1 - 10
of 22
pro vyhledávání: '"A B, Shekhtman"'
Autor:
B. L. Chalmers, B. Shekhtman
Publikováno v:
Proceedings of the American Mathematical Society. 129:719-724
Let T = ∑n i=1 ũi⊗ vi : V → V = [v1, ..., vn] ⊂ X, where ũi ∈ V ∗ and X is a Banach space. Let T = ∑n i=1 ui ⊗ vi : X → V be an extension of T to all of X (i.e., ui ∈ X∗) such that T has minimal (operator) norm. In this paper
Autor:
Bruce L. Chalmers, B. Shekhtman
Publikováno v:
Abstract and Applied Analysis. 3:237-246
It is well known that the identity is an operator with the following property: if the operator, initially defined on ann-dimensional Banach spaceV, can be extended to any Banach space with norm1, thenVis isometric toℓ∞(n). We show that the set of
Autor:
B. L. Chalmers, B. Shekhtman
Publikováno v:
Abstract and Applied Analysis, Vol 3, Iss 3-4, Pp 237-246 (1998)
It is well known that the identity is an operator with the following property: if the operator, initially defined on an n-dimensional Banach space V, can be extended to any Banach space with norm 1, then V is isometric to ℓ∞(n
Autor:
Edward B. Saff, B. Shekhtman
Publikováno v:
Indagationes Mathematicae. 1(4):489-498
Let ƒbe a continuous function and sn be the polynomial of degree at most n of best L2(μ)-approximation to ƒon [-1,1]. Let Zn(ƒ):=\s{xϵ[-1,1]:ƒ(x)−sn(x) = 0\s}. Under mild conditions on the measure μ, we prove that ∪ Zn(ƒ) is dense in [-1,
Autor:
B. L. Chalmers, B. Shekhtman
Publikováno v:
Abstract and Applied Analysis, Vol 3, Iss 3-4, Pp 237-246 (1998)
It is well known that the identity is an operator with the following property: if the operator, initially defined on an n-dimensional Banach space V, can be extended to any Banach space with norm 1, then V is isometric to ℓ∞(n). We show that the
Autor:
B. Shekhtman, Bruce L. Chalmers
Publikováno v:
Approximation, Probability, and Related Fields ISBN: 9781461360636
Given a family of finite-dimensional subspaces V n in C[0,1], it is important to develop an algorithm that to a given function f ∈ C[0,1] assigns an approximation P n f ∈ V n . This algorithm should be “ simple ” and “ good ”. That transl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44ecf2c0bbd19a5ae149f93c107ba3fc
https://doi.org/10.1007/978-1-4615-2494-6_10
https://doi.org/10.1007/978-1-4615-2494-6_10
Autor:
B. L. Chalmers, B. Shekhtman
Publikováno v:
Proceedings of the American Mathematical Society; Mar2001, Vol. 129 Issue 3, p719-724, 6p
Publikováno v:
Metallurgist. 23:373-376
Autor:
V. B. Shekhtman
Publikováno v:
Mathematical Notes of the Academy of Sciences of the USSR. 23:417-424
Prepositional logics with many modalites, characterized by “two-dimensional” Kripke models, are investigated. The general problem can be formulated as follows: from two modal logics describing certain classes of Kripke modal lattices construct a
Publikováno v:
Metallurgist. 22:358-361