Complexity of Computations with Matrices and Polynomials
- 1 June 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 34 (2) , 225-262
- https://doi.org/10.1137/1034049
Abstract
No abstract availableThis publication has 84 references indexed in Scilit:
- A Fast Algorithm for the Evaluation of Legendre ExpansionsSIAM Journal on Scientific and Statistical Computing, 1991
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real RootsSIAM Journal on Computing, 1988
- The fast multipole method for gridless particle simulationComputer Physics Communications, 1988
- Superfast Solution of Real Positive Definite Toeplitz SystemsSIAM Journal on Matrix Analysis and Applications, 1988
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, 1984
- The complexity of partial derivativesTheoretical Computer Science, 1983
- An optimal order process for solving finite element equationsMathematics of Computation, 1981
- Evaluating Polynomials at Fixed Sets of PointsSIAM Journal on Computing, 1975
- Iteration methods for finding all zeros of a polynomial simultaneouslyMathematics of Computation, 1973
- A note on an iterative method for generalized inversion of matricesMathematics of Computation, 1966