138,23 €
153,59 €
-10% with code: EXTRA
Extension and Interpolation of Linear Operators and Matrix Functions
Extension and Interpolation of Linear Operators and Matrix Functions
138,23
153,59 €
  • We will send in 10–14 business days.
The classicallossless inverse scattering (LIS) problem of network theory is to find all possible representations of a given Schur function s(z) (i. e., a function which is analytic and contractive in the open unit disc D) in terms of an appropriately restricted class of linear fractional transformations. These linear fractional transformations corre- spond to lossless, causal, time-invariant two port networks and from this point of view, s(z) may be interpreted as the input transfer function of…
  • Publisher:
  • Year: 1990
  • Pages: 305
  • ISBN-10: 3764325305
  • ISBN-13: 9783764325305
  • Format: 15.2 x 22.9 x 1.7 cm, hardcover
  • Language: English
  • SAVE -10% with code: EXTRA

Extension and Interpolation of Linear Operators and Matrix Functions (e-book) (used book) | bookbook.eu

Reviews

Description

The classicallossless inverse scattering (LIS) problem of network theory is to find all possible representations of a given Schur function s(z) (i. e., a function which is analytic and contractive in the open unit disc D) in terms of an appropriately restricted class of linear fractional transformations. These linear fractional transformations corre- spond to lossless, causal, time-invariant two port networks and from this point of view, s(z) may be interpreted as the input transfer function of such a network with a suitable load. More precisely, the sought for representation is of the form s(Z) = -{ -A(Z)SL(Z) + B(z)}{ -C(Z)SL(Z) + D(z)} -1, (1. 1) where "the load" SL(Z) is again a Schur function and _ [A(Z) B(Z)] 0( ) (1. 2) Z - C(z) D(z) is a 2 x 2 J inner function with respect to the signature matrix This means that 0 is meromorphic in D and 0(z)* J0(z)::5 J (1. 3) for every point zED at which 0 is analytic with equality at almost every point on the boundary Izi = 1. A more general formulation starts with an admissible matrix valued function X(z) = [a(z) b(z)] which is one with entries a(z) and b(z) which are analytic and bounded in D and in addition are subject to the constraint that, for every n, the n x n matrix with ij entry equal to X(Zi)J X(Zj )* i, j=l, . . .

EXTRA 10 % discount with code: EXTRA

138,23
153,59 €
We will send in 10–14 business days.

The promotion ends in 19d.16:45:04

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,54 Book Euros!?
  • Author: I Gohberg
  • Publisher:
  • Year: 1990
  • Pages: 305
  • ISBN-10: 3764325305
  • ISBN-13: 9783764325305
  • Format: 15.2 x 22.9 x 1.7 cm, hardcover
  • Language: English English

The classicallossless inverse scattering (LIS) problem of network theory is to find all possible representations of a given Schur function s(z) (i. e., a function which is analytic and contractive in the open unit disc D) in terms of an appropriately restricted class of linear fractional transformations. These linear fractional transformations corre- spond to lossless, causal, time-invariant two port networks and from this point of view, s(z) may be interpreted as the input transfer function of such a network with a suitable load. More precisely, the sought for representation is of the form s(Z) = -{ -A(Z)SL(Z) + B(z)}{ -C(Z)SL(Z) + D(z)} -1, (1. 1) where "the load" SL(Z) is again a Schur function and _ [A(Z) B(Z)] 0( ) (1. 2) Z - C(z) D(z) is a 2 x 2 J inner function with respect to the signature matrix This means that 0 is meromorphic in D and 0(z)* J0(z)::5 J (1. 3) for every point zED at which 0 is analytic with equality at almost every point on the boundary Izi = 1. A more general formulation starts with an admissible matrix valued function X(z) = [a(z) b(z)] which is one with entries a(z) and b(z) which are analytic and bounded in D and in addition are subject to the constraint that, for every n, the n x n matrix with ij entry equal to X(Zi)J X(Zj )* i, j=l, . . .

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)