{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T14:11:05Z","timestamp":1693404665653},"reference-count":27,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Numerical Linear Algebra App"],"published-print":{"date-parts":[[2021,10]]},"abstract":"Abstract<\/jats:title>We propose an inexact coordinate descent method to solve a consistent equation of the type Ax<\/jats:bold>\u2009=\u2009b<\/jats:bold> where A<\/jats:bold> is a real symmetric and positive semidefinite matrix. The admissible range of inexactitude allows to reduce every multiplication present in the computation to a scaling by a signed power of 2 for the sake of hardware simplification. Although the resulting descent is nonideal, the numerical experiments show that its rate of convergence remains close to that of exact coordinate descent, whether the coordinate selection is cyclic or random. Meanwhile, our algorithm outperforms both methods with an additional low complexity \u201cweak greedy\u201d selection of the coordinates, also based on scaling by signed powers of 2. Our method is based on an advanced use of varying relaxation coefficients in the Gauss\u2013Seidel iteration, with special theoretical considerations when A<\/jats:bold> is singular.<\/jats:p>","DOI":"10.1002\/nla.2377","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T10:36:41Z","timestamp":1616755001000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coarse\u2010arithmetic coordinate descent for the resolution of\u00a0semidefinite linear systems"],"prefix":"10.1002","volume":"28","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-6797-2811","authenticated-orcid":false,"given":"Nguyen T.","family":"Thao","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering City College of New York New York City New York USA"}]},{"given":"Dominik","family":"Rzepka","sequence":"additional","affiliation":[{"name":"Department of Measurement and Electronics AGH University of Science and Technology Krak\u00f3w Poland"}]}],"member":"311","published-online":{"date-parts":[[2021,3,26]]},"reference":[{"key":"e_1_2_5_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"e_1_2_5_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0456"},{"key":"e_1_2_5_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1014425"},{"key":"e_1_2_5_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396365"},{"key":"e_1_2_5_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.022"},{"key":"e_1_2_5_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/120887679"},{"key":"e_1_2_5_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0867-4"},{"key":"e_1_2_5_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2015.10.001"},{"key":"e_1_2_5_10_1","doi-asserted-by":"crossref","unstructured":"HaidarA WuP TomovS DongarraJ. Investigating half precision arithmetic to accelerate dense linear system solvers. Proceedings of the 8th Workshop on Latest Advances in Scalable Algorithms for Large\u2010Scale Systems Denver CO;2017. p. 1\u20138.","DOI":"10.1145\/3148226.3148237"},{"key":"e_1_2_5_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1140819"},{"key":"e_1_2_5_12_1","unstructured":"HighamN PraneshS. Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems. MIMS EPrint 201920;2019."},{"key":"e_1_2_5_13_1","volume-title":"Delta\u2010sigma data converters: theory, design, and simulation","author":"Schreier R","year":"1997"},{"issue":"1","key":"e_1_2_5_14_1","first-page":"212","article-title":"Design of hardware efficient FIR filter: a review of the state\u2010of\u2010the\u2010art approaches","volume":"19","author":"Chandra A","year":"2016","journal-title":"Eng Sci Technol Int J"},{"key":"e_1_2_5_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7983-4"},{"key":"e_1_2_5_16_1","doi-asserted-by":"crossref","unstructured":"VolderJ. The CORDIC computing technique. Papers presented at the Proceedings of the 1959 Western Joint Computer Conference San Francisco CA; March 3\u20105 1959. p. 257\u201361.","DOI":"10.1145\/1457838.1457886"},{"key":"e_1_2_5_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2009.2025803"},{"key":"e_1_2_5_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19530330410"},{"key":"e_1_2_5_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28483-5"},{"key":"e_1_2_5_20_1","volume-title":"Relaxation methods","author":"Allen DNdG","year":"1954"},{"key":"e_1_2_5_21_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-037-2"},{"key":"e_1_2_5_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.04.052"},{"key":"e_1_2_5_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-016-0829-7"},{"key":"e_1_2_5_24_1","unstructured":"NutiniJ SepehryB LaradjiI SchmidtM KoepkeH ViraniA. Convergence rates for greedy Kaczmarz algorithms and faster randomized Kaczmarz rules using the orthogonality graph. Proceedings of the 32nd Conference on Uncertainty in Artiffcial Intelligence. AUAI Jersey City NJ;2016. p. 547\u201356."},{"key":"e_1_2_5_25_1","volume-title":"Computational methods of linear algebra","author":"Faddeev DK","year":"1963"},{"key":"e_1_2_5_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1956.1086325"},{"key":"e_1_2_5_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.678470"},{"key":"e_1_2_5_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2237"}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.2377","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/nla.2377","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.2377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T21:55:56Z","timestamp":1693346156000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nla.2377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["10.1002\/nla.2377"],"URL":"https:\/\/doi.org\/10.1002\/nla.2377","archive":["Portico"],"relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"assertion":[{"value":"2020-02-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}