{"entities":{"Q6992068":{"pageid":21455412,"ns":120,"title":"Item:Q6992068","lastrevid":76379841,"modified":"2026-04-23T21:20:56Z","type":"item","id":"Q6992068","labels":{"en":{"language":"en","value":"Inertial randomized Kaczmarz algorithms for solving coherent linear systems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8032126"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6992068$961CFBA3-305D-49C0-B1AA-C0C82FCBED88","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"078a463134ef7f21a7a9cdaca731294539e054eb","datavalue":{"value":{"text":"Inertial randomized Kaczmarz algorithms for solving coherent linear systems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6992068$CC939B57-AB55-4109-9E03-B711CCBEAB53","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a4015eb0d678fcb100b418ae9ce85f3140c145aa","datavalue":{"value":"1566.65072","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6992068$EC96F7A5-C6B9-464E-A739-9D90E9197E3F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"647159213097d1d70ab3f80636a674b74842cdd9","datavalue":{"value":"10.1007/S11075-024-01872-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6992068$11F1ED09-5209-4E90-BBB9-2E3A5C6804B0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"45bffcbf9a7f7d9f82a5654e872b40d5b3837cf8","datavalue":{"value":{"entity-type":"item","numeric-id":260145,"id":"Q260145"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6992068$9B936483-5CBE-4771-B253-BA6CF7ACB6EA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"13366f47499755b977703dd7b77dec11df9a7d1a","datavalue":{"value":{"entity-type":"item","numeric-id":199387,"id":"Q199387"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6992068$3CD518FD-A5CD-43B9-95A7-4D32D2F2CC45","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5621f4397601dff488bc1babb544ae454a767dc3","datavalue":{"value":{"entity-type":"item","numeric-id":287939,"id":"Q287939"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6992068$27837FF4-A6F2-421C-B1E0-17D564C56443","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"95f4a47752e6dde2f4d6f910dcba94ba8b5377c0","datavalue":{"value":{"entity-type":"item","numeric-id":57895,"id":"Q57895"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6992068$A3F20FA2-19E4-4790-8AEE-B6BA86CD9FBB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"52dd936f8c0ddb15003e967ef13d55cbe84b4cbe","datavalue":{"value":{"time":"+2025-04-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6992068$FB122723-B4D4-45F0-B82F-0EECF7663436","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"995677131b1e17e9640ebd8cfe68f72e9af2fd75","datavalue":{"value":"This paper is about an alternated inertial randomized Kaczmarz (AIRK) algorithm, an iterative method for solving a consistent linear system \\(Ax=b\\) with \\(A\\in\\mathbb{R}^{I\\times J}\\) and full row rank. The classical method has the form \\(x^{k+1}=\\Psi(x^k)\\) where in the original algorithm [\\textit{S. Kaczmarz}, Bull. Int. Acad. Polon. Sci. A 1937, 355--357 (1937; Zbl 0017.31703)] \\(\\Psi\\) is a projection on the hyperplane \\(H_{i_k}\\) defined by a cyclically selected equation \\(i_k\\) of the system. In the randomized version, the selection of \\(i_k\\) is random. In the two-subspace Kaczmarz (TSK) method of [\\textit{D. Needell} and \\textit{R. Ward}, J. Fourier Anal. Appl. 19, No. 2, 256--269 (2013; Zbl 1306.65190)] two different rows \\(i_k,j_k\\) are randomly selected according to an optimal probability and orthogonalization is used in order to reduce correlation. In the inertial version, the update is based on 2 previous steps: \\(x^{k+1}=\\Psi(x^k+\\alpha_k(x^k-x^{k-1}))\\) for reasonable scalars \\(\\alpha_k\\), that can be optimized to speed up convergence which results in a practical iteration formula. It is shown that the proposed AIRK is equivalent with the TSK method, but with a better error estimate under mild conditions. The two indices per iteration explain the `alternated' in its name. In a multistep version (MIRK), \\(j_k\\) is replaced by \\(i_{k-1}\\) and an optimal parameter is used to minimize the error for every choice of \\(i_k\\) (hence no alternation). Several numerical examples illustrate the performance for the different methods.\\N\\NThe paper is quite accessible introducing the successive complications step by step.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6992068$469E662C-5429-4F06-BACF-F363E44346D4","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"fc8a96e7da0a25d97c6c3415d8dffbc5c07a46e1","datavalue":{"value":{"entity-type":"item","numeric-id":283199,"id":"Q283199"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6992068$7D2D6277-D0EC-41A8-A180-1C36879BE121","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9e4257514d9fd4eac10996fc6305328b84fd9c9b","datavalue":{"value":"65F10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6992068$ECA7510C-7494-43D7-A2DA-19423F56F585","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6992068$769CA7E7-C0B7-405E-BFA9-9FB6C14AFFC0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7eaebf519890cb84e1334f48e9fea1a86143af49","datavalue":{"value":"8032126","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6992068$4F7A69D1-D10D-413E-9E1F-950D5C94DC02","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8a07c23f5abc33d12c9862a35ffaad43996df153","datavalue":{"value":"system of linear equations","type":"string"},"datatype":"string"},"type":"statement","id":"Q6992068$4D1AA985-A9CC-4E0D-9437-B75DEAF377C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eb609d234890d33bee8ff8c08019437498dd0b4a","datavalue":{"value":"iterative method","type":"string"},"datatype":"string"},"type":"statement","id":"Q6992068$F9A23F9B-C6DA-47ED-BB77-4274AF9901F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"832729107652997c1e1ca553a8ed4521e0070396","datavalue":{"value":"randomized Kaczmarz algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6992068$8E1E147F-240E-4083-8026-604C7FCDFAA1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c97e11f5f7654a4769faaf0378f9ad797f822152","datavalue":{"value":"inertial randomized Kaczmarz algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6992068$743332D4-1456-4AD6-B2C1-D2842703D6B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"471a606f515cc48b2e928d57785e03f3ce8ccee8","datavalue":{"value":"inertial extrapolation","type":"string"},"datatype":"string"},"type":"statement","id":"Q6992068$ED0B1995-71CC-4941-B657-7FC10DB6B696","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"58ec9cf38020181c4f441ef1e8426b1aaa953848","datavalue":{"value":"two-subspace Kaczmarz method","type":"string"},"datatype":"string"},"type":"statement","id":"Q6992068$8D95805C-0928-4B8E-859A-8ED31DA3FEC7","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6992068$C77FB631-AC2D-4BD2-A1D6-32DEE9574F46","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Inertial randomized Kaczmarz algorithms for solving coherent linear systems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Inertial_randomized_Kaczmarz_algorithms_for_solving_coherent_linear_systems"}}}}}