{"entities":{"Q1315915":{"pageid":1326665,"ns":120,"title":"Item:Q1315915","lastrevid":77981054,"modified":"2026-05-06T10:30:07Z","type":"item","id":"Q1315915","labels":{"en":{"language":"en","value":"A new efficient parallelization strategy for the \\(QR\\) algorithm"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 516722"}},"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":"Q1315915$A05CEC06-E34A-4C82-B8B5-E2BD81761A9F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1fd1a39bdcf777ce17fda023fe85360efe52992a","datavalue":{"value":{"text":"A new efficient parallelization strategy for the \\(QR\\) algorithm","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1315915$9F18106F-D2D8-4390-BEB6-00067B390845","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"006b62d196890186445b4bdc322d15697b3fd8c5","datavalue":{"value":"0792.65024","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315915$2322655E-0F87-44A4-8EE3-D7105474C00A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c36bbecb95129f4fc7949e0c99101742c1e29fbf","datavalue":{"value":"10.1016/0167-8191(94)90112-0","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315915$5C07FF5E-B368-429A-B5E8-911BB013E11A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"acc3fb073a5dcd5b4c12f7379fa0a47c80f873c0","datavalue":{"value":{"entity-type":"item","numeric-id":1315912,"id":"Q1315912"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315915$C8C0FD2A-2844-4F87-B238-B652C8C9813F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2c5d4a5823e0ea090a018d5145e94b1b8487a97c","datavalue":{"value":{"entity-type":"item","numeric-id":1315914,"id":"Q1315914"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315915$979B75A5-4675-4837-A3D7-5EFA37449CD6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2eadf56c8a51ad688181ecc20ef438cbcd73cb5a","datavalue":{"value":{"entity-type":"item","numeric-id":614118,"id":"Q614118"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315915$9B43564E-B20C-4A54-B614-3408E6227990","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"eeac13f60c55bdb04ecb49274cc7b24a1688345d","datavalue":{"value":{"entity-type":"item","numeric-id":71527,"id":"Q71527"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315915$A4BC36C7-F37F-433D-AC43-0E06BF9FB0FD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bae0a83b7a4957d894839ec0f21ae5de7c84c8c2","datavalue":{"value":{"time":"+1994-07-31T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1315915$A9788CCB-285F-4406-AB48-34EF5768BDD6","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"4f4bd95b394ad8c7b0ba42d68840b945967e010c","datavalue":{"value":"The paper presents a new efficient parallelization for loosely-coupled multiprocessing systems, based upon cyclic reductions, applying the \\(QR\\) algorithm for the calculation of all eigenvalues and all eigenvectors of a tridiagonal Hermitian matrix.   A classic solution for generating a parallel algorithm is based upon a divide and conquer strategy. The proposed algorithm does not employ rank- one modifications and establishes a mapping (team mapping) of the rows of \\(Q\\) onto the existing processes.   The computation of the columns of \\(R\\) is distributed in the same way as the rows of \\(Q\\). Theorem 3.3 proves that by using cyclic reductions and distributing the computation via team mapping, one gains an asymptotically 100\\% efficient parallelization, i.e. the \\(QR\\) algorithm can be divided into many independent processes as a result of cyclic reductions.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$816BAD3C-D0D9-41C0-A695-84EF5D90996D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1fd405649af5a3f9a37557a0bd816920cbf1d33b","datavalue":{"value":"65F15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315915$5C081704-B315-4B7F-B382-33BED9BF5162","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315915$8291DCB2-4B54-4E6D-9319-1677111547D7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9b2f16e171fd48b9aa4a173ac584820a5fe9aa58","datavalue":{"value":"516722","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315915$0EC821CA-F346-4731-8C64-3A0A5001F689","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c97bdbdd924e7956da89a780bead5fed567c30e5","datavalue":{"value":"\\(QR\\) algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$E7AFA8C9-4B5F-4A5A-8121-64423DC6CBDC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e4adb18bcac430f0482b7bf62c08c92b29c5f7df","datavalue":{"value":"parallelization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$9CF16CAE-0E2A-4BD8-979E-5AC9AAA7BC52","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f2319ae31b79b88d2404882d8469b0a6b93dbccc","datavalue":{"value":"multiprocessing systems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$B1195174-0EAC-426F-9869-10B622AD6A9F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"62a42de328dd162493a0cedc29a5850d6667503b","datavalue":{"value":"cyclic reductions","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$A336ED8D-50BE-48B8-A2BE-0FC98F23DAB1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"811604a75801fcd709c8667f83ea26944825b8d2","datavalue":{"value":"eigenvalues","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$0B500A2C-1746-4318-869B-4B56F00CB53B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"52eea320300e07df842062e5b7cf401deee61277","datavalue":{"value":"eigenvectors","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$E252A4A8-A000-4E15-9546-0F85B2627634","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a73287d5107447011e42ec77cbaaa257d2187bd2","datavalue":{"value":"tridiagonal Hermitian matrix","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$6A098522-1411-4745-BA08-075EB8EC9D62","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0967c5f93d36d6aa18ee008d77ee288965d952b9","datavalue":{"value":"parallel algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$4B117BC8-AB6E-484B-A4A4-6002C16C020D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c86b341f46785aed1efe6ac582cad71baa6d623f","datavalue":{"value":"divide and conquer strategy","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$23AB3D18-874D-4958-B808-3D90DEFBC840","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b1d6ea06eb1404a1758487be76a42d328bfb0107","datavalue":{"value":"team mapping","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315915$E7A0E8F9-871A-43A4-B1D5-EB0A97531EAC","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"2f9e16b52bc8c390b9fea0fb31de1975133dd070","datavalue":{"value":{"entity-type":"item","numeric-id":455938,"id":"Q455938"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315915$AB5499EB-FAFF-48D7-A352-EE9DF115FA44","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":"Q1315915$CBC51292-1CFB-4321-B7B8-614CCA8D7838","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"4e965e286a73a6b097899ef6870913e4e07d6185","datavalue":{"value":"https://doi.org/10.1016/0167-8191(94)90112-0","type":"string"},"datatype":"url"},"type":"statement","id":"Q1315915$30F4203A-D572-41C6-B38F-87D131EF7769","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2ee6d45c0df4d869324eccdae23a31aa074ac182","datavalue":{"value":"W2015918525","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315915$B961F9AB-9934-4DBA-BB9E-EA61B848DA0A","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"449c7a8ee5cbd825e15f339da150186fe2f1d9e3","datavalue":{"value":{"entity-type":"item","numeric-id":3983830,"id":"Q3983830"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2244d1cf48819c5726b83d564a52bdd42381abdd","datavalue":{"value":{"amount":"+0.8524278402328491","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315915$60873079-CD34-4BD5-B4A0-35FDF2A5C1C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9734d6263c65c26791ab940cc05643b3508ad729","datavalue":{"value":{"entity-type":"item","numeric-id":4860206,"id":"Q4860206"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2244d1cf48819c5726b83d564a52bdd42381abdd","datavalue":{"value":{"amount":"+0.8524278402328491","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315915$F215AB5B-716B-4EFD-8C1B-34D30D6F7CD3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f92c5a10fdb3247ea4f75d82457dceafa7859fcb","datavalue":{"value":{"entity-type":"item","numeric-id":4261045,"id":"Q4261045"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e7a377359281188a0ce6ebb0592f89c041d05651","datavalue":{"value":{"amount":"+0.8391183018684387","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315915$30C43C73-4FC9-4BF4-891A-F4E9E399A736","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"81587bd2f6208c4bea7aefaae4bbae115d237983","datavalue":{"value":{"entity-type":"item","numeric-id":1893081,"id":"Q1893081"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3b0814ba078d31e5d667a6fadd8ba66a33c0991b","datavalue":{"value":{"amount":"+0.812313437461853","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315915$78AC966E-89AF-4CB3-B601-2ACD189A4546","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"42093a0449936a076330f3119518d66f4c4c1538","datavalue":{"value":{"entity-type":"item","numeric-id":4891738,"id":"Q4891738"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"87542de1b094bcd8e23cddedd4e5967098f301cc","datavalue":{"value":{"amount":"+0.7945654988288879","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315915$3BB0A157-4355-4548-8A06-C633BCE47FDD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A new efficient parallelization strategy for the \\(QR\\) algorithm","badges":[]}}}}}