Orthogonal Systems and Convolution Operators

Orthogonal Systems and Convolution Operators

EnglishHardbackPrint on demand
Gohberg Israel
Springer, Basel
EAN: 9783764369293
Print on demand
Delivery on Tuesday, 28. of July 2026
€92.49
Common price €102.76
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Available formats

Detailed information

The main concern of this book is the distribution of zeros of polynomials that are orthogonal on the unit circle with respect to an indefinite weighted scalar or inner product. The first theorem of this type, proved by M. G. Krein, was a far-reaching generalization of G. Szego's result for the positive definite case. A continuous analogue of that theorem was proved by Krein and H. Langer. These results, as well as many generalizations and extensions, are thoroughly treated in this book. A unifying theme is the general problem of orthogonalization with invertible squares in modules over C*-algebras. Particular modules that are considered in detail include modules of matrices, matrix polynomials, matrix-valued functions, linear operators, and others. One of the central features of this book is the interplay between orthogonal polynomials and their generalizations on the one hand, and operator theory, especially the theory of Toeplitz marices and operators, and Fredholm and Wiener-Hopf operators, on the other hand. The book is of interest to both engineers and specialists in analysis.
EAN 9783764369293
ISBN 3764369299
Binding Hardback
Publisher Springer, Basel
Publication date November 21, 2002
Pages 245
Language English
Dimensions 235 x 155
Country Switzerland
Authors Ellis Robert L.; Gohberg Israel
Illustrations 2 black & white illustrations
Series Operator Theory: Advances and Applications
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.