{"entities":{"Q1919366":{"pageid":1930108,"ns":120,"title":"Item:Q1919366","lastrevid":69301194,"modified":"2026-04-13T06:05:36Z","type":"item","id":"Q1919366","labels":{"en":{"language":"en","value":"A distributed memory algorithm for 3-D FFTs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 908317"}},"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":"Q1919366$715312A2-2BC0-4EA3-968C-67AFCA854F77","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f5e205acf8797c2a3810727fbc1503ac081ff4e9","datavalue":{"value":{"text":"A distributed memory algorithm for 3-D FFTs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1919366$854C424B-6976-4CA4-86F5-EC2106E74648","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9b66fa8453ed34424227bf5fd2f7af90cb5944e3","datavalue":{"value":"0855.65147","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1919366$28D1F47A-9AE7-4098-B40D-61B64A484DB2","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b55cd53c972714365a767cb0f203f72a1fe2399e","datavalue":{"value":"10.1016/0377-0427(95)00163-8","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1919366$CF66ACCC-E8A3-4396-B18A-FC4E6A97ECDE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3027dfd91b4cffcb63ce2bad30f807c6dd49e4b0","datavalue":{"value":{"entity-type":"item","numeric-id":1919365,"id":"Q1919365"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1919366$1CAD81CD-DBB7-4CFD-908B-16CCA32C2F5B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d22e1efacfb390c244c2e76afc7d579eb699a4ed","datavalue":{"value":{"entity-type":"item","numeric-id":1044704,"id":"Q1044704"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1919366$196F9473-7CA7-4835-B1AB-00F629C989F9","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"9291c21615d62497aa2bb6404791ba4d7844695d","datavalue":{"value":{"entity-type":"item","numeric-id":61355,"id":"Q61355"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1919366$CA343929-DF07-49BE-859C-86E8D5F72F7F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f6a0ba4c979624750ee22089dce20ae30fb4a95f","datavalue":{"value":{"time":"+1997-02-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1919366$3BC487E7-3543-4629-9B24-A95C0D43DB9A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"5cde76c46fa3971d6245134f660401463e66cf83","datavalue":{"value":"This paper proposes an algorithm for the parallel in-place 3-D fast Fourier transform (FFT) on distributed memory architectures. In this algorithm, calculation is done by partitioning the 3-D input tensor into subtensors (one subtensor per nodes). The local FFTs are computed by the divide-and-conquer method, and the results are combined along the data partitioning strategy for minimum communication between nodes. The complexity of this algorithm is discussed in detail.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1919366$C309F459-8DA7-4DA0-916F-0101E14344AE","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"c4603c40f3b09770fdbb70ee2650f252415f25c5","datavalue":{"value":"65T50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1919366$8D015160-0868-4BD8-BF0C-06A410109247","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1919366$A0FD079E-FD0F-43C6-81D8-21A1D84B5A46","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"355ea56a4f84d7973d94c70a8b1f92966ec83542","datavalue":{"value":"65Y20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1919366$2BE2D2E3-D9D6-4804-AD7E-8B3F6EF8C384","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"22853ea404bbad298ce1a783ea36b3cb717d461e","datavalue":{"value":"908317","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1919366$806ED0F5-2BE7-456F-8AC8-D1853B2AB491","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1f081c4d4e99ea7d8d3bdd0ba90a222a7e825014","datavalue":{"value":"parallel in-place algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1919366$D520A943-FA77-470C-97CF-CD1D821AC42B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4780b02cfc7bc35a586062e3271a9f52fa94f067","datavalue":{"value":"complexity analysis","type":"string"},"datatype":"string"},"type":"statement","id":"Q1919366$3F7D5421-42D9-46EB-91A4-C15EBFFA20A8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1328eccdc9de6f1faba0b59107ec6c81584a0b77","datavalue":{"value":"fast Fourier transform","type":"string"},"datatype":"string"},"type":"statement","id":"Q1919366$513253D3-3B12-4FAE-B3AA-FE5A45D259A9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d39144ec7eb17b2485995a0fdf71a036c61cc1c6","datavalue":{"value":"distributed memory architectures","type":"string"},"datatype":"string"},"type":"statement","id":"Q1919366$65D3F313-44EE-4B76-A3AE-14768E9FBE37","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8b59b733f664896a3065c1dc20f83d5752f47317","datavalue":{"value":"divide-and-conquer method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1919366$45ED8434-C989-4AF3-923E-4946C8549EDF","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"de6cbaa12a560d2dc71a3653f8215c89556fe91f","datavalue":{"value":{"entity-type":"item","numeric-id":1112569,"id":"Q1112569"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1919366$E526AD50-6252-40FB-BA0A-2ACD8D9095C8","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":"Q1919366$BD240E3A-6C40-4A3D-B964-08738100E320","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6cfcbeda22ab9606df9c481d2bf0439a400b1958","datavalue":{"value":"https://doi.org/10.1016/0377-0427(95)00163-8","type":"string"},"datatype":"url"},"type":"statement","id":"Q1919366$D02432BC-4DF3-4FF3-95B7-1FBDCB76B3D1","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2b068cc0b980bc90cd2dbd5d0e437c63aed7afe7","datavalue":{"value":"W2129320792","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1919366$AE13EBFD-37AA-41CE-9554-DA2BEE29F66D","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"da29e3097e24a4876211bbf8709f36621b226183","datavalue":{"value":{"entity-type":"item","numeric-id":1195705,"id":"Q1195705"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1919366$5A80479F-769E-4DB9-9BBB-F7A5ED44D441","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"111ca19a076d604e9160f714521075e55bc6120e","datavalue":{"value":{"entity-type":"item","numeric-id":1201720,"id":"Q1201720"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1919366$196A7261-F6C9-4F6A-859B-BF7D8E22A10C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a6fb71337c83350a49bb9a229ef318fe44b0350b","datavalue":{"value":{"entity-type":"item","numeric-id":578884,"id":"Q578884"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1919366$9A29486D-99B6-4FD2-85E8-9C80F0C88B5B","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"897cd9b5b01fd4113432e375e12ae9aa49351648","datavalue":{"value":{"entity-type":"item","numeric-id":1124776,"id":"Q1124776"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4508852a6a9125973745823386af3fdd32b93e0a","datavalue":{"value":{"amount":"+0.8282801508903503","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":"Q1919366$26AA0342-EDE6-4033-8CF9-D43610221EC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7ac158816bf969ea74047a53337f577f0a6a1695","datavalue":{"value":{"entity-type":"item","numeric-id":3124734,"id":"Q3124734"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a8a2c81f67a6c974b2e79eda7cbdc12c1635d3a0","datavalue":{"value":{"amount":"+0.8280754685401917","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":"Q1919366$3A8BD377-6883-4E9E-BE77-D578C7758DCD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"10cb8ef411f93da38ce6d6d717924317e26cfd45","datavalue":{"value":{"entity-type":"item","numeric-id":1819919,"id":"Q1819919"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"238a812768b31c961d48bf234d7912c4eccf71ac","datavalue":{"value":{"amount":"+0.8163073658943176","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":"Q1919366$FAA52CAF-1021-428B-81E2-E0DD44A5FD79","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A distributed memory algorithm for 3-D FFTs","badges":[]}}}}}