{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:27:49Z","timestamp":1725485269840},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437864"},{"type":"electronic","value":"9783540480518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48051-x_30","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T16:49:55Z","timestamp":1179506995000},"page":"297-306","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Two-Sided Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking"],"prefix":"10.1007","author":[{"given":"Isak","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Bo","family":"K\u00e5gstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"E. Anderson, Z. Bai, J. Demmel, J. Dongarra, J. DuCroz, A. Greenbaum, S. Hammarling, A. McKenny, S. Ostrouchov, and D. Sorensen LAPACK Users Guide, Third Edition. SIAM Publications, 1999.","DOI":"10.1137\/1.9780898719604"},{"issue":"9","key":"30_CR2","first-page":"820","volume":"15","author":"R.H. Bartels","year":"1972","unstructured":"R.H. Bartels and G.W. Stewart. Algorithm 432: Solution of the Equation AX + XB = C, Comm. ACM, 15(9):820\u2013826, 1972.","journal-title":"Algorithm 432: Solution of the Equation AX + XB = C, Comm. ACM"},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1145\/332242.332244","volume":"25","author":"K. Dackland","year":"1999","unstructured":"K. Dackland and B. K\u00e5gstr\u00f6m. Blocked Algorithms and Software for Reduction of a Regular Matrix Pair to Generalized Schur Form. ACM Trans. Math. Software, Vol. 25, No. 4, 425\u2013454, 1999.","journal-title":"ACM Trans. Math. Software"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/146847.146929","volume":"18","author":"J.D. Gardiner","year":"1992","unstructured":"J.D. Gardiner, A.J. Laub, J.J. Amato, and C.B. Moler. Solution of the Sylvester Matrix Equation AXBt + CXDt = E, ACM Trans. Math. Software, 18:223\u2013231, 1992.","journal-title":"ACM Trans. Math. Software"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/146847.146930","volume":"18","author":"J.D. Gardiner","year":"1992","unstructured":"J.D. Gardiner, M.R. Wette, A.J. Laub, J.J. Amato, and C.B. Moler. A Fortran 77 Software Package for Solving the Sylvester Matrix Equation AXBt t + CXDt = E, ACM Trans. Math. Software, 18:232\u2013238, 1992.","journal-title":"ACM Trans. Math. Software"},{"issue":"6","key":"30_CR6","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/TAC.1979.1102170","volume":"AC-24","author":"G. Golub","year":"1979","unstructured":"G. Golub, S. Nash, and C. Van Loan. A Hessenberg-Schur Method for the Matrix Problem AX + XB = C. IEEE Trans. Autom. Contr., AC-24(6):909\u2013913, 1979.","journal-title":"IEEE Trans. Autom. Contr."},{"issue":"6","key":"30_CR7","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1147\/rd.416.0737","volume":"41","author":"F. Gustavson","year":"1997","unstructured":"F. Gustavson. Recursion leads to automatic variable blocking for dense linear algebra. IBM J. Res. Develop, 41(6):737\u2013755, November 1997.","journal-title":"IBM J. Res. Develop"},{"key":"30_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BFb0095337","volume-title":"Applied Parallel Computing, PARA\u201998","author":"F. Gustavson","year":"1998","unstructured":"F. Gustavson, A. Henriksson, I. Jonsson, B. K\u00e5gstr\u00f6m and P. Ling. Recursive Blocked Data Formats and BLAS\u2019s for Dense Linear Algebra Algorithms. In K\u00e5gstr\u00f6m et al. (eds), Applied Parallel Computing, PARA\u201998, Lecture Notes in Computer Science, Vol. 1541, pp 195\u2013206, Springer-Verlag, 1998."},{"key":"30_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-70734-4_10","volume-title":"Applied Parallel Computing: New Paradigms for HPC Industry and Academia","author":"I. Jonsson","year":"2001","unstructured":"I. Jonsson and B. K\u00e5gstr\u00f6m. Parallel Triangular Sylvester-type Matrix Equation Solvers for SMP Systems using Recursive Blocking, in Applied Parallel Computing: New Paradigms for HPC Industry and Academia, Lecture Notes in Computer Science, vol. 1947, pp 64\u201374, Springer Verlag, 2001."},{"key":"30_CR10","unstructured":"I. Jonsson and B. K\u00e5gstr\u00f6m. Recursive Blocked Algorithms for Solving Triangular Matrix Equations\u2014Part I: One-Sided and Coupled Sylvester-Type Equations, Report UMINF 01.05, Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden, 2001. Also published as SLICOT Working Note 2001-4. (submitted to ACM TOMS)"},{"key":"30_CR11","unstructured":"I. Jonsson and B. K\u00e5gstr\u00f6m. Recursive Blocked Algorithms for Solving Triangular Matrix Equations\u2014Part II: Two-Sided and Generalized Sylvester and Lyapunov Equations, Report UMINF 01.06, Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden, 2001. Also published as SLICOT Working Note 2001-5. (submitted to A CM TOMS)"},{"issue":"1","key":"30_CR12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/0613009","volume":"13","author":"B. K\u00e5gstr\u00f6m","year":"1992","unstructured":"B. K\u00e5gstr\u00f6m and P. Poromaa. Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with sep\u22121 Estimator. SIAM Journal on Matrix Analysis and Application, 13(1):90\u2013101, January 1992.","journal-title":"SIAM Journal on Matrix Analysis and Application"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"B. K\u00e5gstr\u00f6m and P. Poromaa. LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation between Regular Matrix Pairs. A CM Trans. Math. Software, 22(1):78\u2013103, March 1996.","DOI":"10.1145\/225545.225552"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02142813","volume":"12","author":"B. K\u00e5gstr\u00f6m","year":"1996","unstructured":"B. K\u00e5gstr\u00f6m and P. Poromaa. Computing Eigenspaces with Specified Eigenvalues of a Regular Matrix Pair (A, B) and Condition Estimation: Theory, Algorithms and Software. Numerical Algorithms, 12:369\u2013407, 1996.","journal-title":"Numerical Algorithms"},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1109\/9.29404","volume":"34","author":"B. K\u00e5gstr\u00f6m","year":"1989","unstructured":"B. K\u00e5gstr\u00f6m and L. Westin. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. IEEE Trans. Autom. Contr., 34(4):745\u2013751, 1989.","journal-title":"IEEE Trans. Autom. Contr."},{"key":"30_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/BFb0095366","volume-title":"Applied Parallel Computing, PARA\u201998","author":"P. Poromaa","year":"1998","unstructured":"P. Poromaa. Parallel Algorithms for Triangular Sylvester Equations: Design, Scheduling and Scalability Issues. In K\u00e5gstr\u00f6m et al. (eds), Applied Parallel Computing, PARA\u201998, Lecture Notes in Computer Science, Vol. 1541, pp 438\u2013446, Springer-Verlag, 1998."},{"key":"30_CR17","unstructured":"SLICOT library and the Numerics in Control Network (NICONET) website: http:\/\/www.win.tue.nl\/niconet\/index.html"},{"key":"30_CR18","unstructured":"G.W. Stewart and J-G. Sun. Matrix Perturbation Theory. Academic Press, 1990."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48051-X_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:45:17Z","timestamp":1556426717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48051-X_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437864","9783540480518"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48051-x_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}