{"entities":{"Q809547":{"pageid":811395,"ns":120,"title":"Item:Q809547","lastrevid":42709192,"modified":"2025-07-08T17:34:41Z","type":"item","id":"Q809547","labels":{"en":{"language":"en","value":"Asynchronous polynomial zero-finding algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4213328"}},"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":"Q809547$2D811D5A-BA7C-48CF-AF92-8E48C8C2B7D7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f101101da1100d849d90ff198aa74b840b791de9","datavalue":{"value":{"text":"Asynchronous polynomial zero-finding algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q809547$FEB8F547-A95A-480A-927E-81F64A4A0A41","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"fd0bbe98c6af22d181bde073fd5b4259ab44fd5f","datavalue":{"value":"0733.65029","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$6B02D514-C748-4814-9C6C-D01F575A7D8C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f8eb49488bd9941b19632a75e4afe1c36d5114e4","datavalue":{"value":"10.1016/S0167-8191(05)80057-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$1AF4D50C-9860-4A8A-A47B-5A8A9DC70FA6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b2b4d83dfd8f10e9546054233ffbf0994b90529d","datavalue":{"value":{"entity-type":"item","numeric-id":582812,"id":"Q582812"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q809547$B495A9A8-9B57-476A-AB4C-CD80FFD97391","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"78f417c6e2ec88a1fca63c487f5d44327bb2b5bc","datavalue":{"value":{"entity-type":"item","numeric-id":809546,"id":"Q809546"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q809547$BE5B590C-523A-4624-BC27-8DEDDDFA7930","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":"Q809547$FBE45E49-3144-4130-89FB-47086FBBE177","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"391107ffc7a24346d69c573e292e4ff4587e3aaa","datavalue":{"value":{"time":"+1991-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q809547$F7F0CC6B-F1AC-43F9-A4DC-6F689A3C6DAB","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"76462f9e0d9fca16c4be2bfedb095d91723d3f0c","datavalue":{"value":"The authors prove local convergence theorems for ``partially asynchronous'' modifications of the Durand-Kerner and Ehrlich polynomial zero-finding algorithms, respectively. There is an extensive report on numerical experiments.","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$347ACC35-581F-497E-BD29-3873480C24CA","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f7c34836818ffbea9a518ee3069a773adc88b483","datavalue":{"value":"65H05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$418D3C9C-9E20-4005-B049-F4D9F9474F3C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$348F1D2C-9E66-4861-B438-80B362653C47","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"661c831991cdebd51f9465b74d929024bd00f373","datavalue":{"value":"12Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$B6F765B1-5B0F-4861-81E9-224456D74E8D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8871fa000545a707dc0c8eb8145c5cf9a99c7e40","datavalue":{"value":"30C15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$74712335-153B-40D2-8A35-576772865C4F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"34fbc0192cf2dfe3e020a7ef456e8a399671cbac","datavalue":{"value":"4213328","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$A10DA750-89FD-4327-A35F-365E753FFF45","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7c4728476635c29b9981135e0d20e847545fe437","datavalue":{"value":"Durant-Kerner method","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$994B63B8-E859-4169-9D91-3AEB0052BEE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5ab9c0775b45ab2cf73e6f65218267d86dcaf48b","datavalue":{"value":"Ehrlich method","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$027DC4F6-203C-4494-A2EE-3A036AB9BBC3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bd91f217384c0fbfc3688a7306356b0c6b5b19e9","datavalue":{"value":"asynchronous parallel algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$BF6A1822-50E9-4953-B476-EE725BA13200","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a326a977270078225ad5574e58104f5cc111d2f7","datavalue":{"value":"local memory parallel computers","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$F5D2F33E-2706-471D-81A0-288932A41399","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a23950181aa19bbe32e11d6c0af984179a92857e","datavalue":{"value":"local convergence","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$DC2382C5-C8CA-4321-8D11-0B9B52A39392","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a0b3f87cbffcc47b7744b4b2560a92226ecdc344","datavalue":{"value":"polynomial zero- finding algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$41652EB9-C298-4370-90F3-BD91B22A6587","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4a5ad9ff03b17c8457e1ed84ec13768350695ce6","datavalue":{"value":"numerical experiments","type":"string"},"datatype":"string"},"type":"statement","id":"Q809547$A22DD728-4A6F-4A34-A3C1-9C7E645BDF2D","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"50c5b002328db576cff4507098fa22c99d376988","datavalue":{"value":{"entity-type":"item","numeric-id":1174325,"id":"Q1174325"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q809547$DE953370-74ED-4160-BD7F-AD4A0BA9DD75","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":"Q809547$67B68351-4839-4023-8412-B13BEF328409","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"44d4c206495eacc252b02a642cc8776f4ec36582","datavalue":{"value":"https://doi.org/10.1016/s0167-8191(05)80057-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q809547$ECB48CBB-22C9-4F97-A8CA-24EA9953CCFE","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"29684db7dc74002908e9536cf33ff3f37e2c7619","datavalue":{"value":"W2085803963","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809547$6DF8B8AF-A59D-4F34-9B05-19339EC5528D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:809547","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:809547"}}}}}