{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MM3E4HZ4I3B4RELXM4C57IMKHI","short_pith_number":"pith:MM3E4HZ4","schema_version":"1.0","canonical_sha256":"63364e1f3c46c3c891776705dfa18a3a073b79845da6e0f8cb5b844232c65768","source":{"kind":"arxiv","id":"1106.3678","version":1},"attestation_state":"computed","paper":{"title":"An introduction to ML(n)BiCGStab","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Man-Chung Yeung","submitted_at":"2011-06-18T18:58:44Z","abstract_excerpt":"ML(n)BiCGStab is a Krylov subspace method for the solution of large, sparse and non-symmetric linear systems. In theory, it is a method that lies between the well-known BiCGStab and GMRES/FOM. In fact, when n = 1, ML(1)BiCGStab is BiCGStab and when n = N, ML(N)BiCGStab is GMRES/FOM where N is the size of the linear system. Therefore, ML(n)BiCGStab is a bridge that connects the Lanczos-based BiCGStab and the Arnoldi-based GMRES/FOM. In computation, ML(n)BiCGStab can be much more stable and converge much faster than BiCGStab when a problem with ill-condition is solved. We have tested ML(n)BiCGSt"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1106.3678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-06-18T18:58:44Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"22e03ddd9b0c883f77a2af85b3a2bc0060f9e945f17ca962503d497f847cd968","abstract_canon_sha256":"8082c828a19e44a5b14d4db8524e1995af47c80820f0fd244f68fadb9d862637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:42.393290Z","signature_b64":"+3VoRG5PBASf5Emhw3vtSgZ0TUuGMOMPPs+7LZ+X48stEjhoTND9Ndvs+cqQ7Ry1bIcXNNYkYxPcgWInXNAdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63364e1f3c46c3c891776705dfa18a3a073b79845da6e0f8cb5b844232c65768","last_reissued_at":"2026-05-18T04:19:42.392552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:42.392552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An introduction to ML(n)BiCGStab","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Man-Chung Yeung","submitted_at":"2011-06-18T18:58:44Z","abstract_excerpt":"ML(n)BiCGStab is a Krylov subspace method for the solution of large, sparse and non-symmetric linear systems. In theory, it is a method that lies between the well-known BiCGStab and GMRES/FOM. In fact, when n = 1, ML(1)BiCGStab is BiCGStab and when n = N, ML(N)BiCGStab is GMRES/FOM where N is the size of the linear system. Therefore, ML(n)BiCGStab is a bridge that connects the Lanczos-based BiCGStab and the Arnoldi-based GMRES/FOM. In computation, ML(n)BiCGStab can be much more stable and converge much faster than BiCGStab when a problem with ill-condition is solved. We have tested ML(n)BiCGSt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3678","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.3678","created_at":"2026-05-18T04:19:42.392682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3678v1","created_at":"2026-05-18T04:19:42.392682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3678","created_at":"2026-05-18T04:19:42.392682+00:00"},{"alias_kind":"pith_short_12","alias_value":"MM3E4HZ4I3B4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MM3E4HZ4I3B4RELX","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MM3E4HZ4","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI","json":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI.json","graph_json":"https://pith.science/api/pith-number/MM3E4HZ4I3B4RELXM4C57IMKHI/graph.json","events_json":"https://pith.science/api/pith-number/MM3E4HZ4I3B4RELXM4C57IMKHI/events.json","paper":"https://pith.science/paper/MM3E4HZ4"},"agent_actions":{"view_html":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI","download_json":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI.json","view_paper":"https://pith.science/paper/MM3E4HZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3678&json=true","fetch_graph":"https://pith.science/api/pith-number/MM3E4HZ4I3B4RELXM4C57IMKHI/graph.json","fetch_events":"https://pith.science/api/pith-number/MM3E4HZ4I3B4RELXM4C57IMKHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI/action/storage_attestation","attest_author":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI/action/author_attestation","sign_citation":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI/action/citation_signature","submit_replication":"https://pith.science/pith/MM3E4HZ4I3B4RELXM4C57IMKHI/action/replication_record"}},"created_at":"2026-05-18T04:19:42.392682+00:00","updated_at":"2026-05-18T04:19:42.392682+00:00"}