{"corpus_id":45774810,"paper_sha":"827b1b4daf6531ba42201fec9c06f6ff74504ef4","doi":"10.1090/S0025-5718-1977-0438681-4","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":1992208469,"dblp_id":null,"acl_id":null,"title":"An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix","year":1977,"publication_date":null,"venue":"","journal":{"name":"Mathematics of Computation","pages":"148-162","volume":"31"},"journal_issn":null,"journal_title":null,"publication_types":[],"pubmed_pub_types":null,"s2_fields_of_study":["Mathematics"],"reference_count":10,"citation_count":1756,"influential_citation_count":50,"is_open_access":true,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"https://www.ams.org/mcom/1977-31-137/S0025-5718-1977-0438681-4/S0025-5718-1977-0438681-4.pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/827b1b4daf6531ba42201fec9c06f6ff74504ef4","s2_open_access_license":null,"s2_open_access_status":"BRONZE","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"A particular class of regular splittings of not necessarily symmetric <italic>M</italic> -matrices is proposed. If the matrix is symmetric, this splitting is combined with the conjugate-gradient method to provide a fast iterative solution algorithm. Comparisons have been made with other well-known methods. In all test problems the new combination was faster than the other methods.","claims":[{"public_id":"cl_34e57a06da08c09e6fc305cb03d89dcc","status":"active","text":"A particular class of regular splittings is proposed for not necessarily symmetric M-matrices.","confidence":0.98,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_34e57a06da08c09e6fc305cb03d89dcc"},{"public_id":"cl_71bee28dec570ff1c1f502c65a2990f9","status":"active","text":"For symmetric coefficient matrices, combining the splitting with the conjugate-gradient method yields a fast iterative solution algorithm.","confidence":0.96,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_71bee28dec570ff1c1f502c65a2990f9"},{"public_id":"cl_e9d9017fc36344d298eb5436526526ee","status":"active","text":"In all test problems, the new combination was faster than the other well-known methods compared against it.","confidence":0.97,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_e9d9017fc36344d298eb5436526526ee"}],"concepts":[{"public_id":"co_24f48df7790a0d389ab0f7678d88856a","status":"active","name":"other well-known methods","description":"Previously established iterative methods used as comparison baselines.","types":["baseline"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_24f48df7790a0d389ab0f7678d88856a"},{"public_id":"co_5542d5ca7d78dea76d10d50708b3ebeb","status":"active","name":"regular splittings","description":"A class of matrix decompositions used to construct iterative methods for solving linear systems.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_5542d5ca7d78dea76d10d50708b3ebeb"},{"public_id":"co_88e3e3058d2eea5eac2cf9217e8febca","status":"active","name":"new combination","description":"The proposed algorithm formed by combining the regular splitting with the conjugate-gradient method.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_88e3e3058d2eea5eac2cf9217e8febca"},{"public_id":"co_aab47a08beeaa236c71dd5b273380f18","status":"active","name":"iterative solution algorithm","description":"An iterative procedure for computing the solution of a linear system.","types":["algorithm"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_aab47a08beeaa236c71dd5b273380f18"},{"public_id":"co_bb22192f8bb5e9708f439dd2f4fd6c69","status":"active","name":"M-matrices","description":"A class of matrices with nonpositive off-diagonal entries and properties useful for iterative linear solvers.","types":["matrix class"],"aliases":["M-matrix"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_bb22192f8bb5e9708f439dd2f4fd6c69"},{"public_id":"co_c07e12a18fb4498ab6a8f185be4ba581","status":"active","name":"test problems","description":"The numerical problems used to compare the proposed algorithm with other methods.","types":["evaluation set"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_c07e12a18fb4498ab6a8f185be4ba581"},{"public_id":"co_e2c58748106782128ef7fa2b955e2a20","status":"active","name":"conjugate-gradient method","description":"An iterative algorithm for solving symmetric linear systems.","types":["method"],"aliases":["CG method","CG"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_e2c58748106782128ef7fa2b955e2a20"}],"external_ids":{"DOI":"10.1090/S0025-5718-1977-0438681-4","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":1992208469,"DBLP":null,"ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://www.ams.org/mcom/1977-31-137/S0025-5718-1977-0438681-4/S0025-5718-1977-0438681-4.pdf","landing_url":"https://www.semanticscholar.org/paper/827b1b4daf6531ba42201fec9c06f6ff74504ef4","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":null,"status":"BRONZE","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":634946,"paper_uid":"be14b3c6-c914-4358-b4d0-f0d633026e75","canonical_identity":{"paper_id":634946,"paper_uid":"be14b3c6-c914-4358-b4d0-f0d633026e75","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/45774810"}