Results 1  10
of
216,727
SPECTRAL FACTORIZATION AND NEVANLINNAPICK INTERPOLATION
, 1987
"... We develop a spectral factorization algorithm based on linear fractional transformations and on the NevanlinnaPick interpolation theory. The algorithm is recursive and depends on a choice of points (Zk, k 1, 2, ") inside the unit disk. Under a mild condition on the distribution of the zk’s, t ..."
Abstract
 Add to MetaCart
We develop a spectral factorization algorithm based on linear fractional transformations and on the NevanlinnaPick interpolation theory. The algorithm is recursive and depends on a choice of points (Zk, k 1, 2, ") inside the unit disk. Under a mild condition on the distribution of the zk
Generalizations of the NevanlinnaPick interpolation problem
 in Proceedings of the Joint 44th IEEE Conference on Decision and Control (CDC) and European Control Conference (ECC
, 2005
"... Abstract — This paper aims at generalizing the wellknown NevanlinnaPick interpolation problem by considering additional constraints. The first type of constraints we consider requires the interpolation function to be of a given degree. Several results are provided for different degree constraints. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract — This paper aims at generalizing the wellknown NevanlinnaPick interpolation problem by considering additional constraints. The first type of constraints we consider requires the interpolation function to be of a given degree. Several results are provided for different degree constraints
On the duality between filtering and NevanlinnaPick interpolation
 SIAM J. Control and Optimization
, 2000
"... Abstract. Positive real rational functions play a central role in both deterministic and stochastic linear systems theory, as well as in circuit synthesis, spectral analysis, and speech processing. For this reason, results about positive real transfer functions and their realizations typically have ..."
Abstract

Cited by 19 (14 self)
 Add to MetaCart
also outline a new proof of the recent solution to the rational Nevanlinna–Pick interpolation problem, using an algebraic topological generalization of Hadamard’s global inverse function theorem. Key words. Nevanlinna–Pick interpolation, filtering, positive real functions, foliations, degree constraint
Boundary NevanlinnaPick interpolation via reduction and augmentation
, 2009
"... We give an elementary proof of Sarason’s solvability criterion for the NevanlinnaPick problem with boundary interpolation nodes and boundary target values. We also give a concrete parametrization of all solutions of such a problem. The proofs are based on a reduction method due to Nevanlinna and th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We give an elementary proof of Sarason’s solvability criterion for the NevanlinnaPick problem with boundary interpolation nodes and boundary target values. We also give a concrete parametrization of all solutions of such a problem. The proofs are based on a reduction method due to Nevanlinna
NevanlinnaPick interpolation on distinguished varieties in the bidisk
 J. Funct. Anal
"... ar ..."
A Generalized Entropy Criterion for NevanlinnaPick Interpolation with Degree Constraint
 IEEE Trans. Automat. Control
, 2001
"... In this paper, we present a generalized entropy criterion for solving the rational NevanlinnaPick problem for +1 interpolating conditions and the degree of interpolants bounded by . The primal problem of maximizing this entropy gain has a very wellbehaved dual problem. This dual is a convex opti ..."
Abstract

Cited by 70 (30 self)
 Add to MetaCart
In this paper, we present a generalized entropy criterion for solving the rational NevanlinnaPick problem for +1 interpolating conditions and the degree of interpolants bounded by . The primal problem of maximizing this entropy gain has a very wellbehaved dual problem. This dual is a convex
NEVANLINNAPICK INTERPOLATION FOR C + BH ∞
, 803
"... Abstract. Given an inner function B we classify the invariant subspaces of the algebra H ∞ B: = C + BH ∞. We derive a formula in terms of these invariant subspaces for the distance of an element in L ∞ to a certain weak ∗closed ideal in H ∞ B and use this to prove an analogue of the NevanlinnaPick ..."
Abstract
 Add to MetaCart
Abstract. Given an inner function B we classify the invariant subspaces of the algebra H ∞ B: = C + BH ∞. We derive a formula in terms of these invariant subspaces for the distance of an element in L ∞ to a certain weak ∗closed ideal in H ∞ B and use this to prove an analogue of the NevanlinnaPick
View Interpolation for Image Synthesis
"... Imagespace simplifications have been used to accelerate the calculation of computer graphic images since the dawn of visual simulation. Texture mapping has been used to provide a means by which images may themselves be used as display primitives. The work reported by this paper endeavors to carry t ..."
Abstract

Cited by 605 (0 self)
 Add to MetaCart
are a structured set of views of a 3D object or scene, intermediate frames derived by morphing can be used to approximate intermediate 3D transformations of the object or scene. Using the view interpolation approach to synthesize 3D scenes has two main advantages. First, the 3D representation
NevanlinnaPick interpolation for noncommutative analytic Toeplitz algebras
 OPERATOR THY
, 1998
"... The noncommutative analytic Toeplitz algebra is the wot–closed algebra generated by the left regular representation of the free semigroup on n generators. We obtain a distance formula to an arbitrary wotclosed right ideal and thereby show that the quotient is completely isometrically isomorphic to ..."
Abstract

Cited by 74 (16 self)
 Add to MetaCart
to the compression of the algebra to the orthogonal complement of the range of the ideal. This is used to obtain Nevanlinna–Pick type interpolation theorems.
A Fast Algorithm for MatrixValued NevanlinnaPick Interpolation
, 1995
"... . In this paper, we derive a new fast algorithm for the matrixvalued NevanlinnaPickinterpolation. Given n distinct points z i in the unit disk jzj # 1 and n complex matrices Wk of dimension m # m, satisfying the Pick condition for 1 # k # n, the new NevanlinnaPick interpolation algorithm requires ..."
Abstract
 Add to MetaCart
. In this paper, we derive a new fast algorithm for the matrixvalued NevanlinnaPickinterpolation. Given n distinct points z i in the unit disk jzj # 1 and n complex matrices Wk of dimension m # m, satisfying the Pick condition for 1 # k # n, the new NevanlinnaPick interpolation algorithm
Results 1  10
of
216,727