{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TTGMYKYWOGYCN52T2PXUFULWIB","short_pith_number":"pith:TTGMYKYW","schema_version":"1.0","canonical_sha256":"9ccccc2b1671b026f753d3ef42d1764077458cc9a3ed502399a5fa34bff45165","source":{"kind":"arxiv","id":"1006.0758","version":2},"attestation_state":"computed","paper":{"title":"LSMR: An iterative algorithm for sparse least-squares problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.MS","authors_text":"David Fong, Michael Saunders","submitted_at":"2010-06-04T00:16:09Z","abstract_excerpt":"An iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problem $\\min \\norm{Ax-b}_2$, with $A$ being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process. It is analytically equivalent to the MINRES method applied to the normal equation $A\\T Ax = A\\T b$, so that the quantities $\\norm{A\\T r_k}$ are monotonically decreasing (where $r_k = b - Ax_k$ is the residual for the current iterate $x_k$). In practice we observe that $\\norm{r_k}$ also decreases monotonically. Compared to LSQR, for which only $\\norm{r_k}$ is monotonic,"},"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":"1006.0758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2010-06-04T00:16:09Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"5fcb1af3ba5332575a93306642999d1daf23c859c5e32db7f15633d7d1976291","abstract_canon_sha256":"ec5ab98761b7ad20534f2785bcaf9fe55ffb4cfe46887d4198eb70dfe2f97645"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:57.077476Z","signature_b64":"IhoaFMV6Lyl806zM2IIG9Mu+8pvwQIGaNxbrHFrDfaXy98Z5S1wjPchecIsTc+RSIYJTJ+6ywgSN9F7xAhxdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ccccc2b1671b026f753d3ef42d1764077458cc9a3ed502399a5fa34bff45165","last_reissued_at":"2026-05-18T04:03:57.076912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:57.076912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LSMR: An iterative algorithm for sparse least-squares problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.MS","authors_text":"David Fong, Michael Saunders","submitted_at":"2010-06-04T00:16:09Z","abstract_excerpt":"An iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problem $\\min \\norm{Ax-b}_2$, with $A$ being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process. It is analytically equivalent to the MINRES method applied to the normal equation $A\\T Ax = A\\T b$, so that the quantities $\\norm{A\\T r_k}$ are monotonically decreasing (where $r_k = b - Ax_k$ is the residual for the current iterate $x_k$). In practice we observe that $\\norm{r_k}$ also decreases monotonically. Compared to LSQR, for which only $\\norm{r_k}$ is monotonic,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0758","kind":"arxiv","version":2},"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":"1006.0758","created_at":"2026-05-18T04:03:57.076996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0758v2","created_at":"2026-05-18T04:03:57.076996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0758","created_at":"2026-05-18T04:03:57.076996+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTGMYKYWOGYC","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTGMYKYWOGYCN52T","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTGMYKYW","created_at":"2026-05-18T12:26:15.391820+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/TTGMYKYWOGYCN52T2PXUFULWIB","json":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB.json","graph_json":"https://pith.science/api/pith-number/TTGMYKYWOGYCN52T2PXUFULWIB/graph.json","events_json":"https://pith.science/api/pith-number/TTGMYKYWOGYCN52T2PXUFULWIB/events.json","paper":"https://pith.science/paper/TTGMYKYW"},"agent_actions":{"view_html":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB","download_json":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB.json","view_paper":"https://pith.science/paper/TTGMYKYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0758&json=true","fetch_graph":"https://pith.science/api/pith-number/TTGMYKYWOGYCN52T2PXUFULWIB/graph.json","fetch_events":"https://pith.science/api/pith-number/TTGMYKYWOGYCN52T2PXUFULWIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/action/storage_attestation","attest_author":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/action/author_attestation","sign_citation":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/action/citation_signature","submit_replication":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/action/replication_record"}},"created_at":"2026-05-18T04:03:57.076996+00:00","updated_at":"2026-05-18T04:03:57.076996+00:00"}