Advertisement

Unified Nearly Optimal Algorithms for Structured Integer Matrices

  • Victor Y. Pan
  • Brian J. Murphy
  • Rhys Eric Rosholt
Part of the Operator Theory: Advances and Applications book series (OT, volume 199)

Abstract

Our subject is the solution of a structured linear system of equations, which is closely linked to computing a shortest displacement generator for the inverse of its structured coefficient matrix. We consider integer matrices with the displacement structure of Toeplitz, Hankel, Vandermonde, and Cauchy types and combine the unified divide-and-conquer MBA algorithm (due to Morf 1974, 1980 and Bitmead and Anderson 1980) with the Chinese remainder algorithm to solve both computational problems within nearly optimal randomized Boolean and word time bounds. The bounds cover the cost of both solution and its correctness verification. The algorithms and nearly optimal time bounds are extended to the computation of the determinant of a structured integer matrix, its rank and a basis for its null space and further to some fundamental computations with univariate polynomials that have integer coefficients.

Mathematics Subject Classification (2000)

68W30 68W20 68Q25 68W40 

Keywords

Structured matrices the MBA divide-and-conquer algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABM99]
    J. Abbott, M. Bronstein, T. Mulders. Fast Deterministic Computation of the Determinants of Dense Matrices, Proc. Intern. Symp. Symbolic and Algebraic Comput. (ISSAC’99), 197–204, ACM Press, New York, 1999.Google Scholar
  2. [B85]
    J.R. Bunch, Stability of Methods for Solving Toeplitz Systems of Equations, SIAM J. Sci. Stat. Comput., 6(2), 349–364, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [B03]
    D.J. Bernstein, Fast Multiplication and Its Applications, to be printed in Algorithmic Number Theory (edited by Joe Buhler, Peter Stevenhagen), 44, Mathematical Sciences Research Institute Publications, Cambridge University Press. Available from http://cr.yp.to/papers.htmlGoogle Scholar
  4. [BA80]
    R.R. Bitmead, B.D.O. Anderson, Asymptotically Fast Solution of Toeplitz and Related Systems of Linear Equations, Linear Algebra and Its Applications, 34, 103–116, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [BGY80]
    R.P. Brent, F.G. Gustavson, D.Y.Y. Yun, Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximations, J. Algorithms, 1, 259–295, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [CK91]
    D.G. Cantor, E. Kaltofen, On Fast Multiplication of Polynomials over Arbitrary Rings, Acta Informatica, 28(7), 697–701, 1991.CrossRefMathSciNetGoogle Scholar
  7. [CW90]
    D. Coppersmith, S. Winograd, Matrix Multiplication via Arithmetic Progressions. J. Symbolic Comput., 9(3), 251–280, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [D59]
    J. Durbin, The Fitting of Time-Series Models, Review of International Statistical Institute, 28, 229–249, 1959.Google Scholar
  9. [F07]
    M. Fürer, Faster Integer Multiplication, Proceedings of 39th Annual Symposium on Theory of Computing (STOC 2007), 57–66, ACM Press, New York, 2007.Google Scholar
  10. [GG03]
    J. von zur Gathen, J. Gerhard, Modern Computer Algebra, Cambridge University Press, Cambridge, UK, 2003 (second edition).zbMATHGoogle Scholar
  11. [GI88]
    W. Gautschi, G. Inglese, Lower Bounds for the Condition Number of Vandermonde Matrices, Numerische Math., 52, 241–250, 1988.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [GO94]
    I. Gohberg, V. Olshevsky, Complexity of Multiplication with Vectors for Structured Matrices, Linear Algebra and Its Applications, 202, 163–192, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [H79]
    G. Heinig, Beiträge zur Spektraltheorie von Operatorbüscheln und zur algebraischen Theorie von Toeplitzmatrizen, Dissertation B, TH Karl-Marx-Stadt, 1979.Google Scholar
  14. [HR84]
    G. Heinig, K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators, Operator Theory, 13, Birkhäuser, 1984.Google Scholar
  15. [K98]
    D.E. Knuth, The Art of Computer Programming, 2: Seminumerical Algorithms, Addison-Wesley, Reading, Massachusetts, 1998.Google Scholar
  16. [K04]
    I. Kaporin, The Aggregation and Cancellation Techniques As a Practical Tool for Faster Matrix Multiplication, Theoretical Computer Science, 315, 469–510, 2004.zbMATHCrossRefMathSciNetGoogle Scholar
  17. [KKM79]
    T. Kailath, S.Y. Kung, M. Morf, Displacement Ranks of Matrices and Linear Equations, Journal Math. Analysis and Appls., 68(2), 395–407, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  18. [KS91]
    E. Kaltofen, B.D. Saunders, On Wiedemann’s Method for Solving Sparse Linear Systems, Proceedings of AAECC-5, Lecture Notes in Computer Science, 536, 29–38, Springer, Berlin, 1991.Google Scholar
  19. [L47]
    N. Levinson, The Wiener RMS (Root-Mean-Square) Error Criterion in the Filter Design and Prediction, Journal of Mathematical Physics, 25, 261–278, 1947.MathSciNetGoogle Scholar
  20. [M74]
    M. Morf, Fast Algorithms for Multivariable Systems, Ph.D. Thesis, Dept. Electrical Engineering, Stanford Univ., CA, 1974.Google Scholar
  21. [M80]
    M. Morf, Doubling Algorithms for Toeplitz and Related Equations, Proceedings of IEEE International Conference on ASSP, 954–959, IEEE Press, Piscataway, New Jersey, 1980.Google Scholar
  22. [OP98]
    V. Olshevsky, V.Y. Pan, A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problem and for Inversion and Factorization of Dense Structured Matrices, Proc. 39th Ann. IEEE SymP. Foundation of Comp. Science (FOCS 98), 192–201, IEEE Computer Soc. Press, Los Alamitos, CA, 1998.Google Scholar
  23. [P84]
    V.Y. Pan, How Can We Speed up Matrix Multiplication?, SIAM Review, 26(3), 393–415, 1984.zbMATHCrossRefMathSciNetGoogle Scholar
  24. [P89/90]
    V.Y. Pan, On Computations with Dense StructuredMatrices, Math. of Computation, 55(191), 179–190, 1990. Proceedings version in Proc. ISSAC’89, 34–42, ACM Press, New York, 1989.zbMATHCrossRefGoogle Scholar
  25. [P01]
    V.Y. Pan, Structured Matrices and Polynomials: Unified Superfast Algorithms, Birkhäuser/Springer, Boston/New York, 2001.zbMATHGoogle Scholar
  26. [P02]
    V.Y. Pan, Can We Optimize Toeplitz/Hankel Computations? Proc. of the Fifth International Workshop on Computer Algebra in Scientific Computing (CASC’02), Yalta, Crimea, Sept. 2002 (E.W. Mayr, V.G. Ganzha, E.V. Vorozhtzov, Editors), 253–264, Technische Universität München, Germany, 2002.Google Scholar
  27. [P04a]
    V.Y. Pan, On Theoretical and Practical Acceleration of Randomized Computation of the Determinant of an Integer Matrix, Zapiski Nauchnykh Seminarov POMI (in English), 316, 163–187, St. Petersburg, Russia, 2004. Also available at http://comet.lehman.cuny.edu/vpan/zbMATHGoogle Scholar
  28. [PMRa]
    V.Y. Pan, B. Murphy, R.E. Rosholt, Unified Nearly Optimal Algorithms for Structured Integer Matrices and Polynomials, Technical Report 2008003, PhD Program in Computer Science, The Graduate Center, CUNY, New York, 2008. Available at http://www.cs.gc.cuny.edu/tr/techreport.php?id=352 V.Y. Pan, B. Murphy, R.E. Rosholt, Nearly Optimal Symbolic-Numerical Algorithms for Structured Integer Matrices and Polynomials, Proceedings of International Symposium on Symbolic-Numerical Computations (Kyoto, Japan, August 2009), (edited by Hiroshi Kai and Hiroshi Sekigawa), pp. 105–113, ACM Press, New York, 2009Google Scholar
  29. [PMRW05]
    V.Y. Pan, B. Murphy, R.E. Rosholt, X. Wang, Toeplitz and Hankel Meet Hensel and Newton Modulo a Power of Two, Technical Report 2005008, PhD Program in Computer Science, The Graduate Center, CUNY, New York, 2005. Available at http://www.cs.gc.cuny.edu/tr/techreport.php?id=352Google Scholar
  30. [PW02]
    V.Y. Pan, X. Wang, Acceleration of Euclidean Algorithm and Extensions, Proc. Intern. Symp. Symbolic and Algebraic Computation (ISSAC’02), 207–213, ACM Press, New York, 2002.Google Scholar
  31. [PW08]
    V.Y. Pan, X. Wang, Degeneration of Integer Matrices Modulo an Integer, Linear Algebra and Its Application, 429, 2113–2130, 2008.zbMATHCrossRefMathSciNetGoogle Scholar
  32. [T64]
    W.F. Trench, An Algorithm for Inversion of Finite Toeplitz Matrices, J. of SIAM, 12, 515–4522, 1964.zbMATHMathSciNetGoogle Scholar
  33. [T94]
    E.E. Tyrtyshnikov, How Bad Are Hankel Matrices? Numerische Mathematik, 67(2), 261–269, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  34. [WP03]
    X. Wang, V.Y. Pan, Acceleration of Euclidean Algorithm and Rational Number Reconstruction, SIAM J. on Computing, 32(2), 548–556, 2003.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Birkhäuser Verlag Basel/Switzerland 2010

Authors and Affiliations

  • Victor Y. Pan
    • 1
  • Brian J. Murphy
    • 2
  • Rhys Eric Rosholt
    • 2
  1. 1.Department of Mathematics and Computer ScienceLehman College of the City University of New YorkBronxUSA
  2. 2.Department of Mathematics and Computer ScienceLehman College of the City University of New YorkBronxUSA

Personalised recommendations