Results 161 to 170 of about 17,042 (194)

A Subspace‐Based Method for Solving Lagrange–Sylvester Interpolation Problems

SIAM Journal on Matrix Analysis and Applications, 2007
In this paper, we study the Lagrange-Sylvester interpolation of rational matrix functions which are analytic at infinity, and propose a new interpolation algorithm based on the recent subspace-based identification methods. The proposed algorithm is numerically efficient and delivers a minimal interpolant in state-space form.
Akçay, Hüseyin, Türkay, Semiha
openaire   +1 more source

Disjoint unions of complex affine subspaces interpolating for Ap

Forum Mathematicum, 1999
Let \(X\) be an analytic subset in \(\mathbb C^n\) and \(p\) a weight function on \(\mathbb C^n.\) Let \(f\) be an analytic function on \(X\) satisfying the growth condition \(| f(\zeta)|\leq A\exp(Bp(\zeta))\), \(\zeta\in\mathbb C^n,\) for some constants \(A, B > 0.\) It is interesting whether there exists an entire function \(F\) on \(\mathbb C^n ...
openaire   +2 more sources

ON THE SUBSPACE-BASED INTERPOLATION OF RATIONAL MATRIX FUNCTIONS

IFAC Proceedings Volumes, 2007
Abstract In this paper, we study interpolation of rational matrix functions which are analytic at infinity and discuss the properties of a recently proposed interpolation algorithm related to the frequency-domain subspace-based identification methods. The efficiency of the algorithm is illustrated with a step-by-step numerical example.
Hüseyin Akçay, Semiha Türkay
openaire   +1 more source

Subspace Interpolation via Dictionary Learning for Unsupervised Domain Adaptation

2013 IEEE Conference on Computer Vision and Pattern Recognition, 2013
Domain adaptation addresses the problem where data instances of a source domain have different distributions from that of a target domain, which occurs frequently in many real life scenarios. This work focuses on unsupervised domain adaptation, where labeled data are only available in the source domain.
Jie Ni, Qiang Qiu, Rama Chellappa
openaire   +1 more source

Rational interpolation from phase data by subspace methods

Proceedings of the 2010 American Control Conference, 2010
In this paper, two simple subspace-based identification algorithms to identify stable linear-time-invariant systems from corrupted phase samples of frequency response function are developed. The first algorithm uses data sampled at nonuniformly spaced frequencies and is strongly consistent if corruptions are zero-mean additive random variables with a ...
openaire   +2 more sources

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly  

Invariant Subspace Representations, Unitary Interpolants and Factorization Indices

1984
The goal of this paper is to describe and analyze the set of all unitary n × n matrix valued functions $$ F\left( \varsigma \right) = \sum\limits_{j = - \infty }^\infty {{F_j}{\varsigma ^j}} $$ on the unit circle T•T with prescribed matrix Fourier coefficients Fj =Kj for j < 0.
openaire   +1 more source

On generalized interpolation and shift invariant maximal semidefinite subspaces

1998
We consider the bitangential Nevanlinna-Pick problem for meromorphic matrix functions with upper bounded total pole multiplicity. We follow the approach of J.A. Ball and J.W. Helton to view this problem as a shift invariant maximal semi-definite sub-space problem in a space with indefinite inner product.
openaire   +1 more source

Obesity and adverse breast cancer risk and outcome: Mechanistic insights and strategies for intervention

Ca-A Cancer Journal for Clinicians, 2017
Cynthia Morata-Tarifa, Joyce M Slingerland   +1 more
exaly  

Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma

Ca-A Cancer Journal for Clinicians, 2020
Aaron J Grossberg, William L Hwang, Anirban Maitra   +2 more
exaly