{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z6UZC6O7G2M5PW4TX7RERBNRVS","short_pith_number":"pith:Z6UZC6O7","schema_version":"1.0","canonical_sha256":"cfa99179df3699d7db93bfe24885b1ac9d1edc196d3969a8ac10c927d074a82c","source":{"kind":"arxiv","id":"1709.03679","version":1},"attestation_state":"computed","paper":{"title":"Some transpose-free CG-like solvers for nonsymmetric ill-posed problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Paolo Novati, Silvia Gazzola","submitted_at":"2017-09-12T03:39:23Z","abstract_excerpt":"This paper introduces and analyzes an original class of Krylov subspace methods that provide an efficient alternative to many well-known conjugate-gradient-like (CG-like) Krylov solvers for square nonsymmetric linear systems arising from discretizations of inverse ill-posed problems. The main idea underlying the new methods is to consider some rank-deficient approximations of the transpose of the system matrix, obtained by running the (transpose-free) Arnoldi algorithm, and then apply some Krylov solvers to a formally right-preconditioned system of equations. Theoretical insight is given, and "},"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":"1709.03679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-09-12T03:39:23Z","cross_cats_sorted":[],"title_canon_sha256":"9292353bb0b00081aaee14a7c8d97d848defde336fd27acd931c1961ae276d13","abstract_canon_sha256":"27d098d1281c0ce1d06add18f8eeda949e21065b7ab80767b79100ad8029802f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.820120Z","signature_b64":"ZU6bxm/ArSkv5M+3Nq2Ni+gPAg8JT/gx7BGNz6NrMMNeaF384trxNClnSERDIu+ouRIq9u0RFqh5oaPUIeHWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfa99179df3699d7db93bfe24885b1ac9d1edc196d3969a8ac10c927d074a82c","last_reissued_at":"2026-05-18T00:35:29.819480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.819480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some transpose-free CG-like solvers for nonsymmetric ill-posed problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Paolo Novati, Silvia Gazzola","submitted_at":"2017-09-12T03:39:23Z","abstract_excerpt":"This paper introduces and analyzes an original class of Krylov subspace methods that provide an efficient alternative to many well-known conjugate-gradient-like (CG-like) Krylov solvers for square nonsymmetric linear systems arising from discretizations of inverse ill-posed problems. The main idea underlying the new methods is to consider some rank-deficient approximations of the transpose of the system matrix, obtained by running the (transpose-free) Arnoldi algorithm, and then apply some Krylov solvers to a formally right-preconditioned system of equations. Theoretical insight is given, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03679","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":"1709.03679","created_at":"2026-05-18T00:35:29.819589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03679v1","created_at":"2026-05-18T00:35:29.819589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03679","created_at":"2026-05-18T00:35:29.819589+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6UZC6O7G2M5","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6UZC6O7G2M5PW4T","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6UZC6O7","created_at":"2026-05-18T12:31:59.375834+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/Z6UZC6O7G2M5PW4TX7RERBNRVS","json":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS.json","graph_json":"https://pith.science/api/pith-number/Z6UZC6O7G2M5PW4TX7RERBNRVS/graph.json","events_json":"https://pith.science/api/pith-number/Z6UZC6O7G2M5PW4TX7RERBNRVS/events.json","paper":"https://pith.science/paper/Z6UZC6O7"},"agent_actions":{"view_html":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS","download_json":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS.json","view_paper":"https://pith.science/paper/Z6UZC6O7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03679&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6UZC6O7G2M5PW4TX7RERBNRVS/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6UZC6O7G2M5PW4TX7RERBNRVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS/action/storage_attestation","attest_author":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS/action/author_attestation","sign_citation":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS/action/citation_signature","submit_replication":"https://pith.science/pith/Z6UZC6O7G2M5PW4TX7RERBNRVS/action/replication_record"}},"created_at":"2026-05-18T00:35:29.819589+00:00","updated_at":"2026-05-18T00:35:29.819589+00:00"}