Un problema di approssimazione connesso con la sintesi di filtri digitali non ricorsivi

DOI10.1007/BF02576702MaRDI QIDQ1150344zbMATH OpenOpenAlexFDO

Authors Stefano Alliney, Bianca Rosa Bellomo, Fiorella Sgallari

Publication date 1980

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02576702

zbMATH Keywords

Chebyshev approximationdesign algorithmdigital filtersdual simplex algorithmfinite impulse response

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Linear programming (90C05) Convex programming (90C25) Filtering in stochastic control theory (93E11)

Cites work

• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• The Cutting-Plane Method for Solving Convex Programs

This page was built for publication: Un problema di approssimazione connesso con la sintesi di filtri digitali non ricorsivi

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