Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry (Q1415389): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0209248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized resultants over unirational algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices in elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4771385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le formalisme du résultant. (The formalism of resultant) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850733 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994656147 / rank
 
Normal rank

Latest revision as of 10:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry
scientific article

    Statements

    Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry (English)
    0 references
    0 references
    3 December 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    Digital filter
    0 references
    Solving systems of polynomial equations
    0 references
    Gröbner basis
    0 references
    Resultant
    0 references
    0 references
    0 references