Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry

DOI10.1016/S0196-8858(03)00022-8zbMath1032.94002arXivmath/0209248OpenAlexW1994656147MaRDI QIDQ1415389

John B. Little

Publication date: 3 December 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0209248

zbMATH Keywords

Gröbner basisDigital filterResultantSolving systems of polynomial equations

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

Computing the Dixon Resultant with the Maple Package DR ⋮ Heuristics to accelerate the Dixon resultant

Cites Work

• Le formalisme du résultant. (The formalism of resultant)
• Generalized resultants over unirational algebraic varieties
• Matrices in elimination theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry