{"entities":{"Q1200060":{"pageid":1210809,"ns":120,"title":"Item:Q1200060","lastrevid":69871941,"modified":"2026-04-13T10:54:49Z","type":"item","id":"Q1200060","labels":{"en":{"language":"en","value":"On computing approximate inverses for sparse matrices of strong pivot"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 96630"}},"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":"Q1200060$F1AA8426-DE62-4D92-80C1-5AE98D89D695","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b1178543262dbe3e62787c7c40cd12a41e478622","datavalue":{"value":{"text":"On computing approximate inverses for sparse matrices of strong pivot","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1200060$1C5508E6-6EAA-46DD-8DA1-107F6463EC5D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"05a97f8ad97b73ebe22809bf456a4758d6eac69d","datavalue":{"value":"0756.65037","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1200060$E5311460-5C38-46FB-B7D6-0CB765864D18","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6ca9eea89f6f8fa00fe08ee68015f759ffd8f4b5","datavalue":{"value":{"entity-type":"item","numeric-id":1192727,"id":"Q1192727"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1200060$E7735A83-2527-4834-AD03-4B04DE114587","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"45e1edb64efeee080173451c87c3f0c1d8534742","datavalue":{"value":{"entity-type":"item","numeric-id":174829,"id":"Q174829"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1200060$2EBF8A69-2A50-4903-832A-C2C0244FD406","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b0879f591850b4f9f14b2c481d3e08995aa22089","datavalue":{"value":{"time":"+1993-01-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1200060$9D13AA13-67D5-4867-9ACF-5CCED6281730","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"210ba85060a39a9b868b7559f526afd4b32267d1","datavalue":{"value":"The author first generalizes the concept of diagonally dominant matrices, and then an elimination algorithm is presented to find their inverses. Numerical examples illustrate the methodology.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1200060$52CC44E3-0017-4EDA-8F24-A4FC5107153B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9885aef811aa349f50c28b046ac04fbe99524c67","datavalue":{"value":"65F05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1200060$88D98E07-C856-4B91-B161-46DB363FE05E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bb68a4ead97a966e0738a004317f6777af7ecfa4","datavalue":{"value":"65F50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1200060$F08CEDA9-659D-416F-8B04-395D361B8E70","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"82c9f7dc2ab3aab273f5a73664d0888d2aa8cbc1","datavalue":{"value":"96630","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1200060$5A8DF8C6-E73A-4072-BE35-7D2F7CE5AA1C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d470915ad5f8b20e8e1116c88f9a812167267df5","datavalue":{"value":"sparse matrices","type":"string"},"datatype":"string"},"type":"statement","id":"Q1200060$C11A977A-68C0-4A45-A5FB-79ECE824A6F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c6a26c619f3c34107172c32ab1d29a17af19378d","datavalue":{"value":"order","type":"string"},"datatype":"string"},"type":"statement","id":"Q1200060$B88F7CD7-57E1-4322-A731-1B7248E77E85","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"630e36a1c113436b0b971a81cfbcae75949748ca","datavalue":{"value":"diagonally dominant matrices","type":"string"},"datatype":"string"},"type":"statement","id":"Q1200060$2C5C2F35-514F-4174-A18D-B84D22B14B78","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1fb15fb94bac62fae94b4b7582e6f73f5254b60f","datavalue":{"value":"elimination algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1200060$FCD5A6CB-2070-497D-8DEA-10C8E6896C9D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e4cf7dd69adb8a250b8c376618ad4ae0d9ba2bcc","datavalue":{"value":"inverses","type":"string"},"datatype":"string"},"type":"statement","id":"Q1200060$6C89586B-099B-4F80-8ECD-D681E1BB6852","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"255badb5de8e54836b0083190a8a25bf7781372a","datavalue":{"value":"Numerical examples","type":"string"},"datatype":"string"},"type":"statement","id":"Q1200060$94E739C1-573F-4452-A99D-B1E7A516E389","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"42fe100639ea027d895df4a4d91563126125ae3d","datavalue":{"value":{"entity-type":"item","numeric-id":233672,"id":"Q233672"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1200060$137CC715-F1F8-4CC0-9F6D-5010AA27AADB","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":"Q1200060$BBB72B08-CD30-4CA0-B4EC-E49D3C899118","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On computing approximate inverses for sparse matrices of strong pivot","badges":[]}}}}}