{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W6EHQIORL3GFPQUVGURWEOM37Q","short_pith_number":"pith:W6EHQIOR","schema_version":"1.0","canonical_sha256":"b7887821d15ecc57c295352362399bfc3add0a94e5bc04914092f006e7f93b3d","source":{"kind":"arxiv","id":"1312.7072","version":1},"attestation_state":"computed","paper":{"title":"General constraint preconditioning iteration method for singular saddle-point problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ai-Li Yang, Guo-Feng Zhang, Yu-Jiang Wu","submitted_at":"2013-12-26T09:06:29Z","abstract_excerpt":"For the singular saddle-point problems with nonsymmetric positive definite $(1,1)$ block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the $(1,1)$ block of the singular constraint preconditioner, a detailed convergence condition is derived by analyzing the spectrum of the iteration matrix. Numerical experiments are used to illustrate the theoretical "},"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":"1312.7072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-12-26T09:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"676f4b83e028723e28677f448e2ef5cb17304c726428e13266d9c5bb2543d510","abstract_canon_sha256":"ecb8add7e65ce7b29b5ac7da8ac923e9ea5e3424aa1707215647bd354333a660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.968461Z","signature_b64":"BXfHAercoZe1wDVzNtk/r4ryvp4gmy4FZZNwaALjk2oLWksIQtN5QJWFXDp9F4frRKtDGrPGPL96FdrnAb6tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7887821d15ecc57c295352362399bfc3add0a94e5bc04914092f006e7f93b3d","last_reissued_at":"2026-05-18T03:03:45.967664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.967664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General constraint preconditioning iteration method for singular saddle-point problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ai-Li Yang, Guo-Feng Zhang, Yu-Jiang Wu","submitted_at":"2013-12-26T09:06:29Z","abstract_excerpt":"For the singular saddle-point problems with nonsymmetric positive definite $(1,1)$ block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the $(1,1)$ block of the singular constraint preconditioner, a detailed convergence condition is derived by analyzing the spectrum of the iteration matrix. Numerical experiments are used to illustrate the theoretical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7072","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":"1312.7072","created_at":"2026-05-18T03:03:45.967802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7072v1","created_at":"2026-05-18T03:03:45.967802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7072","created_at":"2026-05-18T03:03:45.967802+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6EHQIORL3GF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6EHQIORL3GFPQUV","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6EHQIOR","created_at":"2026-05-18T12:28:04.890932+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/W6EHQIORL3GFPQUVGURWEOM37Q","json":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q.json","graph_json":"https://pith.science/api/pith-number/W6EHQIORL3GFPQUVGURWEOM37Q/graph.json","events_json":"https://pith.science/api/pith-number/W6EHQIORL3GFPQUVGURWEOM37Q/events.json","paper":"https://pith.science/paper/W6EHQIOR"},"agent_actions":{"view_html":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q","download_json":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q.json","view_paper":"https://pith.science/paper/W6EHQIOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7072&json=true","fetch_graph":"https://pith.science/api/pith-number/W6EHQIORL3GFPQUVGURWEOM37Q/graph.json","fetch_events":"https://pith.science/api/pith-number/W6EHQIORL3GFPQUVGURWEOM37Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q/action/storage_attestation","attest_author":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q/action/author_attestation","sign_citation":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q/action/citation_signature","submit_replication":"https://pith.science/pith/W6EHQIORL3GFPQUVGURWEOM37Q/action/replication_record"}},"created_at":"2026-05-18T03:03:45.967802+00:00","updated_at":"2026-05-18T03:03:45.967802+00:00"}