Applications of FFT and structured matrices

[1]  Richard E. Blahut,et al.  Fast Algorithms for Digital Signal Processing , 1985 .

[2]  Thomas Kailath,et al.  Displacement structure approach to discrete-trigonometric-transform based preconditioners of G.Strang type and of T.Chan type , 1996, SIAM J. Matrix Anal. Appl..

[3]  B. Mourrain,et al.  Computation of a specified root of a polynomial system of equations using eigenvectors , 2000 .

[4]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[5]  N. Ahmed,et al.  FAST TRANSFORMS, algorithms, analysis, applications , 1983, Proceedings of the IEEE.

[6]  L. Bluestein.  A linear filtering approach to the computation of discrete Fourier transform , 1970 .

[7]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[8]  M. Fiedler.  Hankel and loewner matrices , 1984 .

[9]  L. Trefethen,et al.  Numerical linear algebra , 1997 .

[10]  Thomas Huckle,et al.  Iterative methods for ill-conditioned Toeplitz matrices , 1996 .

[11]  D. Rose,et al.  Generalized nested dissection , 1977 .

[12]  V. Pan,et al.  Structured matrices and newton's iteration: unified approach , 2000 .

[13]  Raymond H. Chan,et al.  Conjugate Gradient Methods for Toeplitz Systems , 1996, SIAM Rev..

[14]  David Y. Y. Yun,et al.  Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.

[15]  S. Winograd.  Arithmetic complexity of computations , 1980 .

[16]  John R. Gilbert,et al.  Parallel symbolic factorization of sparse linear systems , 1990, Parallel Comput..

[17]  Victor Y. Pan,et al.  Multivariate Polynomials, Duality, and Structured Matrices , 2000, J. Complex..

[18]  Y. Saad,et al.  Iterative solution of linear systems in the 20th century , 2000 .

[19]  Ioannis Z. Emiris,et al.  A Complete Implementation for Computing General Dimensional Convex Hulls , 1998, Int. J. Comput. Geom. Appl..

[20]  V. Pan.  On computations with dense structured matrices , 1990 .

[21]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[22]  John R. Gilbert,et al.  Highly Parallel Sparse Cholesky Factorization , 1992, SIAM J. Sci. Comput..

[23]  Victor Y. Pan,et al.  Nearly optimal computations with structured matrices , 2014, Theor. Comput. Sci..

[24]  Rainer Storn,et al.  Some results in fixed point error analysis of the Bruun-FTT algorithm , 1993, IEEE Trans. Signal Process..

[25]  Richard J. Fateman.  Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments , 1974, SIAM J. Comput..

[26]  Erich Kaltofen,et al.  Solving systems of nonlinear polynomial equations faster , 1989, ISSAC '89.

[27]  Victor Y. Pan,et al.  An efficient solution for Cauchy-likesystems of linear equations , 2004 .

[28]  Enrico Bozzo,et al.  Fast discrete transforms by means of eigenpolynomials , 1993 .

[29]  V. Pan.  The amended DSeSC power method for polynomial root-finding , 2005 .

[30]  Johannes Buchmann,et al.  LiDIA : a library for computational number theory , 1995 .

[31]  G. Golub,et al.  A bibliography on semiseparable matrices* , 2005 .

[32]  Steven G. Johnson,et al.  The Fastest Fourier Transform in the West , 1997 .

[33]  Erich Kaltofen,et al.  On computing greatest common divisors with polynomials given by black boxes for their evaluations , 1995, ISSAC '95.

[34]  Raymond H. Chan,et al.  Scientific applications of iterative Toeplitz solvers , 1996 .

[35]  Erich Kaltofen,et al.  Modular rational sparse multivariate polynomial interpolation , 1990, ISSAC '90.

[36]  Steven G. Johnson,et al.  A Modified Split-Radix FFT With Fewer Arithmetic Operations , 2007, IEEE Transactions on Signal Processing.

[37]  Victor Y. Pan,et al.  Solving a Polynomial Equation: Some History and Recent Progress , 1997, SIAM Rev..

[38]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[39]  Dario Bini,et al.  SPECTRAL AND COMPUTATIONAL PROPERTIES OF BAND SYMMETRIC TOEPLITZ MATRICES , 1983 .

[40]  Martin Vetterli,et al.  Fast Fourier transforms: a tutorial review and a state of the art , 1990 .

[41]  D. J. Bernstein.  Fast multiplication and its applications , 2008 .

[42]  I. Gohberg,et al.  Complexity of multiplication with vectors for structured matrices , 1994 .

[43]  L. Rabiner,et al.  The chirp z-transform algorithm-a lesson in serendipity , 2004, IEEE Signal Processing Magazine.

[44]  V. Rokhlin.  Rapid solution of integral equations of classical potential theory , 1985 .

[45]  Michael B. Monagan,et al.  Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction , 2004, ISSAC '04.

[46]  Victor Y. Pan,et al.  c ○ 2003 Society for Industrial and Applied Mathematics INVERSION OF DISPLACEMENT OPERATORS ∗ , 2022 .

[47]  David H. Bailey,et al.  A Fortran 90-based multiprecision system , 1995, TOMS.

[48]  Victor Y. Pan,et al.  Fast and Efficient Parallel Solution of Sparse Linear Systems , 1993, SIAM J. Comput..

[49]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[50]  Alfred V. Aho,et al.  Evaluating Polynomials at Fixed Sets of Points , 1975, SIAM J. Comput..

[51]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[52]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[53]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[54]  Thomas Kailath,et al.  Fast Gaussian elimination with partial pivoting for matrices with displacement structure , 1995 .

[55]  Paola Favati,et al.  On a Matrix Algebra Related to the Discrete Hartley Transform , 1993, SIAM J. Matrix Anal. Appl..

[56]  R. E. Cline,et al.  Generalized inverses of certain Toeplitz matrices , 1974 .

[57]  Erich Kaltofen,et al.  Factorization of Polynomials Given by Straight-Line Programs , 1989, Adv. Comput. Res..

[58]  Victor Y. Pan,et al.  Complexity of Computations with Matrices and Polynomials , 1992, SIAM Rev..

[59]  Erich Kaltofen,et al.  Improved Sparse Multivariate Polynomial Interpolation Algorithms , 1988, ISSAC.

[60]  Victor Y. Pan,et al.  Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices , 2002, J. Symb. Comput..

[61]  R. Bracewell.  The Fourier Transform and Its Applications , 1966 .

[62]  Dinesh Manocha,et al.  Multipolynomial Resultant Algorithms , 1993, J. Symb. Comput..

[63]  M. Morf,et al.  Displacement ranks of matrices and linear equations , 1979 .

[64]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[65]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[66]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[67]  Victor Y. Pan,et al.  Superfast algorithms for Cauchy-like matrix computations and extensions , 2000 .

[68]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[69]  Vlastimil Pták,et al.  Loewner and Bézout matrices , 1988 .

[70]  Victor Y. Pan,et al.  Sign Determination in Residue Number Systems , 1999, Theor. Comput. Sci..

[71]  V. Pan,et al.  Randomized Preprocessing of Homogeneous Linear Systems of Equations , 2010 .

[72]  Victor Y. Pan,et al.  Univariate polynomial division with a remainder by means of evaluation and interpolation , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[73]  A. Householder.  The numerical treatment of a single nonlinear equation , 1970 .

[74]  V. Pan.  On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix , 2006 .

[75]  Samuel D. Conte,et al.  Elementary Numerical Analysis: An Algorithmic Approach , 1975 .

[76]  Mikkel Thorup,et al.  An O(n log n) algorithm for the maximum agreement subtree problem for binary trees , 1996, SODA '96.

[77]  Victor Y. Pan,et al.  Parallel Computation of Polynomial GCD and Some Related Parallel Computations over Abstract Fields , 1996, Theor. Comput. Sci..

[78]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[79]  Victor Y. Pan,et al.  New Techniques for the Computation of Linear Recurrence Coefficients , 2000 .

[80]  Victor Y. Pan,et al.  Additive preconditioning, eigenspaces, and the inverse iteration☆ , 2009 .

[81]  V. Pan.  Structured Matrices and Polynomials: Unified Superfast Algorithms , 2001 .

[82]  C. Rader.  Discrete Fourier transforms when the number of data samples is prime , 1968 .

[83]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.

[84]  Victor Y. Pan,et al.  A unified superfast algorithm for boundary rational tangential interpolation problems and for inversion and factorization of dense structured matrices , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[85]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[86]  W. M. Gentleman,et al.  Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).

[87]  Victor Y. Pan,et al.  On Rational Number Reconstruction and Approximation , 2004, SIAM J. Comput..

[88]  Victor Y. Pan,et al.  Iterative inversion of structured matrices , 2004, Theor. Comput. Sci..

[89]  V. Pan,et al.  Degeneration of Structured Integer Matrices Modulo an Integer , 2008 .

[90]  Victor Y. Pan,et al.  Homotopic residual correction processes , 2006, Math. Comput..

[91]  Victor Y. Pan.  Simple Multivariate Polynomial Multiplication , 1994, J. Symb. Comput..

[92]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[93]  Paul N. Swarztrauber,et al.  FFT algorithms for vector computers , 1984, Parallel Comput..

[94]  Marek Karpinski,et al.  Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[95]  G. Strang.  Wavelet transforms versus Fourier transforms , 1993, math/9304214.

[96]  Vladimir Rokhlin,et al.  A Fast Algorithm for the Numerical Evaluation of Conformal Mappings , 1989 .

[97]  Victor Y. Pan,et al.  A new approach to fast polynomial interpolation and multipoint evaluation , 1993 .

[98]  Georg Heinig,et al.  Algebraic Methods for Toeplitz-like Matrices and Operators , 1984 .

[99]  Victor Y. Pan,et al.  Schur aggregation for linear systems and determinants , 2008, Theor. Comput. Sci..

[100]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[101]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.