{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:39:38Z","timestamp":1740166778852,"version":"3.37.3"},"reference-count":25,"publisher":"Walter de Gruyter GmbH","issue":"2","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1418889"],"award-info":[{"award-number":["DMS-1418889"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["SOLHAR (ANR-13-MONU-0007)"],"award-info":[{"award-number":["SOLHAR (ANR-13-MONU-0007)"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We introduce a class of preconditioners for general sparse matrices based\non the Birkhoff\u2013von Neumann decomposition of doubly stochastic matrices.\nThese preconditioners are aimed primarily at solving challenging linear\nsystems with highly unstructured and indefinite coefficient matrices.\nWe present some theoretical results and numerical experiments on\nlinear systems from a variety of applications.<\/jats:p>","DOI":"10.1515\/cmam-2016-0040","type":"journal-article","created":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T10:04:22Z","timestamp":1481709862000},"page":"201-215","source":"Crossref","is-referenced-by-count":2,"title":["Preconditioning Techniques Based on the Birkhoff\u2013von Neumann Decomposition"],"prefix":"10.1515","volume":"17","author":[{"given":"Michele","family":"Benzi","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Emory University, Atlanta, USA"}]},{"given":"Bora","family":"U\u00e7ar","sequence":"additional","affiliation":[{"name":"LIP, UMR5668 (CNRS \u2013 ENS Lyon \u2013 UCBL \u2013 Universit\u00e9 de Lyon \u2013 INRIA), Lyon, France"}]}],"member":"374","published-online":{"date-parts":[[2016,12,14]]},"reference":[{"key":"2023033114222305256_j_cmam-2016-0040_ref_001_w2aab3b7d896b1b6b1ab2b1b1Aa","doi-asserted-by":"crossref","unstructured":"Amestoy P. R., Duff I. S., Ruiz D. and U\u00e7ar B.,\nA parallel matrix scaling algorithm,\nHigh Performance Computing for Computational Science \u2013 VECPAR 2008,\nLecture Notes in Comput. Sci. 5336,\nSpringer, Berlin (2008), 301\u2013313.","DOI":"10.1007\/978-3-540-92859-1_27"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_002_w2aab3b7d896b1b6b1ab2b1b2Aa","doi-asserted-by":"crossref","unstructured":"Anzt H., Chow E. and Dongarra J.,\nIterative sparse triangular solves for preconditioning,\nEuro-Par 2015: Parallel Processing,\nLecture Notes in Comput. Sci. 9233,\nSpringer, Berlin (2015), 650\u2013651.","DOI":"10.1007\/978-3-662-48096-0_50"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_003_w2aab3b7d896b1b6b1ab2b1b3Aa","doi-asserted-by":"crossref","unstructured":"Benzi M., Haws J. C. and Tuma M.,\nPreconditioning highly indefinite and nonsymmetric matrices,\nSIAM J. Sci. Comput. 22 (2000), no. 4, 1333\u20131353.","DOI":"10.1137\/S1064827599361308"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_004_w2aab3b7d896b1b6b1ab2b1b4Aa","unstructured":"Birkhoff G.,\nTres observaciones sobre el algebra lineal,\nUniv. Nac. Tucum\u00e1n Rev. Ser. A 5 (1946), 147\u2013150."},{"key":"2023033114222305256_j_cmam-2016-0040_ref_005_w2aab3b7d896b1b6b1ab2b1b5Aa","doi-asserted-by":"crossref","unstructured":"Brualdi R. A.,\nNotes on the Birkhoff algorithm for doubly stochastic matrices,\nCanad.Math. Bull. 25 (1982), no. 2, 191\u2013199.","DOI":"10.4153\/CMB-1982-026-3"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_006_w2aab3b7d896b1b6b1ab2b1b6Aa","doi-asserted-by":"crossref","unstructured":"Brualdi R. A. and Gibson P. M.,\nConvex polyhedra of doubly stochastic matrices. I: Applications of the permanent function,\nJ. Combin. Theory Ser. A 22 (1977), no. 2, 194\u2013230.","DOI":"10.1016\/0097-3165(77)90051-6"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_007_w2aab3b7d896b1b6b1ab2b1b7Aa","doi-asserted-by":"crossref","unstructured":"Brualdi R. A. and Ryser H. J.,\nCombinatorial Matrix Theory,\nEncyclopedia Math. Appl. 39,\nCambridge University Press, Cambridge, 1991.","DOI":"10.1017\/CBO9781107325708"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_008_w2aab3b7d896b1b6b1ab2b1b8Aa","doi-asserted-by":"crossref","unstructured":"Burkard R., Dell\u2019Amico M. and Martello S.,\nAssignment Problems,\nSIAM, Philadelphia, 2009.","DOI":"10.1137\/1.9780898717754"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_009_w2aab3b7d896b1b6b1ab2b1b9Aa","doi-asserted-by":"crossref","unstructured":"Chow E. and Patel A.,\nFine-grained parallel incomplete LU factorization,\nSIAM J. Sci. Comput. 37 (2015), no. 2, C169\u2013C193.","DOI":"10.1137\/140968896"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_010_w2aab3b7d896b1b6b1ab2b1c10Aa","doi-asserted-by":"crossref","unstructured":"Davis T. A. and Hu Y.,\nThe University of Florida sparse matrix collection,\nACM Trans. Math. Software 38 (2011), 10.1145\/2049662.2049663.","DOI":"10.1145\/2049662.2049663"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_011_w2aab3b7d896b1b6b1ab2b1c11Aa","doi-asserted-by":"crossref","unstructured":"Dolan E. D. and Mor\u00e9 J. J.,\nBenchmarking optimization software with performance profiles,\nMath. Program. 91 (2002), no. 2, 201\u2013213.","DOI":"10.1007\/s101070100263"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_012_w2aab3b7d896b1b6b1ab2b1c12Aa","doi-asserted-by":"crossref","unstructured":"Duff I. S., Erisman A. M. and Reid J. K.,\nDirect Methods for Sparse Matrices, 2nd ed.,\nOxford University Press, Oxford, 2017.","DOI":"10.1093\/acprof:oso\/9780198508380.001.0001"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_013_w2aab3b7d896b1b6b1ab2b1c13Aa","doi-asserted-by":"crossref","unstructured":"Duff I. S. and Koster J.,\nThe design and use of algorithms for permuting large entries to the diagonal of sparse matrices,\nSIAM J. Matrix Anal. Appl. 20 (1999), no. 4, 889\u2013901.","DOI":"10.1137\/S0895479897317661"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_014_w2aab3b7d896b1b6b1ab2b1c14Aa","doi-asserted-by":"crossref","unstructured":"Duff I. S. and Koster J.,\nOn algorithms for permuting large entries to the diagonal of a sparse matrix,\nSIAM J. Matrix Anal. Appl. 22 (2001), 973\u2013996.","DOI":"10.1137\/S0895479899358443"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_015_w2aab3b7d896b1b6b1ab2b1c15Aa","doi-asserted-by":"crossref","unstructured":"Dufoss\u00e9 F. and U\u00e7ar B.,\nNotes on Birkhoff\u2013von Neumann decomposition of doubly stochastic matrices,\nLinear Algebra Appl. 497 (2016), 108\u2013115.","DOI":"10.1016\/j.laa.2016.02.023"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_016_w2aab3b7d896b1b6b1ab2b1c16Aa","doi-asserted-by":"crossref","unstructured":"Gabow H. N. and Tarjan R. E.,\nAlgorithms for two bottleneck optimization problems,\nJ. Algorithms 9 (1988), no. 3, 411\u2013417.","DOI":"10.1016\/0196-6774(88)90031-4"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_017_w2aab3b7d896b1b6b1ab2b1c17Aa","unstructured":"Gantmacher F. R.,\nThe Theory of Matrices. Vol. 2,\nChelsea Publishing, New York, 1959."},{"key":"2023033114222305256_j_cmam-2016-0040_ref_018_w2aab3b7d896b1b6b1ab2b1c18Aa","doi-asserted-by":"crossref","unstructured":"Halappanavar M., Pothen A., Azad A., Manne F., Langguth J. and Khan A. M.,\nCodesign lessons learned from implementing graph matching on multithreaded architectures,\nIEEE Computer 48 (2015), no. 8, 46\u201355.","DOI":"10.1109\/MC.2015.215"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_019_w2aab3b7d896b1b6b1ab2b1c19Aa","unstructured":"Horn R. A. and Johnson C. R.,\nMatrix Analysis, 2nd ed.,\nCambridge University, Cambridge, 2013."},{"key":"2023033114222305256_j_cmam-2016-0040_ref_020_w2aab3b7d896b1b6b1ab2b1c20Aa","doi-asserted-by":"crossref","unstructured":"Knight P. A. and Ruiz D.,\nA fast algorithm for matrix balancing,\nIMA J. Numer. Anal. 33 (2013), no. 3, 1029\u20131047.","DOI":"10.1093\/imanum\/drs019"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_021_w2aab3b7d896b1b6b1ab2b1c21Aa","doi-asserted-by":"crossref","unstructured":"Knight P. A., Ruiz D. and U\u00e7ar B.,\nA symmetry preserving algorithm for matrix scaling,\nSIAM J. Matrix Anal. Appl. 35 (2014), no. 3, 931\u2013955.","DOI":"10.1137\/110825753"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_022_w2aab3b7d896b1b6b1ab2b1c22Aa","doi-asserted-by":"crossref","unstructured":"Manguoglu M., Koyut\u00fcrk M., Sameh A. H. and Grama A.,\nWeighted matrix ordering and parallel banded preconditioners for iterative linear system solvers,\nSIAM J. Sci. Comput. 32 (2010), no. 3, 1201\u20131216.","DOI":"10.1137\/080713409"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_023_w2aab3b7d896b1b6b1ab2b1c23Aa","doi-asserted-by":"crossref","unstructured":"Saad Y.,\nA flexible inner-outer preconditioned GMRES algorithm,\nSIAM J. Sci. Comput. 14 (1993), no. 2, 461\u2013469.","DOI":"10.1137\/0914028"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_024_w2aab3b7d896b1b6b1ab2b1c24Aa","doi-asserted-by":"crossref","unstructured":"Sinkhorn R. and Knopp P.,\nConcerning nonnegative matrices and doubly stochastic matrices,\nPacific J. Math. 21 (1967), 343\u2013348.","DOI":"10.2140\/pjm.1967.21.343"},{"key":"2023033114222305256_j_cmam-2016-0040_ref_025_w2aab3b7d896b1b6b1ab2b1c25Aa","doi-asserted-by":"crossref","unstructured":"Varga R. S.,\nMatrix Iterative Analysis, 2nd ed.,\nSpringer, Berlin, 2000.","DOI":"10.1007\/978-3-642-05156-2"}],"container-title":["Computational Methods in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/cmam\/17\/2\/article-p201.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2016-0040\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2016-0040\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T20:38:25Z","timestamp":1680295105000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2016-0040\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,14]]},"references-count":25,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,1,10]]},"published-print":{"date-parts":[[2017,4,1]]}},"alternative-id":["10.1515\/cmam-2016-0040"],"URL":"https:\/\/doi.org\/10.1515\/cmam-2016-0040","relation":{},"ISSN":["1609-9389","1609-4840"],"issn-type":[{"type":"electronic","value":"1609-9389"},{"type":"print","value":"1609-4840"}],"subject":[],"published":{"date-parts":[[2016,12,14]]}}}