{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T07:11:58Z","timestamp":1686467518341},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput. Visual Sci."],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00791-011-0163-7","type":"journal-article","created":{"date-parts":[[2011,11,19]],"date-time":"2011-11-19T08:48:25Z","timestamp":1321692505000},"page":"51-65","source":"Crossref","is-referenced-by-count":0,"title":["Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method"],"prefix":"10.1007","volume":"14","author":[{"given":"Hans","family":"De Sterck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Killian","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"163_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-11521-2","volume-title":"Stochastic Petri Nets","author":"F. Bause","year":"1996","unstructured":"Bause F., Kritzinger P.: Stochastic Petri Nets. Springer, Germany (1996)"},{"key":"163_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"2006","unstructured":"Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, New Jersey (2006)","edition":"3"},{"key":"163_CR3","volume-title":"Nonnegative Matrices in the Mathematical Sciences","author":"A. Berman","year":"1987","unstructured":"Berman A., Plemmons R.J.: Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia, PA (1987)"},{"key":"163_CR4","volume-title":"Introduction to Linear Optimization","author":"D. Bertsimas","year":"1997","unstructured":"Bertsimas D., Tsitisklis J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont, MA (1997)"},{"issue":"6","key":"163_CR5","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","volume":"29","author":"R.G. Bland","year":"1981","unstructured":"Bland R.G., Goldfarb D., Todd M.J.: The ellipsoid method: a survey. Oper. Res. 29(6), 1039\u20131091 (1981)","journal-title":"Oper. Res."},{"key":"163_CR6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1137\/0916002","volume":"16","author":"A. Brandt","year":"1995","unstructured":"Brandt A., Mikulinsky V.: On recombining iterants in multigrid algorithms and problems with small islands. SIAM J. Sci. Comput. 16, 20\u201328 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"163_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719505","volume-title":"A Multigrid Tutorial","author":"W.L. Briggs","year":"2000","unstructured":"Briggs W.L., Henson V.E., McCormick S.F.: A Multigrid Tutorial, 2nd edn. SIAM, Philadelphia, PA (2000)","edition":"2"},{"issue":"2","key":"163_CR8","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/S0895479898342419","volume":"22","author":"P. Buchholz","year":"2000","unstructured":"Buchholz P.: Multilevel solutions for structured Markov chains. SIAM J. Matrix Anal. Appl. 22(2), 342\u2013357 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"163_CR9","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1145\/3828.214137","volume":"32","author":"W.L. Cao","year":"1985","unstructured":"Cao W.L., Stewart W.J.: Iterative aggregation\/disaggregation techniques for nearly uncoupled Markov chains. JACM 32(3), 702\u2013719 (1985)","journal-title":"JACM"},{"key":"163_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0024-3795(82)90242-7","volume":"43","author":"F. Chatelin","year":"1982","unstructured":"Chatelin F., Miranker W.L.: Acceleration by aggregation of successive approximation methods. Linear Algebra Appl. 43, 17\u201347 (1982)","journal-title":"Linear Algebra Appl."},{"key":"163_CR11","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1137\/080719157","volume":"32","author":"H. De Sterck","year":"2010","unstructured":"Sterck H., Manteuffel T., McCormick S.F., Miller K., Pearson J., Ruge J., Sanders G.: Smoothed aggregation multigrid for Markov chains. SIAM J. Sci. Comput. 32, 40\u201361 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"163_CR12","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/090753589","volume":"32","author":"H. De Sterck","year":"2010","unstructured":"Sterck H., Manteuffel T., McCormick S.F., Miller K., Ruge J., Sanders G.: Algebraic multigrid for Markov chains. SIAM J. Sci. Comput. 32, 544\u2013562 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"163_CR13","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1137\/070685142","volume":"30","author":"H. De Sterck","year":"2008","unstructured":"Sterck H., Manteuffel T., McCormick S.F., Nguyen Q., Ruge J.: Multilevel adaptive aggregation for Markov chains, with application to web ranking. SIAM J. Sci. Comput. 30, 2235\u20132262 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"163_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10444-010-9168-x","volume":"35","author":"H. De Sterck","year":"2010","unstructured":"De Sterck H., Manteuffel T., Miller K., Sanders G.: Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains. Adv. Comput. Math. 35, 375\u2013403 (2010)","journal-title":"Adv. Comput. Math."},{"issue":"3","key":"163_CR15","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1137\/090770114","volume":"32","author":"H. De Sterck","year":"2010","unstructured":"Sterck H., Miller K., Sanders G., Winlaw M.: Recursively accelerated multilevel aggregation for Markov chains. SIAM J. Sci. Comput. 32(3), 1652\u20131671 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"163_CR16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BFb0121078","volume":"25","author":"S.T. Dziuban","year":"1985","unstructured":"Dziuban S.T., Ecker J.G., Kupferschmid M.: Using deep cuts in an ellipsoid algorithm for nonlinear programming. Math. Program. Stud. 25, 93\u2013107 (1985)","journal-title":"Math. Program. Stud."},{"key":"163_CR17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02591966","volume":"27","author":"J.G. Ecker","year":"1983","unstructured":"Ecker J.G., Kupferschmid M.: An ellipsoid algorithm for nonlinear programming. Math. Program. 27, 83\u2013106 (1983)","journal-title":"Math. Program."},{"key":"163_CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01582060","volume":"63","author":"J.B.G. Frenk","year":"1994","unstructured":"Frenk J.B.G., Gromicho J., Zhang S.: A deep cut ellipsoid algorithm for convex programming: theory and applications. Math. Program. 63, 83\u2013108 (1994)","journal-title":"Math. Program."},{"key":"163_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01583776","volume":"23","author":"D. Goldfarb","year":"1982","unstructured":"Goldfarb D., Todd M.J.: Modifications and implementation of the ellipsoid algorithm for linear programming. Math. Program. 23, 1\u201319 (1982)","journal-title":"Math. Program."},{"issue":"5","key":"163_CR20","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1287\/opre.33.5.1107","volume":"33","author":"W. Grassmann","year":"1985","unstructured":"Grassmann W., Taksar M., Heyman D.: Regenerative analysis and steady-state distributions for Markov chains. Oper. Res. 33(5), 1107\u20131116 (1985)","journal-title":"Oper. Res."},{"issue":"4","key":"163_CR21","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/0724062","volume":"24","author":"M. Haviv","year":"1987","unstructured":"Haviv M.: Aggregation\/disaggregation methods for computing the stationary distribution of Markov chains. SIAM J. Numer. Anal. 24(4), 952\u2013966 (1987)","journal-title":"SIAM J. Numer. Anal."},{"key":"163_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn R.A., Johnson C.R.: Matrix Analysis. Cambridge University Press, New York, NY (1985)"},{"key":"163_CR23","doi-asserted-by":"crossref","unstructured":"Horton, G., Leutenegger, S.T.: A multi-level solution algorithm for steady-state Markov chains. In: Proceedings of the 1994 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 191\u2013200 (1994)","DOI":"10.1145\/183019.183040"},{"key":"163_CR24","first-page":"3","volume":"13","author":"D.B. Iudin","year":"1976","unstructured":"Iudin D.B., Nemirovskii A.S.: Informational complexity and effective methods of solution for convex extremal problems. Matekon Transl. Russ. East Eur. Math. Econ. 13, 3\u201325 (1976)","journal-title":"Matekon Transl. Russ. East Eur. Math. Econ."},{"key":"163_CR25","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1976","unstructured":"Khachiyan L.G.: A polynomial algorithm in linear programming. Sov. Math. Doklady 20, 191\u2013194 (1976)","journal-title":"Sov. Math. Doklady"},{"issue":"2","key":"163_CR26","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/0605019","volume":"5","author":"J.R. Koury","year":"1984","unstructured":"Koury J.R., McAllister D.F., Stewart W.J.: Iterative methods for computing stationary distributions of nearly completely decomposable Markov chains. SIAM J. Alg. Disc. Meth. 5(2), 164\u2013186 (1984)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"163_CR27","first-page":"403","volume-title":"Numerical Solution of Markov Chains","author":"U.R. Krieger","year":"1995","unstructured":"Krieger U.R.: Numerical solution of large finite Markov chains by algebraic multigrid techniques. In: Stewart, W. (eds) Numerical Solution of Markov Chains, pp. 403\u2013424. Kluwer, Dordrecht (1995)"},{"key":"163_CR28","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0024-3795(95)00166-O","volume":"223\u2013224","author":"U.R. Krieger","year":"1995","unstructured":"Krieger U.R.: On a two-level multigrid solution method for Markov chains. Linear Algebra Appl. 223\u2013224, 415\u2013438 (1995)","journal-title":"Linear Algebra Appl."},{"key":"163_CR29","doi-asserted-by":"crossref","unstructured":"Leutenegger, S.T., Horton, G.: On the utility of the multi-level algorithm for the solution of nearly completely decomposable Markov chains. Tech. Rep. 94-44, ICASE (1994)","DOI":"10.1007\/978-1-4615-2241-6_24"},{"issue":"3","key":"163_CR30","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/moor.10.3.515","volume":"10","author":"H.-J. L\u00fcthi","year":"1985","unstructured":"L\u00fcthi H.-J.: On the solution of variational inequalities by the ellipsoid method. Math. Oper. Res. 10(3), 515\u2013522 (1985)","journal-title":"Math. Oper. Res."},{"key":"163_CR31","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0024-3795(83)90157-X","volume":"51","author":"J. Mandel","year":"1983","unstructured":"Mandel J., Sekerka B.: A local convergence proof for the iterative aggregation method. Linear Algebra Appl. 51, 163\u2013172 (1983)","journal-title":"Linear Algebra Appl."},{"key":"163_CR32","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/(SICI)1099-1506(199807\/08)5:4<253::AID-NLA124>3.0.CO;2-B","volume":"5","author":"I. Marek","year":"1998","unstructured":"Marek I., Mayer P.: Convergence analysis of an iterative aggregation\/disaggregation method for computing stationary probability vectors of stochastic matrices. Numer. Linear Algebra Appl. 5, 253\u2013274 (1998)","journal-title":"Numer. Linear Algebra Appl."},{"key":"163_CR33","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0024-3795(02)00333-6","volume":"363","author":"I. Marek","year":"2003","unstructured":"Marek I., Mayer P.: Convergence theory of some classes of iterative aggregation\/disaggregation methods for computing stationary probability vectors of stochastic matrices. Linear Algebra Appl. 363, 177\u2013200 (2003)","journal-title":"Linear Algebra Appl."},{"key":"163_CR34","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TC.1982.1676110","volume":"C-31","author":"M.K. Molloy","year":"1982","unstructured":"Molloy M.K.: IEEE Trans. Comput. C-31, 913\u2013917 (1982)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"163_CR35","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1287\/opre.40.6.1156","volume":"40","author":"B. Philippe","year":"1992","unstructured":"Philippe B., Saad Y., Stewart W.J.: Numerical methods in Markov chain modeling. Oper. Res. 40(6), 1156\u20131179 (1992)","journal-title":"Oper. Res."},{"key":"163_CR36","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, New Jersey (1970)"},{"key":"163_CR37","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01071394","volume":"13","author":"N.Z. Shor","year":"1977","unstructured":"Shor N.Z.: Cut-off method with space extension in convex programming problems. Cybernetics 13, 94\u201396 (1977)","journal-title":"Cybernetics"},{"key":"163_CR38","doi-asserted-by":"crossref","first-page":"111","DOI":"10.2307\/1909285","volume":"29","author":"H.A. Simon","year":"1961","unstructured":"Simon H.A., Ando A.: Aggregation of variables in dynamic systems. Econometrica 29, 111\u2013138 (1961)","journal-title":"Econometrica"},{"key":"163_CR39","volume-title":"An Introduction to the Numerical Solution of Markov Chains","author":"W.J. Stewart","year":"1994","unstructured":"Stewart W.J.: An Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton, NJ (1994)"},{"key":"163_CR40","unstructured":"Takahashi, Y.: A lumping method for numerical calculations of stationary distributions of Markov chains. Tech. Rep. B-18, Department of Information Sciences, Tokyo Institute of Technology (1975)"},{"key":"163_CR41","doi-asserted-by":"crossref","first-page":"2927","DOI":"10.1137\/100799034","volume":"33","author":"E. Treister","year":"2011","unstructured":"Treister E., Yavneh I.: On-the-fly adaptive smoothed aggregation for Markov chains. SISC 33, 2927\u20132949 (2011)","journal-title":"SISC"},{"key":"163_CR42","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/nla.708","volume":"17","author":"E. Treister","year":"2010","unstructured":"Treister E., Yavneh I.: Square and stretch multigrid for stochastic matrix eigenproblems. Numer. Linear Algebr. 17, 229\u2013251 (2010)","journal-title":"Numer. Linear Algebr."},{"key":"163_CR43","volume-title":"Multigrid","author":"U. Trottenberg","year":"2001","unstructured":"Trottenberg U., Oosterlee C.W., Sch\u00fcller A.: Multigrid. Elsevier Academic Press, San Diego, California (2001)"},{"key":"163_CR44","first-page":"271","volume":"6","author":"T. Washio","year":"1997","unstructured":"Washio T., Oosterlee C.W.: Krylov subspace acceleration for nonlinear multigrid schemes. Electron. Trans. Numer. Anal. 6, 271\u2013290 (1997)","journal-title":"Electron. Trans. Numer. Anal."}],"container-title":["Computing and Visualization in Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00791-011-0163-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00791-011-0163-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00791-011-0163-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T06:38:13Z","timestamp":1686465493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00791-011-0163-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s00791-011-0163-7","relation":{},"ISSN":["1432-9360","1433-0369"],"issn-type":[{"value":"1432-9360","type":"print"},{"value":"1433-0369","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}