Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16263151

QR Factoring to compute the GCD of univariate approximate polynomials

Author
CORLESS, Robert M1 ; WATT, Stephen M1 ; LIHONG ZHI1
[1] The Ontario Research Centre for Computer Algebra, University of Western Ontario, London, ON N6A 5B7, Canada
Source

IEEE transactions on signal processing. 2004, Vol 52, Num 12, pp 3394-3402, 9 p ; ref : 23 ref

CODEN
ITPRED
ISSN
1053-587X
Scientific domain
Telecommunications
Publisher
Institute of Electrical and Electronics Engineers, New York, NY
Publication country
United States
Document type
Article
Language
English
Author keyword
Greatest common divisor QR-factoring Sylvester matrix
Keyword (fr)
Traitement signal Algorithme QR Plus grand diviseur commun
Keyword (en)
Signal processing QR algorithm Greatest commun divisor
Keyword (es)
Procesamiento señal
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A02 Mathematical methods

Discipline
Telecommunications and information theory
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
16263151

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web