{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:23:21Z","timestamp":1725564201373},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152733"},{"type":"electronic","value":"9783642152740"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15274-0_16","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T14:17:34Z","timestamp":1283609854000},"page":"194-202","source":"Crossref","is-referenced-by-count":7,"title":["Fast Generalized Bruhat Decomposition"],"prefix":"10.1007","author":[{"given":"Gennadi","family":"Malaschonok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","first-page":"393","volume":"23","author":"D. Grigoriev","year":"1981","unstructured":"Grigoriev, D.: Analogy of Bruhat decomposition for the closure of a cone of Chevalley group of a classical serie. Soviet Math. Dokl.\u00a023(2), 393\u2013397 (1981)","journal-title":"Soviet Math. Dokl."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(82)90014-7","volume":"19","author":"D. Grigoriev","year":"1982","unstructured":"Grigoriev, D.: Additive complexity in directed computations. Theoretical Computer Science\u00a019, 39\u201367 (1982)","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","first-page":"5","volume":"202","author":"L.Y. Kolotilina","year":"1992","unstructured":"Kolotilina, L.Y.: Sparsity of Bruhat decomposition factors of nonsingular matrices. Notes of Scientific Seminars of LOMI\u00a0202, 5\u201317 (1992)","journal-title":"Notes of Scientific Seminars of LOMI"},{"key":"16_CR4","first-page":"421","volume":"2","author":"L.Y. Kolotilina","year":"1987","unstructured":"Kolotilina, L.Y., Yemin, A.Y.: Bruhat decomposition and solution of linear algebraic systems with sparse matrices. Sov. J. Numer. Anal. and Math. Model.\u00a02, 421\u2013436 (1987)","journal-title":"Sov. J. Numer. Anal. and Math. Model."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian Eelimination is not optimal. Numerische Mathematik\u00a013, 354\u2013356 (1969)","journal-title":"Numerische Mathematik"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-662-04166-6_48","volume-title":"Formal Power Series and Algebraic Combinatorics","author":"G.I. Malaschonok","year":"2000","unstructured":"Malaschonok, G.I.: Effective matrix methods in commutative domains. In: Formal Power Series and Algebraic Combinatorics, pp. 506\u2013517. Springer, Berlin (2000)"},{"key":"16_CR7","volume-title":"Matrix Computational Methods in Commutative Rings","author":"G.I. Malaschonok","year":"2002","unstructured":"Malaschonok, G.I.: Matrix Computational Methods in Commutative Rings. Tambov State University, Tambov (2002)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11758525_65","volume-title":"Computational Science \u2013 ICCS 2006","author":"A. Akritas","year":"2006","unstructured":"Akritas, A., Malaschonok, G.: Computation of adjoint matrix. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol.\u00a03992, pp. 486\u2013489. Springer, Heidelberg (2006)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1090\/S0025-5718-1974-0331751-8","volume":"28","author":"J. Bunch","year":"1974","unstructured":"Bunch, J., Hopkroft, J.: Triangular factorization and inversion by fast matrix multiplication. Mat. Comp.\u00a028, 231\u2013236 (1974)","journal-title":"Mat. Comp."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Watt, S.M.: Pivot-free block matrix inversion. In: Maple Conf. 2006, Waterloo, Canada, July 23-26 (2006), http:\/\/www.csd.uwo.ca\/~watt\/pub\/reprints\/2006-mc-bminv-poster.pdf","DOI":"10.1109\/SYNASC.2006.61"},{"key":"16_CR11","first-page":"151","volume-title":"Proc. 8th International Symposium on Symbolic and Numeric Algorithms in Symbolic Computation (SYNASC)","author":"S.M. Watt","year":"2006","unstructured":"Watt, S.M.: Pivot-free block matrix inversion. In: Proc. 8th International Symposium on Symbolic and Numeric Algorithms in Symbolic Computation (SYNASC), pp. 151\u2013155. IEEE Computer Society, Los Alamitos (2006)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Eberly, W.: Efficient parallel independent subsets and matrix factorization. In: Proc. 3rd IEEE Symposium on Parallel and Distributed Processing, Dallas, USA, pp. 204\u2013211 (1991)","DOI":"10.1109\/SPDP.1991.218278"},{"key":"16_CR13","first-page":"180","volume-title":"Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures","author":"E. Kaltofen","year":"1991","unstructured":"Kaltofen, E., Pan, V.: Processor-efficient parallel solution of linear systems over an abstract field. In: Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 180\u2013191. ACM Press, New York (1991)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Pan, V.: Processor-efficient parallel solution of linear systems II: The general case. In: Proc. 33rd IEEE Symposium on Foundations of Computer Science, Pittsburgh, USA, pp. 714\u2013723 (1992)","DOI":"10.1109\/SFCS.1992.267779"},{"key":"16_CR15","first-page":"225","volume-title":"Proc. PASCO 1994: First International Symposium on Parallel Symbolic Computation","author":"E. Kaltofen","year":"1994","unstructured":"Kaltofen, E., Pan, V.: Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic. In: Proc. PASCO 1994: First International Symposium on Parallel Symbolic Computation, pp. 225\u2013233. World Scientific Publishing, Singapore (1994)"},{"key":"16_CR16","first-page":"44","volume-title":"Proc. Conference Dedicated to the 75 Years of the Mathematical and Physical Dept. of Tambov State University","author":"G.I. Malaschonok","year":"2005","unstructured":"Malaschonok, G.I.: Parallel Algorithms of Computer Algebra. In: Proc. Conference Dedicated to the 75 Years of the Mathematical and Physical Dept. of Tambov State University, November 22-24, pp. 44\u201356. Tambov State Univ., Tambov (2005)"},{"key":"16_CR17","first-page":"58","volume-title":"11th Conf. \u201cDerzhavinskie Chteniya\u201d","author":"G.I. Malaschonok","year":"2006","unstructured":"Malaschonok, G.I., Zuyev, M.S.: Generalized algorithm for computing of inverse matrix. In: 11th Conf. \u201cDerzhavinskie Chteniya\u201d, February 2-6, pp. 58\u201362. Tambov State Univ., Tambov (2006)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15274-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:46:40Z","timestamp":1559576800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15274-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152733","9783642152740"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15274-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}