A fast algorithm for Nevanlinna-Pick interpolation

DOI10.1109/78.91198MaRDI QIDQ3987287zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A fast algorithm for scalar Nevanlinna-Pick interpolation
• Publication:4486596
• Computing matrix-valued Nevanlinna-Pick interpolation
• Parallel algorithms for nevanlinna-pick interpolation:the scalar case^∗

Cited in

(6)

• A fast algorithm for scalar Nevanlinna-Pick interpolation
• Parallel algorithms for nevanlinna-pick interpolation:the scalar case^∗
• A fast algorithm for optimal linear interpolation
• scientific article; zbMATH DE number 1466438 (Why is no real title available?)
• scientific article; zbMATH DE number 1492796 (Why is no real title available?)
• Efficient Interpolation in the Guruswami–Sudan Algorithm

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)