A fast algorithm for Nevanlinna-Pick interpolation

DOI10.1109/78.91198zbMATH Open0743.41012OpenAlexW2113699054MaRDI QIDQ3987287

Andrew E. Yagle

Publication date: 28 June 1992

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.91198

zbMATH Keywords

fast algorithmscalar Nevanlinna-Pick interpolation problemsplit algorithms for linear prediction

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)

Related Items (3)

A fast algorithm for scalar Nevanlinna-Pick interpolation ⋮ Efficient Interpolation in the Guruswami–Sudan Algorithm ⋮ Title not available (Why is that?)

This page was built for publication: A fast algorithm for Nevanlinna-Pick interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987287)