Results 1  10
of
5,331
A basic interpolation problem
, 1998
"... Abstract. A basic interpolation problem, which includes bitangential matrix versions of a number of classical interpolation problems, is formulated and solved. Particular attention is placed on the development of the problem in a natural way and upon the fundamental role played by a special class of ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. A basic interpolation problem, which includes bitangential matrix versions of a number of classical interpolation problems, is formulated and solved. Particular attention is placed on the development of the problem in a natural way and upon the fundamental role played by a special class
On The Stability Of Certain Interpolation Problems
, 1995
"... In this work we present a number of results concerning the finite dimensional bandlimited interpolation problem. Our aim is to understand how the stability of the interpolation problem is affected by changes in the positions of the interpolation knots. We give upper and lower bounds for the eigenva ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this work we present a number of results concerning the finite dimensional bandlimited interpolation problem. Our aim is to understand how the stability of the interpolation problem is affected by changes in the positions of the interpolation knots. We give upper and lower bounds
Bayesian Interpolation
 NEURAL COMPUTATION
, 1991
"... Although Bayesian analysis has been in use since Laplace, the Bayesian method of modelcomparison has only recently been developed in depth. In this paper, the Bayesian approach to regularisation and modelcomparison is demonstrated by studying the inference problem of interpolating noisy data. T ..."
Abstract

Cited by 728 (17 self)
 Add to MetaCart
Although Bayesian analysis has been in use since Laplace, the Bayesian method of modelcomparison has only recently been developed in depth. In this paper, the Bayesian approach to regularisation and modelcomparison is demonstrated by studying the inference problem of interpolating noisy data
The abstract interpolation problem and applications
 McCarthy (Eds.), Holomorphic Spaces
, 1998
"... Abstract. A number of classical interpolation problems can be reduced to the following scheme. One is interested in the finding Schur class operator functions w(ζ) : E1 → E2, with ζ ∈ D, that satisfy certain interpolation conditions. The data of the problem are encoded in the Lyapunov identity D(T2x ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. A number of classical interpolation problems can be reduced to the following scheme. One is interested in the finding Schur class operator functions w(ζ) : E1 → E2, with ζ ∈ D, that satisfy certain interpolation conditions. The data of the problem are encoded in the Lyapunov identity D(T2
The interpolation problem for ksparse . . .
, 1991
"... In [DG 891, the authors show that many results concerning the problem of efficient interpolation of ksparse multivariate polynomials can be formulated and proved in the general setting of ksparse sums of characters of abelian monoids. In this note we describe another conceptual framework for the ..."
Abstract
 Add to MetaCart
In [DG 891, the authors show that many results concerning the problem of efficient interpolation of ksparse multivariate polynomials can be formulated and proved in the general setting of ksparse sums of characters of abelian monoids. In this note we describe another conceptual framework
On The Scalar Rational Interpolation Problem
 Mathematics of Control, Signals, and Systems
, 1996
"... A new algorithm is derived for determining a parametrization of all minimal complexity rational functions a(x)=b(x) interpolating an arbitrary sequence of points. Complexity is measured in terms of maxfdeg(a); deg(b)+rg where r is an arbitrary integer so our results are more general than the most co ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
equation, BerlekampMassey, WelchBerlekamp, realization problem 1 Introduction Let (ff 1 ; fi 1 ); (ff 2 ; fi 2 ); : : : ; (ff N ; fi N ) (1) be a sequence of pairs of elements from a field F. The fundamental scalar rational interpolation problem (see [1], for example) is to parametrize all rational
ABSTRACT INTERPOLATION PROBLEM IN NEVANLINNA CLASSES
, 2007
"... The abstract interpolation problem (AIP) in the Schur class was posed V. Katznelson, A. Kheifets and P. Yuditskii in 1987 as an extension of the V.P. Potapov’s approach to interpolation problems. In the present paper an analog of the AIP for Nevanlinna classes is considered. The description of solu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The abstract interpolation problem (AIP) in the Schur class was posed V. Katznelson, A. Kheifets and P. Yuditskii in 1987 as an extension of the V.P. Potapov’s approach to interpolation problems. In the present paper an analog of the AIP for Nevanlinna classes is considered. The description
On Some Interpolation Problems
"... In this paper we investigate some aspect of the partial realization problem formulated for Schurfunctions considered on the right half plane of C. This analysis can be considered to be partially complementary to the results of A. Lindquist, C. Byrnes et al. on Caratheodory functions, [2], [4], [3]. ..."
Abstract
 Add to MetaCart
In this paper we investigate some aspect of the partial realization problem formulated for Schurfunctions considered on the right half plane of C. This analysis can be considered to be partially complementary to the results of A. Lindquist, C. Byrnes et al. on Caratheodory functions, [2], [4], [3
The Interpolation Problem with a Degree Constraint
, 1999
"... In [6][8] it was shown that there is a correspondence between nonnegativenonnegativenonneg ative (hermitian) trigonometric polynomials of degree n and solutions to the standard NevanlinnaPickCarath eodory interpolation problem with n + 1 constraints, which are rational and also of degree n. ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
In [6][8] it was shown that there is a correspondence between nonnegativenonnegativenonneg ative (hermitian) trigonometric polynomials of degree n and solutions to the standard NevanlinnaPickCarath eodory interpolation problem with n + 1 constraints, which are rational and also of degree n
On a Geometrical Interpolation Problem
"... Given a finite set of points A in R n and a geometrical pattern Φ we define a type of distance between A and Φ and study how to find a pattern Φ among a parametrized family of geometrical objects such that such a distance is minimum. ..."
Abstract
 Add to MetaCart
Given a finite set of points A in R n and a geometrical pattern Φ we define a type of distance between A and Φ and study how to find a pattern Φ among a parametrized family of geometrical objects such that such a distance is minimum.
Results 1  10
of
5,331