Effective Fast Algorithms for Polynomial Spectral Factorization

Author： Bini D.A.   Fiorentino G.   Gemignani L.   Meini B.  

Publisher： Springer Publishing Company

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.34, Iss.2-4, 2003-12, pp. : 217-227

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fast Spectral Projection Algorithms for Density-Matrix Computations

By Beylkin G.   Coult N.   Mohlenkamp M.J.  

Journal of Computational Physics, Vol. 152, Iss. 1, 1999-06 ,pp. : 32-54

Academic Press

Access to resources Recommend Favorite

On the acceleration of an algorithm for polynomial factorization

By Malyshev A.  

Doklady Mathematics, Vol. 88, Iss. 2, 2013-09 ,pp. : 586-589

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Fast separable factorization and applications

By Lecerf Grégoire  

Applicable Algebra in Engineering, Communication and Computing, Vol. 19, Iss. 2, 2008-04 ,pp. : 135-160

Springer Publishing Company

Access to resources Recommend Favorite

Matrix spectral factorization and wavelets

By Janashia G.   Lagvilava E.   Ephremidze L.  

Journal of Mathematical Sciences, Vol. 195, Iss. 4, 2013-12 ,pp. : 445-454

Springer Publishing Company

Access to resources Recommend Favorite

Spectral factorization using FFTs for large‐scale problems

By  

INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, Vol. 29, Iss. 8, 2015-08 ,pp. : 954-970

John Wiley & Sons Inc

Access to resources Recommend Favorite