State space realizations of rational interpolants with prescribed poles
β Scribed by Angel Ribalta
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 112 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
β¦ Synopsis
We give a generic algorithm for computing rational interpolants with prescribed poles. The resulting rational function is expressed in the so-called Newton form. State space realizations for this expression of rational functions are given. Our main tool for ΓΏnding state space realizations is Fuhrmann's shift realization theory from which we obtain concrete realizations by introducing suitable bases of the state space and expressing the abstract operators with respect to these bases in matrix form.
π SIMILAR VOLUMES
We introduce a method for calculating rational interpolants when some (but not necessarily all) of their poles are prescribed. The algorithm determines the weights in the barycentric representation of the rationals; it simply consists in multiplying each interpolated value by a certain number, compu
We study the following problem. Given a domain 0 containing infinity, is it possible to choose a sequence of polynomials Q n , n=1, 2, ..., where Q n has degree n, so that the following condition holds: if a function f is analytic in 0 and P n is the polynomial part of the Laurent expansion of Q n f