{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6IEJIMEVI7EEWEL5EOK72NF4TX","short_pith_number":"pith:6IEJIMEV","schema_version":"1.0","canonical_sha256":"f20894309547c84b117d2395fd34bc9df843690d2c5d4a0859710d55ded8642c","source":{"kind":"arxiv","id":"1011.5314","version":1},"attestation_state":"computed","paper":{"title":"ML(n)BiCGStab: Reformulation, Analysis and Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.DS","math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Man-Chung Yeung","submitted_at":"2010-11-24T08:15:34Z","abstract_excerpt":"With the aid of index functions, we re-derive the ML(n)BiCGStab algorithm in a paper by Yeung and Chan in 1999 in a more systematic way. It turns out that there are n ways to define the ML(n)BiCGStab residual vector. Each definition will lead to a different ML(n)BiCGStab algorithm. We demonstrate this by presenting a second algorithm which requires less storage. In theory, this second algorithm serves as a bridge that connects the Lanczos-based BiCGStab and the Arnoldi-based FOM while ML(n)BiCG a bridge connecting BiCG and FOM. We also analyze the breakdown situations from the probabilistic po"},"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":"1011.5314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-11-24T08:15:34Z","cross_cats_sorted":["cs.IT","math.DS","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"c264d612964b4df7a3b909ad4baad9c6d8a9f3f9f85dd5ad2d55c790d15b8acf","abstract_canon_sha256":"96e053a6bcab5dc4afa9de3297d5d240071aac34b8d9a1b95f23bbf6b77cf631"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:47.576127Z","signature_b64":"irBptx4wjEfn+cDfPUptRe47onSAx/24oTI4BJe1dUZRrKkWTMewVoUUFefsA8Y2+0tBiMlxE230vvtl5/nMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f20894309547c84b117d2395fd34bc9df843690d2c5d4a0859710d55ded8642c","last_reissued_at":"2026-05-18T04:34:47.575534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:47.575534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ML(n)BiCGStab: Reformulation, Analysis and Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.DS","math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Man-Chung Yeung","submitted_at":"2010-11-24T08:15:34Z","abstract_excerpt":"With the aid of index functions, we re-derive the ML(n)BiCGStab algorithm in a paper by Yeung and Chan in 1999 in a more systematic way. It turns out that there are n ways to define the ML(n)BiCGStab residual vector. Each definition will lead to a different ML(n)BiCGStab algorithm. We demonstrate this by presenting a second algorithm which requires less storage. In theory, this second algorithm serves as a bridge that connects the Lanczos-based BiCGStab and the Arnoldi-based FOM while ML(n)BiCG a bridge connecting BiCG and FOM. We also analyze the breakdown situations from the probabilistic po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5314","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":"1011.5314","created_at":"2026-05-18T04:34:47.575627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5314v1","created_at":"2026-05-18T04:34:47.575627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5314","created_at":"2026-05-18T04:34:47.575627+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IEJIMEVI7EE","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IEJIMEVI7EEWEL5","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IEJIMEV","created_at":"2026-05-18T12:26:04.259169+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/6IEJIMEVI7EEWEL5EOK72NF4TX","json":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX.json","graph_json":"https://pith.science/api/pith-number/6IEJIMEVI7EEWEL5EOK72NF4TX/graph.json","events_json":"https://pith.science/api/pith-number/6IEJIMEVI7EEWEL5EOK72NF4TX/events.json","paper":"https://pith.science/paper/6IEJIMEV"},"agent_actions":{"view_html":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX","download_json":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX.json","view_paper":"https://pith.science/paper/6IEJIMEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5314&json=true","fetch_graph":"https://pith.science/api/pith-number/6IEJIMEVI7EEWEL5EOK72NF4TX/graph.json","fetch_events":"https://pith.science/api/pith-number/6IEJIMEVI7EEWEL5EOK72NF4TX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX/action/storage_attestation","attest_author":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX/action/author_attestation","sign_citation":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX/action/citation_signature","submit_replication":"https://pith.science/pith/6IEJIMEVI7EEWEL5EOK72NF4TX/action/replication_record"}},"created_at":"2026-05-18T04:34:47.575627+00:00","updated_at":"2026-05-18T04:34:47.575627+00:00"}