{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T12:33:58Z","timestamp":1781354038177,"version":"3.54.1"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,7,21]],"date-time":"2013-07-21T00:00:00Z","timestamp":1374364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2013,7,21]]},"abstract":"<jats:p>\n            We present a new multi-level preconditioning scheme for discrete Poisson equations that arise in various computer graphics applications such as colorization, edge-preserving decomposition for two-dimensional images, and geodesic distances and diffusion on three-dimensional meshes. Our approach interleaves the selection of fine-and coarse-level variables with the removal of weak connections between potential fine-level variables (\n            <jats:italic>sparsification<\/jats:italic>\n            ) and the\n            <jats:italic>compensation<\/jats:italic>\n            for these changes by strengthening nearby connections. By applying these operations before each elimination step and repeating the procedure recursively on the resulting smaller systems, we obtain a highly efficient multi-level preconditioning scheme with linear time and memory requirements. Our experiments demonstrate that our new scheme outperforms or is comparable with other state-of-the-art methods, both in terms of operation count and wall-clock time. This speedup is achieved by the new method's ability to reduce the condition number of irregular Laplacian matrices as well as homogeneous systems. It can therefore be used for a wide variety of computational photography problems, as well as several 3D mesh processing tasks, without the need to carefully match the algorithm to the problem characteristics.\n          <\/jats:p>","DOI":"10.1145\/2461912.2461992","type":"journal-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:45Z","timestamp":1373998005000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":98,"title":["Efficient preconditioning of laplacian matrices for computer graphics"],"prefix":"10.1145","volume":"32","author":[{"given":"Dilip","family":"Krishnan","sequence":"first","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raanan","family":"Fattal","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Szeliski","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,7,21]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827503430138"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0902035"},{"key":"e_1_2_2_3_1","article-title":"A comparison of eigensolvers for large-scale 3D modal analysis using amg-preconditioned iterative methods. Int","author":"Arbenz P.","year":"2003","unstructured":"Arbenz , P. , Hetmanuik , U. , Lehoucq , R. , and Tuminaro , R. 2003 . A comparison of eigensolvers for large-scale 3D modal analysis using amg-preconditioned iterative methods. Int . Journal for Numerical Methods in Engg. 1. Arbenz, P., Hetmanuik, U., Lehoucq, R., and Tuminaro, R. 2003. A comparison of eigensolvers for large-scale 3D modal analysis using amg-preconditioned iterative methods. Int. Journal for Numerical Methods in Engg. 1.","journal-title":"Journal for Numerical Methods in Engg. 1."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-010-0390-2"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1731047.1731048"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1201775.882364"},{"key":"e_1_2_2_7_1","unstructured":"Boman E. G. and Hendrickson B. 2001. On spanning tree preconditioners. Sandia National Labs.  Boman E. G. and Hendrickson B. 2001. On spanning tree preconditioners. Sandia National Labs ."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801390637"},{"key":"e_1_2_2_9_1","unstructured":"Bouwmeester H. Dougherty A. and Knyazev A. V. 2012. Nonsymmetric multigrid preconditioning for conjugate gradient methods. arXiv preprint arXiv:1212.6680.  Bouwmeester H. Dougherty A. and Knyazev A. V. 2012. Nonsymmetric multigrid preconditioning for conjugate gradient methods. arXiv preprint arXiv:1212.6680 ."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/090752973"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0118663"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(86)90095-0"},{"key":"e_1_2_2_13_1","volume-title":"Multiscale scientific computation: Review","author":"Brandt A.","year":"2001","unstructured":"Brandt , A. 2001. Multiscale scientific computation: Review 2001 . In Multiscale and Multiresolution Methods, Springer Verlag , 1--96. Brandt, A. 2001. Multiscale scientific computation: Review 2001. In Multiscale and Multiresolution Methods, Springer Verlag, 1--96."},{"key":"e_1_2_2_14_1","first-page":"4","article-title":"Geodesics in heat. ACM Transactions on Graphics (Proc","volume":"31","author":"Crane K.","year":"2012","unstructured":"Crane , K. , Weischedel , C. , and Wardetzky , M. 2012 . Geodesics in heat. ACM Transactions on Graphics (Proc . SIGGRAPH) 31 , 4 (July). Crane, K., Weischedel, C., and Wardetzky, M. 2012. Geodesics in heat. ACM Transactions on Graphics (Proc. SIGGRAPH) 31, 4 (July).","journal-title":"SIGGRAPH)"},{"key":"e_1_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Davis T. A. 2006. Direct Methods for Sparse Linear Systems. SIAM.   Davis T. A. 2006. Direct Methods for Sparse Linear Systems . SIAM.","DOI":"10.1137\/1.9780898718881"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360666"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024209"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566573"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576246.1531328"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882368"},{"key":"e_1_2_2_21_1","volume-title":"Matrix computation","author":"Golub G.","unstructured":"Golub , G. , and Van Loan , C. F. 1996. Matrix computation , third edition. The John Hopkins University Press , Baltimore and London. Golub, G., and Van Loan, C. F. 1996. Matrix computation, third edition. The John Hopkins University Press, Baltimore and London."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360620"},{"key":"e_1_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Kelner J. A. Orecchia L. Sidford A. and Zhu Z. A. 2013. A simple combinatorial algorithm for solving SDD systems in nearly-linear time. arXiv preprint arXiv:1301.6628.  Kelner J. A. Orecchia L. Sidford A. and Zhu Z. A. 2013. A simple combinatorial algorithm for solving SDD systems in nearly-linear time. arXiv preprint arXiv:1301.6628 .","DOI":"10.1145\/2488608.2488724"},{"key":"e_1_2_2_24_1","unstructured":"Kincaid D. and Cheney W. 1991. Numerical analysis: mathematics of scientific computing. Brooks\/Cole Publishing Co. Pacific Grove CA USA.   Kincaid D. and Cheney W. 1991. Numerical analysis: mathematics of scientific computing . Brooks\/Cole Publishing Co. Pacific Grove CA USA."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.29"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2011.05.013"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.85"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024211"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.147"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015780"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of CVPR.","author":"Levin A.","unstructured":"Levin , A. , Rav-Acha , A. , and Lischinski , D . 2007. Spectral matting . Proceedings of CVPR. Levin, A., Rav-Acha, A., and Lischinski, D. 2007. Spectral matting. Proceedings of CVPR."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0716027"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1141936"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01061.x"},{"key":"e_1_2_2_35_1","unstructured":"Livne O. and Brandt A. 2011. Lean algebraic multigrid (LAMG): Fast graph laplacian solver. arXiv:1108.0123v1.  Livne O. and Brandt A. 2011. Lean algebraic multigrid (LAMG): Fast graph laplacian solver. arXiv:1108.0123v1 ."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1998.5911"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882269"},{"key":"e_1_2_2_38_1","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Y.","unstructured":"Saad , Y. 2003. Iterative Methods for Sparse Linear Systems , second ed. Society for Industrial and Applied Mathematics . Saad, Y. 2003. Iterative Methods for Sparse Linear Systems, second ed. Society for Industrial and Applied Mathematics."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1142001"},{"key":"e_1_2_2_40_1","volume-title":"-H","author":"Spielman D. A.","year":"2006","unstructured":"Spielman , D. A. , and Teng , S . -H . 2006 . Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. CoRR abs\/cs\/0607105. Spielman, D. A., and Teng, S.-H. 2006. Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. CoRR abs\/cs\/0607105."},{"key":"e_1_2_2_41_1","volume-title":"Proceedings of the International Congress of Mathematicians (ICM).","author":"Spielman D., A.","year":"2010","unstructured":"Spielman , D., A. 2010 . Algorithms, graph theory and linear equations in Laplacian matrices . Proceedings of the International Congress of Mathematicians (ICM). Spielman, D., A. 2010. Algorithms, graph theory and linear equations in Laplacian matrices. Proceedings of the International Congress of Mathematicians (ICM)."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015721"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.56188"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1142005"},{"key":"e_1_2_2_45_1","unstructured":"Trottenberg U. Oosterlee C. and Schuller A. 2001. Multigrid. Academic Press.   Trottenberg U. Oosterlee C. and Schuller A. 2001. Multigrid . Academic Press."},{"key":"e_1_2_2_46_1","volume-title":"Department of Computer Science","author":"Vaidya P.","unstructured":"Vaidya , P. 1990. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Tech. rep ., Department of Computer Science , University of Illinois at Urbana-Champaign , Urbana, IL . Vaidya, P. 1990. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Tech. rep., Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238511"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.21136\/AM.1995.134274"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1661412.1618464"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01389538"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(90)90252-U"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1731047.1731054"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2461912.2461992","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2461912.2461992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:49Z","timestamp":1750235749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2461912.2461992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,21]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7,21]]}},"alternative-id":["10.1145\/2461912.2461992"],"URL":"https:\/\/doi.org\/10.1145\/2461912.2461992","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,21]]},"assertion":[{"value":"2013-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}