{"entities":{"Q1124269":{"pageid":1135018,"ns":120,"title":"Item:Q1124269","lastrevid":69841266,"modified":"2026-04-13T10:42:27Z","type":"item","id":"Q1124269","labels":{"en":{"language":"en","value":"Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4111894"}},"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":"Q1124269$BCAB1791-60DB-44C2-BA11-78D8CBA3C45A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fec2bd8ca0795c81dbd100a255d895ede44913ce","datavalue":{"value":{"text":"Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1124269$FBFE66A8-05CB-460C-8858-F34EB14176E8","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4e68b89fa565feb900bbb66cfed96dba84a39413","datavalue":{"value":"0678.65017","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1124269$5FD568EC-3FBA-4372-8D26-5659EF1BC1E1","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ce3c3d4cabc26553dd09a48d747986a42a21f042","datavalue":{"value":"10.1016/0167-8191(89)90030-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1124269$EC3C4D9A-12CB-4497-A92E-0D9D88EA2602","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":"Q1124269$34082711-F816-4A8C-99F3-E62CEE4AD362","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7211ad5ca16eb0d22cd0051fff3d0f3af254ceb6","datavalue":{"value":{"time":"+1989-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":"Q1124269$233274A8-056E-4097-AFC4-ACEBCAC9DC08","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"e7cdbad25a7979f9e89d50eeefa13af2cdc67902","datavalue":{"value":"Two parallel modifications of the preconditioned conjugate gradient method for systems with a nonsymmetric matrix are presented. The algorithms are the conjugate gradient squared algorithm and the generalized minimal residual algorithm. In the algorithms preconditionings by a diagonal matrix and by an incomplete LU factorization are considered. A compressed-matrix representation storage scheme developed at the University of Texas in Austin is adopted. The global and local preconditioners in the incomplete LU factorization are used. The algorithms were implemented on the vector multiprocessor IBM 3090-600E VF and tested for two sets of test matrices.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$31A94A1F-DFBB-42A8-BA2A-483706BD9EA1","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9e4257514d9fd4eac10996fc6305328b84fd9c9b","datavalue":{"value":"65F10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1124269$CB3E0BCE-AAB9-4D00-912D-E40B81D4323C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1124269$2996A792-4EB9-4734-A2FA-4282F0AE4F7E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"fe469dfaf59672090401152ef6671332d13bc3ed","datavalue":{"value":"4111894","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1124269$74E842E8-1D25-4715-945C-E57A8EE821D6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"41257e118ecb46daf798acd8b3dc7195cdbcad24","datavalue":{"value":"parallel conjugate gradient methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$954F8FF5-E005-45CA-A1AE-E1F4ED136CB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bdf81d9bc4afd31448a21f8de469d261780da62a","datavalue":{"value":"parallel vector computer","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$B7D0D008-102A-4BC8-B88F-32498F1C6F5E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7af618b26b603d40c608bcac60acee791443500e","datavalue":{"value":"preconditioned conjugate gradient method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$347C541F-A096-4068-B9E0-0C863FE6EE9D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c36ef7db2ff55b4c5202e73853af4381d6f8065b","datavalue":{"value":"nonsymmetric matrix","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$67EDDB77-342C-4191-85A9-60410BE1152E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"73e36605810bf78027fa413d8cce31a3990e968d","datavalue":{"value":"minimal residual algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$12CADD32-F079-4147-9D1C-6456E5016943","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2da2925a7f5ad781771db79ff8d63ce7085f59fd","datavalue":{"value":"incomplete LU factorization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$5AF39D64-6A98-43B1-AF00-D03BC2796BBE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bf9582b10f4864385e2a04ffe2fbc64d2bb22cdc","datavalue":{"value":"vector multiprocessor","type":"string"},"datatype":"string"},"type":"statement","id":"Q1124269$405AFFF2-FA58-47B1-B71B-A6A09EC75024","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"58355c78c12be8dd8254d5e3ece4a07c0ebcb45a","datavalue":{"value":{"entity-type":"item","numeric-id":1262076,"id":"Q1262076"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1124269$8C0D3A94-6B32-43A6-9ADD-C13E33388E08","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"94730d4f319bff810ecb15719995f961a7d0892b","datavalue":{"value":{"entity-type":"item","numeric-id":235410,"id":"Q235410"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1124269$8332B061-3A04-42B5-9F0A-495CF9692DAF","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"71e83ac9de26464aa299e770b304328667586174","datavalue":{"value":{"entity-type":"item","numeric-id":991113,"id":"Q991113"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1124269$EA57D1AE-1C08-4B74-AF32-9D9297FC4206","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":"Q1124269$E19FE9A8-185A-484D-9DCC-D6C61A848577","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a53d54ef6ede5ae811f278a86bc171f2765045c7","datavalue":{"value":"https://doi.org/10.1016/0167-8191(89)90030-6","type":"string"},"datatype":"url"},"type":"statement","id":"Q1124269$95D6C746-ED9D-4184-8BA7-8702D97C1709","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"bf6a52c46a5c99005b67774a107a954f0fa4ecea","datavalue":{"value":"W2090314242","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1124269$43017FD3-DC8F-43CC-B623-87C705127E8D","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"31196bdd03521dd14d701310d5f7a50fae35eb3e","datavalue":{"value":{"entity-type":"item","numeric-id":3692700,"id":"Q3692700"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5ea5ae71df0abc670de57755519b47fc117954a1","datavalue":{"value":{"amount":"+0.870110809803009","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":"Q1124269$F8EEB6D5-9154-4230-8FDE-3166A26A7D0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b1160f60c8ccad8571e616d12c90a190fc5f01e6","datavalue":{"value":{"entity-type":"item","numeric-id":3819895,"id":"Q3819895"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"87e1cb8a278298e8d8addb00dcf96c493d0e51d3","datavalue":{"value":{"amount":"+0.8612233400344849","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":"Q1124269$0CCCAAED-BB4A-4793-BFBE-FBFB96E30A70","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9c6cb94cbac0da34b63b914f5def9bba6ca6bf63","datavalue":{"value":{"entity-type":"item","numeric-id":1181505,"id":"Q1181505"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8e6ae34539c0d9bf0ac4e2603feaa32f832e6f06","datavalue":{"value":{"amount":"+0.8603447675704956","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":"Q1124269$B5EFE549-ADFD-4BBE-9144-C35E17B477D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"07dec3d6bda00bdbee644684bbb3c57e435d710a","datavalue":{"value":{"entity-type":"item","numeric-id":4021064,"id":"Q4021064"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"aa2ce72c92a667004e8d5a9b70d75d525fcdc877","datavalue":{"value":{"amount":"+0.8574904203414917","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":"Q1124269$7D43E2C1-B6F5-4509-911E-C540895EB7C3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3f1d6bed8fd6f49f192dd92f8e41e3147d2676e7","datavalue":{"value":{"entity-type":"item","numeric-id":1330655,"id":"Q1330655"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2d48307a5e4e3ce93b9ee9977f73ea5f382fcdab","datavalue":{"value":{"amount":"+0.8529031276702881","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":"Q1124269$11E9590C-EE5D-40A8-A0C3-C5A31F1C26F6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Parallel_conjugate_gradient-like_algorithms_for_solving_sparse_nonsymmetric_linear_systems_on_a_vector_multiprocessor"}}}}}