{"entities":{"Q1179256":{"pageid":1190005,"ns":120,"title":"Item:Q1179256","lastrevid":69812676,"modified":"2026-04-13T09:33:30Z","type":"item","id":"Q1179256","labels":{"en":{"language":"en","value":"A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 24156"}},"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":"Q1179256$A09814FE-23C5-445D-92B5-FF49914E14F5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"60748373b8a269e6bc5ca8e391ec320a98db383e","datavalue":{"value":{"text":"A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1179256$E6220695-776B-4F9D-B980-CA423577649C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"bf8be42775d90fdffdd866d2a8ceda2fd0b181c7","datavalue":{"value":"0737.65036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1179256$717A6BB3-826B-4CF0-9141-4922C369B396","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"41775119c1838ef46d630eadf7d2c4cbf9dad880","datavalue":{"value":"10.1016/S0167-8191(05)80156-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1179256$286F979C-3B7A-4C09-9A50-9BB035AAB510","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c7cb105ac78ef7534c6d14979cb22dfa99a3e052","datavalue":{"value":{"entity-type":"item","numeric-id":273238,"id":"Q273238"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1179256$4345431D-2215-498C-A2B7-E4F189843473","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":"Q1179256$6525F7AC-FB89-4016-BD8F-08617ADAAAAD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1422b5e3113eee9dc98f0455d275631058399b8b","datavalue":{"value":{"time":"+1992-06-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1179256$733F53F2-8886-4C93-91A1-2DCC35D9688A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"dfaaf493dd7da3f90a5bf8e6961ac4ba6c3015de","datavalue":{"value":"The author presents a parallel algorithm to calculate only the leftmost \\(p\\) eigenpairs of finite element matrices with very large dimensions. It is shown that the vectorized algorithm achieves an average speed up 3.34 with respect to the best scalar code. The parallel version improves this average speed up by factors 1.72, 2.24, 2.63 with two, three and four processors, respectively. The result suggests that the proposed method ranks among the most efficient parallel algorithms.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1179256$41CFCE59-03BD-499C-9D1B-C9FCB8F7440F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1fd405649af5a3f9a37557a0bd816920cbf1d33b","datavalue":{"value":"65F15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1179256$E0188CBC-A044-4650-A228-0D128FA7D54E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1179256$A50A9B7C-6900-4E38-B1B8-27E4184947ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0493e66c36e2772f355d1d5e05f0013b3d870be0","datavalue":{"value":"65N30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1179256$7A112CC5-9973-478D-9AF0-1B7FF6B623A8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"15edbb65c23312ec2a62b4a11321efd28f8b3e55","datavalue":{"value":"24156","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1179256$9E6B3344-8A3C-450A-90C8-47EDE6A9F90B","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f657133a9655bdb6e343ee2c4f858a9b8ab95311","datavalue":{"value":"sparse symmetric matrices","type":"string"},"datatype":"string"},"type":"statement","id":"Q1179256$AED8E9B9-3C6F-4C33-8DD6-EF12BA6C7B9B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0967c5f93d36d6aa18ee008d77ee288965d952b9","datavalue":{"value":"parallel algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1179256$9B3EAFF1-FE09-4518-BC08-B6733CD056F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0dedb6eb4dd736ba80b414090e97d2f1545f9cb5","datavalue":{"value":"eigenpairs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1179256$A52CA912-E07D-4A34-9BC2-133B122035C9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7a6c5a9ba9a33e2bef5241d9d4c64938887fd32a","datavalue":{"value":"finite element matrices","type":"string"},"datatype":"string"},"type":"statement","id":"Q1179256$1C7D6C2B-356D-4E73-8537-CE2240DA66E8","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"f1c10ca51927327a0cb11a16c267ef3a6ea02fb2","datavalue":{"value":{"entity-type":"item","numeric-id":587121,"id":"Q587121"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1179256$3C2702F6-EF6D-4DAE-AE9F-46BD815084A9","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":"Q1179256$6616C9E6-202D-4552-A570-527C19EC4E11","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8fec3ab753b963faf3ad32723c17c5e3d94267d3","datavalue":{"value":{"entity-type":"item","numeric-id":4308482,"id":"Q4308482"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"edd218526e0437bd8139d2238aa45666cf24b873","datavalue":{"value":{"amount":"+0.8461295962333679","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":"Q1179256$437E182C-378B-459E-B369-CDF1587D6559","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2af37da570cfb3b2bcc8c690776e5b67e2d89d1f","datavalue":{"value":{"entity-type":"item","numeric-id":3327619,"id":"Q3327619"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"cd8751f0621f3e4f2130637f692ad7f915783471","datavalue":{"value":{"amount":"+0.8247153759002686","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":"Q1179256$E5D35E4E-8075-4B3B-87BC-D7FDF4A0543E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"557e3714896f8012c9db4cd1ceb7817805dc23be","datavalue":{"value":{"entity-type":"item","numeric-id":4513083,"id":"Q4513083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5a879685933e88e02d9193ababb9a628d2d4117c","datavalue":{"value":{"amount":"+0.8215529918670654","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":"Q1179256$29F2D237-CBAB-4BD7-BD97-B89BF4D24302","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ac17d20bf7b352c2e18ecc65a3d445347875a634","datavalue":{"value":{"entity-type":"item","numeric-id":4763756,"id":"Q4763756"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fb6be0b08bd49d696d0d95620b4a923ff7d224a2","datavalue":{"value":{"amount":"+0.8168570399284363","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":"Q1179256$D340303A-737A-480C-881E-97A937149807","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_parallel_algorithm_for_the_partial_eigensolution_of_sparse_symmetric_matrices_on_the_CRAY_Y-MP"}}}}}