A fast algorithm for scalar Nevanlinna-Pick interpolation

DOI10.1007/BF01388683zbMath0791.65012MaRDI QIDQ1326428

Çetin Kaya Koç, Guan-Rong Chen

Publication date: 6 June 1994

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133699

zbMATH Keywords

fast algorithmNevanlinna-Pick interpolationFenyves arrayinterpolatory rational function

Mathematics Subject Classification ID

Approximation in the complex plane (30E10) Numerical interpolation (65D05) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Related Items

Computing matrix-valued Nevanlinna-Pick interpolation, A new algorithm for meromorphic Nevanlinna-Pick interpolation, Numerical determination of hitting time distributions from their Laplace transforms: simple cases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient parallel algorithms for linear recurrence computation
• Signal processing and systems theory. Selected topics
• Parallel algorithms for nevanlinna-pick interpolation:the scalar case^∗
• Depth-size trade-offs for parallel prefix computation
• On Parallel Searching
• Parallel Prefix Computation
• Parallelism in random access machines
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations