Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2008: Automata, Languages and Programming pp 434–446Cite as

Dynamic Normal Forms and Dynamic Characteristic Polynomial

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5125))

Abstract

We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updates in O(n 2 logn) randomized time and queries in constant time, whereas in the general case the algorithm works in O(n 2 k logn) randomized time, where k is the number of invariant factors of the matrix. The algorithm is based on the first dynamic algorithm for computing normal forms of a matrix such as the Frobenius normal form or the tridiagonal symmetric form. The algorithm can be extended to solve the matrix eigenproblem with relative error 2− b in additional O(n log2 n logb) time. Furthermore, it can be used to dynamically maintain the singular value decomposition (SVD) of a generic matrix. Together with the algorithm the hardness of the problem is studied. For the symmetric case we present an Ω(n 2) lower bound for rank-one updates and an Ω(n) lower bound for element updates.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Giesbrecht, M.: Nearly optimal algorithms for canonical matrix forms. SIAM Journal on Computing 24(5), 948–969 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Eberly, W.: Asymptotically efficient algorithms for the Frobenius form. Paper 723-26, Department of Computer Science, University of Calgary (2003)

    Google Scholar 

  3. Villard, G.: Computing the Frobenius normal form of a sparse matrix. In: The Third International Workshop on Computer Algebra in Scientific Computing, pp. 395–407. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Storjohann, A.: Deterministic computation of the frobenius form. In: FOCS, pp. 368–377 (2001)

    Google Scholar 

  5. Ben-Amram, A., Galil, Z.: On pointers versus addresses. J. Assoc. Comput. Mach. 39, 617–648 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Pan, V., Chen, Z.: The complexity of the matrix eigenproblem. In: STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 507–516. ACM Press, New York (1999)

    Google Scholar 

  7. Frandsen, G., Hansen, J., Miltersen, P.: Lower bounds for dynamic algebraic problems. Inform. and Comput. 171(2), 333–349 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Frandsen, P., Frandsen, G.: Dynamic matrix rank. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 395–406. Springer, Berlin (2006)

    Chapter  Google Scholar 

  9. Sankowski, P.: Dynamic Transitive Closure via Dynamic Matrix Inverse. In: FOCS, pp. 509–517 (2004)

    Google Scholar 

  10. Ibarra, O., Moran, S., Rosier, L.: A note on the parallel complexity of computing the rank of order n matrices. Inform. Process. Lett. 11(4-5), 162 (1980)

    Article  MathSciNet  Google Scholar 

  11. Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. In: STOC, pp. 338–339. ACM Press, New York (1986)

    Google Scholar 

  12. Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, vol. 92. American Mathematical Society (1997)

    Google Scholar 

  13. Babai, L., Grigoryev, D., Mount, D.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, New York, NY, USA, pp. 310–324 (1982)

    Google Scholar 

  14. Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23(98), 289–305 (1973)

    MathSciNet  MATH  Google Scholar 

  15. Spielman, D., Teng, S.H.: Spectral partitioning works: Planar graphs and finite element meshes. In: FOCS, pp. 96–105 (1996)

    Google Scholar 

  16. Weiss, Y.: Segmentation using eigenvectors: A unifying view. In: ICCV (2), pp. 975–982 (1999)

    Google Scholar 

  17. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Proceedings of Advances in Neural Information Processing Systems 14 (2001)

    Google Scholar 

  18. Meyer, C.D., J.S.,: Updating finite markov chains by using techniques of group matrix inversion. J. Statist. Comput. Simulat. 11, 163–181 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  19. Funderlic, R.E., Plemmons, R.J.: Updating lu factorizations for computing stationary distributions. SIAM J. Algebraic Discrete Methods 7(1), 30–42 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  20. Seneta, E.: Sensivity analysis, ergodicity coefficients, and rank-one updates for finite markov chains. Numerical Solutions of Markov Chains, 121–129 (1991)

    Google Scholar 

  21. Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1(1), 36–61 (1991), http://www.ams.org/mathscinet-getitem?mr=92h:60103

    Article  MathSciNet  MATH  Google Scholar 

  22. Golub, G.H., Van Loan, C.F.: Matrix computations, 3rd edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  23. Chandrasekaran, S., Manjunath, B.S., Wang, Y.F., Winkeler, J., Zhang, H.: An eigenspace update algorithm for image analysis. Graph. Models Image Process 59(5), 321–332 (1997)

    Article  Google Scholar 

  24. Kanth, K., Agrawal, D., Singh, A.: Dimensionality reduction for similarity searching in dynamic databases. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, NY, USA, pp. 166–176 (1998)

    Google Scholar 

  25. Brand, M.: Fast online svd revisions for lightweight recommender systems. In: Barbará, D., Kamath, C. (eds.) SDM. SIAM, Philadelphia (2003)

    Google Scholar 

  26. Gu, M., Eisenstat, S.C.: A stable and fast algorithm for updating singular value decomposition. Technical Report YALE/DCS/TR-966, Yale University, New Haven, CT (1993)

    Google Scholar 

  27. Gu, M., Eisenstat, S.: Downdating the singular value decomposition. SIAM Journal on Matrix Analysis and Applications 16(3), 793–810 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  28. Frandsen, G.S., Sankowski, P.: Dynamic normal forms and dynamic characteristic polynomial. Research Series RS-08-2, BRICS, Department of Computer Science, University of Aarhus (2008), http://www.brics.dk/RS/08/2/index.html

  29. Bürgisser, P., Clausen, M., Shokrollahi, M.: Algebraic complexity theory. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 315. Springer, Berlin (1997)

    MATH  Google Scholar 

  30. Bini, D., Pan, V.: Polynomial and Matrix Computations. Birkhäuser (1994)

    Google Scholar 

  31. Eberly, W., Kaltofen, E.: On randomized lanczos algorithms. In: ISSAC 1997: Proceedings of the 1997 international symposium on Symbolic and algebraic com- putation, pp. 176–183. ACM Press, New York (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Aarhus, Denmark

    Gudmund Skovbjerg Frandsen

  2. Warsaw University, Poland and University of Rome ”La Sapienza”, Italy

    Piotr Sankowski

Authors
  1. Gudmund Skovbjerg Frandsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Sankowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Luca Aceto

  2. Department of Computer Science, IT-Parken, University of Aarhus, Åbogade 34, 8200, ÅrhusN, Denmark

    Ivan Damgård

  3. Department of Computer Science, University of Liverpool, Ashton Building, L69 3BX, Liverpool, UK

    Leslie Ann Goldberg

  4. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavik, Iceland

    Magnús M. Halldórsson

  5. Department of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Anna Ingólfsdóttir

  6. Université de Bordeaux-1, LaBRI, 351, Cours de la Libération, 33405, Talence cedex, France

    Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frandsen, G.S., Sankowski, P. (2008). Dynamic Normal Forms and Dynamic Characteristic Polynomial. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70575-8_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70574-1

  • Online ISBN: 978-3-540-70575-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation