Topics in Interpolation Theory of Rational Matrix-valued Functions (Paperback, Softcover reprint of the original 1st ed. 1988)

One of the basic interpolation problems from our point of view is the problem of building a scalar rational function if its poles and zeros with their multiplicities are given. If one assurnes that the function does not have a pole or a zero at infinity, the formula which solves this problem is (1) where Zl , " " Z/ are the given zeros with given multiplicates nl, " " n / and Wb" " W are the given p poles with given multiplicities ml, . . . ,m , and a is an arbitrary nonzero number. p An obvious necessary and sufficient condition for solvability of this simplest Interpolation pr- lern is that Zj :f: wk(1~ j ~ 1, 1~ k~ p) and nl +. . . +n/ = ml +. . . +m ' p The second problem of interpolation in which we are interested is to build a rational matrix function via its zeros which on the imaginary line has modulus 1. In the case the function is scalar, the formula which solves this problem is a Blaschke product, namely z z. )mi n u(z) = all = l~ (2) J ( Z+ Zj where [o] = 1, and the zj's are the given zeros with given multiplicities mj. Here the necessary and sufficient condition for existence of such u(z) is that zp :f: - Zq for 1~ ]1, q~ n.

General

Imprint:	Springer Basel
Country of origin:	Switzerland
Series:	Operator Theory: Advances and Applications, 33
Release date:	September 2014
First published:	1988
Authors:	I. Gohberg
Dimensions:	244 x 170 x 14mm (L x W x T)
Format:	Paperback
Pages:	247
Edition:	Softcover reprint of the original 1st ed. 1988
ISBN-13:	978-3-03-485471-9
Categories:	Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Functional analysis
LSN:	3-03-485471-4
Barcode:	9783034854719

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!