{"entities":{"Q1402303":{"pageid":1413043,"ns":120,"title":"Item:Q1402303","lastrevid":68844645,"modified":"2026-04-13T02:26:40Z","type":"item","id":"Q1402303","labels":{"en":{"language":"en","value":"Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1967868"}},"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":"Q1402303$C6420488-C667-40E3-B968-CA46F08711CC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"58862afd930f3bacee09c6e9030e669c75e337da","datavalue":{"value":{"text":"Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1402303$B4C4D0DE-5C71-4763-94FA-99AA1E689685","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2767774028029a36dbab48ad3f813e3048db3c72","datavalue":{"value":"1030.65018","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1402303$CB8B898E-D520-4070-8BA5-8E6FB36C434B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"afac2a0cb5a8691f51d164056af966b2e8cf0017","datavalue":{"value":"10.1023/A:1022032830105","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1402303$B8B4EFB3-7FE9-468A-991E-747BA4F0B182","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a0cb1b70b8c10e656d3dd4b3f5e10a7cae35c155","datavalue":{"value":{"entity-type":"item","numeric-id":1395637,"id":"Q1395637"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1402303$B58037BD-C65E-4F0C-AF1F-7D5CDED68510","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"249abb720dacac094ebb61d7e5e8103f75c0ea6e","datavalue":{"value":{"entity-type":"item","numeric-id":165775,"id":"Q165775"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1402303$23875B6B-0494-4CEA-A9E9-9DBA157C524B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ef5551d0bed39d732a1be7431b699cbb7e704fe8","datavalue":{"value":{"time":"+2003-08-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1402303$77EFD817-39F1-4984-86BC-1C2C92B00491","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"b8dc2ed4c7437786b12cf1e0a9d5c204db9dd815","datavalue":{"value":"The problem of finding fill-preserving sparse matrix orderings for parallel factorization is considered. That is, given a large sparse symmetric and positive definite matrix that has been ordered by some fill-reducing ordering, a reordering is determined that is appropriate in terms of preserving the sparsity, and minimizing the cost to perform the Cholesky factorization in parallel. Based on the column task graph, a greedy reording algorithm is devised, and it is proved that the algorithm can find the corresponding optimal ordering among the class of all fill-preserving orderings of the given matrix.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1402303$40211C4F-CB4F-4608-9ADD-1AA20A376F19","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"b66b8f73daeece0054a41db06e7bb7519b2fb73c","datavalue":{"value":{"entity-type":"item","numeric-id":587825,"id":"Q587825"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1402303$55ACD781-2D1C-446E-BCCA-2F5EB979584D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9885aef811aa349f50c28b046ac04fbe99524c67","datavalue":{"value":"65F05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1402303$2B23C120-481B-4F9E-BD79-A7CD79C674C1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bb68a4ead97a966e0738a004317f6777af7ecfa4","datavalue":{"value":"65F50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1402303$75431951-5D6A-4914-A0C9-432B6546246D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1402303$DAA78DC6-B69F-46DB-95BB-593ADB48AFAC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"dfc0da51ff3ed24d18d799bf2ac1ea9f701c06fe","datavalue":{"value":"1967868","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1402303$B53974D0-B911-4F69-A811-C6154EF06AD4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1d9e7608ae869b5a0e353be0ddb7a5e4461ea266","datavalue":{"value":"column task graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q1402303$C4E78CE3-7E25-414A-8073-73B29FDE3E63","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"26d3e33e327c7c20e4a80fc767125a4f24ef4dde","datavalue":{"value":"elimination tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q1402303$8FBA4162-50F0-45E4-ACA7-14AAC54C2D93","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c3f6cc7e1daa44b74287c0347f5b11227e276aea","datavalue":{"value":"sparse matrix ordering","type":"string"},"datatype":"string"},"type":"statement","id":"Q1402303$690642E1-DAA6-4542-8C50-003FE29EA6CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8eec4d2965c491f1233608b19011c3a4408c6aa7","datavalue":{"value":"Cholesky factorizetion","type":"string"},"datatype":"string"},"type":"statement","id":"Q1402303$930E6634-E72E-4043-815A-0C33501F363C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e53027033cae6fbc26744a05040eb76af38465e6","datavalue":{"value":"parallel computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q1402303$D067316B-9EBC-4BBD-87DE-AC180663411E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3df6bd86331c4f112a52d4d647b9c484dff9a0b9","datavalue":{"value":"fill-reducing ordering","type":"string"},"datatype":"string"},"type":"statement","id":"Q1402303$E846EAE3-E4D6-413B-82C5-55BE42DBD307","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":"Q1402303$594C92B3-8F9E-4B1A-9BB6-DD67B96BB510","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3553ab9969993c601494f217f2d025d23bad0244","datavalue":{"value":"https://doi.org/10.1023/a:1022032830105","type":"string"},"datatype":"url"},"type":"statement","id":"Q1402303$1D812623-1BB3-4701-8F88-0C88993D3DA2","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"54aa2b93b87a6099262ab6345f00b738611e7ec0","datavalue":{"value":"W1603047746","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1402303$B2724558-5207-43D8-BD53-16609384DEBB","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fc35f71bf043be7aa9eb8c83325724b042636150","datavalue":{"value":{"entity-type":"item","numeric-id":5317648,"id":"Q5317648"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"616a12a3804f02cde7580287ca0fa29713c2684b","datavalue":{"value":{"amount":"+0.910851776599884","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":"Q1402303$B1510A83-8644-4193-B92F-692585F85943","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"de5eec35ef3e0eb8f13e15abb01eacd1d2d5f740","datavalue":{"value":{"entity-type":"item","numeric-id":2877076,"id":"Q2877076"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a2c5c9cc1f2e0a91193a1725673ac14256fb0748","datavalue":{"value":{"amount":"+0.8872769474983215","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":"Q1402303$2CF7189B-3497-4B47-87F9-B59922F1B961","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"19b6f511b870ec1ba7f3cfad12cccc7925e47300","datavalue":{"value":{"entity-type":"item","numeric-id":3468542,"id":"Q3468542"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fb0df15b443abb6bb00529cd3193edf3535a3260","datavalue":{"value":{"amount":"+0.847027063369751","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":"Q1402303$3F3142FA-5B67-4C82-AB90-30CDE89F34BA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"30483bf2994889340111e38dabfcaabc2814cc5c","datavalue":{"value":{"entity-type":"item","numeric-id":1960600,"id":"Q1960600"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4d6c9adc15a60843bec55409e91e99a3eb874626","datavalue":{"value":{"amount":"+0.8256885409355164","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":"Q1402303$E31979F7-C02A-4FDB-9495-12CDFAA5F90E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ae1988837184beb29638d65c14f52f549da3c742","datavalue":{"value":{"entity-type":"item","numeric-id":1123535,"id":"Q1123535"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b1ad47b0a58c6d95a450401243777f1e0c14c186","datavalue":{"value":{"amount":"+0.8242114782333374","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":"Q1402303$8575679E-47A9-44B9-8741-51C28E4CBA94","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Finding_optimal_ordering_of_sparse_matrices_for_column-oriented_parallel_Cholesky_factorization"}}}}}