{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:56:27Z","timestamp":1742964987651,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_36","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"434-446","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Normal Forms and Dynamic Characteristic Polynomial"],"prefix":"10.1007","author":[{"given":"Gudmund Skovbjerg","family":"Frandsen","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"36_CR1","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/S0097539793252687","volume":"24","author":"M. Giesbrecht","year":"1995","unstructured":"Giesbrecht, M.: Nearly optimal algorithms for canonical matrix forms. SIAM Journal on Computing\u00a024(5), 948\u2013969 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR2","unstructured":"Eberly, W.: Asymptotically efficient algorithms for the Frobenius form. Paper 723-26, Department of Computer Science, University of Calgary (2003)"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-57201-2_30","volume-title":"The Third International Workshop on Computer Algebra in Scientific Computing","author":"G. Villard","year":"2000","unstructured":"Villard, G.: Computing the Frobenius normal form of a sparse matrix. In: The Third International Workshop on Computer Algebra in Scientific Computing, pp. 395\u2013407. Springer, Heidelberg (2000)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Storjohann, A.: Deterministic computation of the frobenius form. In: FOCS, pp. 368\u2013377 (2001)","DOI":"10.1109\/SFCS.2001.959911"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/146637.146666","volume":"39","author":"A. Ben-Amram","year":"1992","unstructured":"Ben-Amram, A., Galil, Z.: On pointers versus addresses. J. Assoc. Comput. Mach.\u00a039, 617\u2013648 (1992)","journal-title":"J. Assoc. Comput. Mach."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013516. ACM Press, New York (1999)","DOI":"10.1145\/301250.301389"},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1006\/inco.2001.3046","volume":"171","author":"G. Frandsen","year":"2001","unstructured":"Frandsen, G., Hansen, J., Miltersen, P.: Lower bounds for dynamic algebraic problems. Inform. and Comput.\u00a0171(2), 333\u2013349 (2001)","journal-title":"Inform. and Comput."},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11786986_35","volume-title":"Automata, Languages and Programming","author":"P. Frandsen","year":"2006","unstructured":"Frandsen, P., Frandsen, G.: Dynamic matrix rank. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 395\u2013406. Springer, Berlin (2006)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Sankowski, P.: Dynamic Transitive Closure via Dynamic Matrix Inverse. In: FOCS, pp. 509\u2013517 (2004)","DOI":"10.1109\/FOCS.2004.25"},{"issue":"4-5","key":"36_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0020-0190(80)90042-3","volume":"11","author":"O. Ibarra","year":"1980","unstructured":"Ibarra, O., Moran, S., Rosier, L.: A note on the parallel complexity of computing the rank of order n matrices. Inform. Process. Lett.\u00a011(4-5), 162 (1980)","journal-title":"Inform. Process. Lett."},{"key":"36_CR11","first-page":"338","volume-title":"STOC","author":"K. Mulmuley","year":"1986","unstructured":"Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. In: STOC, pp. 338\u2013339. ACM Press, New York (1986)"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, vol.\u00a092. American Mathematical Society (1997)","DOI":"10.1090\/cbms\/092"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013324 (1982)","DOI":"10.1145\/800070.802206"},{"issue":"98","key":"36_CR14","first-page":"289","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal\u00a023(98), 289\u2013305 (1973)","journal-title":"Czechoslovak Mathematical Journal"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Spielman, D., Teng, S.H.: Spectral partitioning works: Planar graphs and finite element meshes. In: FOCS, pp. 96\u2013105 (1996)","DOI":"10.1109\/SFCS.1996.548468"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Weiss, Y.: Segmentation using eigenvectors: A unifying view. In: ICCV (2), pp. 975\u2013982 (1999)","DOI":"10.1109\/ICCV.1999.790354"},{"key":"36_CR17","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Proceedings of Advances in Neural Information Processing Systems 14 (2001)"},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/00949658008810405","volume":"11","author":"C.D. Meyer","year":"1980","unstructured":"Meyer, C.D., J.S.,: Updating finite markov chains by using techniques of group matrix inversion. J. Statist. Comput. Simulat.\u00a011, 163\u2013181 (1980)","journal-title":"J. Statist. Comput. Simulat."},{"issue":"1","key":"36_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0607004","volume":"7","author":"R.E. Funderlic","year":"1986","unstructured":"Funderlic, R.E., Plemmons, R.J.: Updating lu factorizations for computing stationary distributions. SIAM J. Algebraic Discrete Methods\u00a07(1), 30\u201342 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Seneta, E.: Sensivity analysis, ergodicity coefficients, and rank-one updates for finite markov chains. Numerical Solutions of Markov Chains, 121\u2013129 (1991)","DOI":"10.1201\/9781003210160-7"},{"issue":"1","key":"36_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1214\/aoap\/1177005980","volume":"1","author":"P. Diaconis","year":"1991","unstructured":"Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab.\u00a01(1), 36\u201361 (1991), http:\/\/www.ams.org\/mathscinet-getitem?mr=92h:60103","journal-title":"Ann. Appl. Probab."},{"key":"36_CR22","series-title":"Johns Hopkins Studies in the Mathematical Sciences","volume-title":"Matrix computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix computations, 3rd edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"issue":"5","key":"36_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1006\/gmip.1997.0425","volume":"59","author":"S. Chandrasekaran","year":"1997","unstructured":"Chandrasekaran, S., Manjunath, B.S., Wang, Y.F., Winkeler, J., Zhang, H.: An eigenspace update algorithm for image analysis. Graph. Models Image Process\u00a059(5), 321\u2013332 (1997)","journal-title":"Graph. Models Image Process"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"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\u2013176 (1998)","DOI":"10.1145\/276305.276320"},{"key":"36_CR25","volume-title":"SDM","author":"M. Brand","year":"2003","unstructured":"Brand, M.: Fast online svd revisions for lightweight recommender systems. In: Barbar\u00e1, D., Kamath, C. (eds.) SDM. SIAM, Philadelphia (2003)"},{"key":"36_CR26","unstructured":"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)"},{"issue":"3","key":"36_CR27","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/S0895479893251472","volume":"16","author":"M. Gu","year":"1995","unstructured":"Gu, M., Eisenstat, S.: Downdating the singular value decomposition. SIAM Journal on Matrix Analysis and Applications\u00a016(3), 793\u2013810 (1995)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"36_CR28","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.7146\/brics.v15i2.21937"},{"key":"36_CR29","series-title":"Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic complexity theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.: Algebraic complexity theory. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol.\u00a0315. Springer, Berlin (1997)"},{"key":"36_CR30","doi-asserted-by":"crossref","unstructured":"Bini, D., Pan, V.: Polynomial and Matrix Computations. Birkh\u00e4user (1994)","DOI":"10.1007\/978-1-4612-0265-3"},{"key":"36_CR31","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1145\/258726.258776","volume-title":"ISSAC 1997: Proceedings of the 1997 international symposium on Symbolic and algebraic com- putation","author":"W. Eberly","year":"1997","unstructured":"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\u2013183. ACM Press, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:13:06Z","timestamp":1738325586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}