A Complete Bibliography of Lecture Notes in Mathematics (1985{1989)
01 Jan 2014-
TL;DR: (1 < p ≤ ∞) [LS87f] (2) [HR88a].
Abstract: (1 < p ≤ ∞) [LS87f]. (2) [HR88a]. (2m− 2) [KL88]. (A0, A1)θ1 [Xu87a]. (α, β) [Pie88a, Fin88a]. (d ≥ 1) [Wsc85a]. (λ) [DM85b]. (Z/2) [Car86b]. (nα) [Sch85h]. (φ)2 [BM89c]. (τ − λ)u = f [Wei87r]. (x, t) [Lum87, Lum89]. (X1 −X3, X2 −X3) [SW87]. 0 [Caz88, Kas86, Pro87]. 0 < p < 1 [Cle87]. 1 [Bak85a, DD85, Drm87, Eli88, FT88a, Gek86d, HN88, Kos86a, LT89, Pet89a, Pro87, Tan87, vdG89]. 1/4 [KS86e]. 1 ≤ q < 2 [Gue86]. 2 [BPPS87, Cam88, Cat85a, ES87b, Gan85e, Gol86a, HRL89g, Hei85, Hua86, Kan89, KB86, Li86, LT89, Mil87b, Mur85a, Qui85b, SP89, Shi85, Spe86, Wal85b, Wan86]. 2m− 2 [Kos88b]. 2m− 3 [Kos88b]. 2m− 4 [Kos88b]. 2× 2 [Vog88]. 3 [Aso89, BPPS87, BW85c, BG88b, Che86d, Fis86, Gab85, Gu87a, HLM85b, Kam89b, Kir89c, Lev85c, Mil85c, Néd86, Pet86, Ron86, Sch85b, ST88, Tur88b, Wan86, Wen85, tDP89, vdW86]. 4 [Bau88a, Don85a, FKV88, Kha88, Kir89l, SS86, Seg85b, Wal85b]. 5 [Ito89, Kir89e, SV85]. 5(4) [Cas86]. 5819539783680 [KSX87]. 6 [PH89, Žub88].
Citations
More filters
••
01 Jan 1993TL;DR: In this paper, the Gelfand theory of commutative Banach algebras is introduced and analyzed, showing that piecewise continuous functions become continuous under the GELFand transformation.
Abstract: This chapter contains the Gelfand theory of commutative Banach algebras. The Gelfand spectrum and the Gelfand transform are introduced and analysed. The results are illustrated by various examples. In particular, it is explained in detail how under the Gelfand transformation piecewise continuous functions become continuous. Special attention is paid to finitely generated commutative Banach algebras and to the Banach algebra generated by a compact operator. The last two sections present applications to factorization of matrix functions and to Wiener-Hopf integral operators. The analysis starts with a study of multiplicative linear functionals.
6 citations
01 Jan 2015
TL;DR: Beebe's bibliography as mentioned in this paper records publications of Nelson H. F. Beebe, and includes a bibliography of publications related to his work on cross-reference cross-references.
Abstract: This bibliography records publications of Nelson H. F. Beebe. Title word cross-reference #1 [68]. #2 [99, 184]. #3 [100, 186]. #4 [115, 192]. #5 [117, 195]. #6 [201]. #7 [210]. #8 [223]. 10 [49]. + [101, 109]. AΠ [101]. α [52]. Ax = λBx [61, 122]. C2O2 [57]. expm1(x) = exp(x)− 1 [732]. F (m, t) [172]. H2 [59]. He2 [105]. HF [59]. log1p(x) = log(1 + x) [733]. O2 [66]. O + 2 [66]. O 2 [66]. π [940]. X Σ [101]. 118 [263]. 18-Aug-80 [184, 186, 192, 195, 201]. 1964 [506]. 1969 [501, 1054, 507]. 1974 [509]. 1979 [502, 1056, 510]. 1984 [511]. 1989 [503, 1057, 512]. 1994 [513]. 1999 [504, 1058, 508]. 2 [407, 406]. 2.0 [262]. 2.00 [215]. 2.3a [230]. 2.3c [234]. 20 [134, 232, 237]. 20/60 [249, 248]. ’2000 [654]. ’2001 [717]. ’2002 [755]. ’2003 [756, 773]. ’2004 [836, 621]. ’2005 [837]. 2007 [859, 1105]. 2009 [922, 1059]. ’2011 [989]. ’2012 [1053]. 2019 [921, 1055]. 2311 [11, 26, 54]. 3 [138, 139, 218, 244]. 3.0 [262]. 3100 [254]. 3330 [39, 43, 54]. 360 [27]. 370 [39].
4 citations
•
01 Jan 1986
TL;DR: Probability and geometry of Banach spaces this paperourier analysis in Banach space is an analytical formulation with some applications in analysis, and it has been used in this paper.
Abstract: Probability and geometry.- Martingales and Fourier analysis in Banach spaces.- Martingale theory : An analytical formulation with some applications in analysis.- Probabilistic methods in the geometry of Banach spaces.- Some remarks on integral operators and equimeasurable sets.- Cylinder measures, local bases and nuclearity.
2 citations
References
More filters
••
TL;DR: This paper develops a technique which utilizes earlier methods to derive even more efficient preconditioners for the discrete systems of equations arising from the numerical approximation of elliptic boundary value problems.
Abstract: In earlier parts of this series of papers, we constructed preconditioners for the discrete systems of equations arising from the numerical approximation of elliptic boundary value problems. The resulting algorithms are well suited for implementation on computers with parallel architecture. In this paper, we will develop a technique which utilizes these earlier methods to derive even more efficient preconditioners. The iterative algorithms using these new preconditioners converge to the solution of the discrete equations with a rate that is independent of the number of unknowns. These preconditioners involve an incomplete Chebyshev iteration for boundary interface conditions which results in a negligible increase in the amount of computational work. Theoretical estimates and the results of numerical experiments are given which demonstrate the effectiveness of the methods.
650 citations
••
01 Jan 1985TL;DR: The classical orthogonal polynomials have been defined in this paper, and a number of orthogonality relations for some of the classical polynomial classes have been established.
Abstract: There have been a number of definitions of the classical orthogonal polynomials, but each definition has left out some important orthogonal polynomials which have enough nice properties to justify including them in the category of classical orthogonal polynomials. We summarize some of the previous work on classical orthogonal polynomials, state our definition, and give a few new orthogonality relations for some of the classical orthogonal polynomials.
532 citations