{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KDUOU5TIQX7WQDCP366SWZXWDB","short_pith_number":"pith:KDUOU5TI","schema_version":"1.0","canonical_sha256":"50e8ea766885ff680c4fdfbd2b66f6187ddc411586aad1bbc30688d4a9df58e7","source":{"kind":"arxiv","id":"1902.08388","version":1},"attestation_state":"computed","paper":{"title":"Geometrical inverse matrix approximation for least-squares problems and acceleration strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jean-Paul Chehab, Marcos Raydan","submitted_at":"2019-02-22T08:06:20Z","abstract_excerpt":"We extend the geometrical inverse approximation approach for solving linear least-squares problems. For that we focus on the minimization of $1-\\cos(X(A^TA),I)$, where $A$ is a given rectangular coefficient matrix and $X$ is the approximate inverse. In particular, we adapt the recently published simplified gradient-type iterative scheme MinCos to the least-squares scenario. In addition, we combine the generated convergent sequence of matrices with well-known acceleration strategies based on recently developed matrix extrapolation methods, and also with some deterministic and heuristic accelera"},"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":"1902.08388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-22T08:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"0bfbb00378b9333001f7cbbe96127d82b91c4e09fdd1fa514cada075b3e17ba1","abstract_canon_sha256":"d58060af962839d344f42fbf1e46ba6e9c29c323996f516a68deaab783ae547f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:57.408522Z","signature_b64":"ev+XCOMZVYXUY69SQR6ry7JaPHGo34ANJ1dz3FKpf3ge7eDkq/1gm+lYBO0tpnA1vkvhiYcHT+Qpo1F8tMllBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e8ea766885ff680c4fdfbd2b66f6187ddc411586aad1bbc30688d4a9df58e7","last_reissued_at":"2026-05-17T23:52:57.407976Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:57.407976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometrical inverse matrix approximation for least-squares problems and acceleration strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jean-Paul Chehab, Marcos Raydan","submitted_at":"2019-02-22T08:06:20Z","abstract_excerpt":"We extend the geometrical inverse approximation approach for solving linear least-squares problems. For that we focus on the minimization of $1-\\cos(X(A^TA),I)$, where $A$ is a given rectangular coefficient matrix and $X$ is the approximate inverse. In particular, we adapt the recently published simplified gradient-type iterative scheme MinCos to the least-squares scenario. In addition, we combine the generated convergent sequence of matrices with well-known acceleration strategies based on recently developed matrix extrapolation methods, and also with some deterministic and heuristic accelera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08388","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":"1902.08388","created_at":"2026-05-17T23:52:57.408068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08388v1","created_at":"2026-05-17T23:52:57.408068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08388","created_at":"2026-05-17T23:52:57.408068+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDUOU5TIQX7W","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDUOU5TIQX7WQDCP","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDUOU5TI","created_at":"2026-05-18T12:33:21.387695+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/KDUOU5TIQX7WQDCP366SWZXWDB","json":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB.json","graph_json":"https://pith.science/api/pith-number/KDUOU5TIQX7WQDCP366SWZXWDB/graph.json","events_json":"https://pith.science/api/pith-number/KDUOU5TIQX7WQDCP366SWZXWDB/events.json","paper":"https://pith.science/paper/KDUOU5TI"},"agent_actions":{"view_html":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB","download_json":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB.json","view_paper":"https://pith.science/paper/KDUOU5TI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08388&json=true","fetch_graph":"https://pith.science/api/pith-number/KDUOU5TIQX7WQDCP366SWZXWDB/graph.json","fetch_events":"https://pith.science/api/pith-number/KDUOU5TIQX7WQDCP366SWZXWDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/action/storage_attestation","attest_author":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/action/author_attestation","sign_citation":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/action/citation_signature","submit_replication":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/action/replication_record"}},"created_at":"2026-05-17T23:52:57.408068+00:00","updated_at":"2026-05-17T23:52:57.408068+00:00"}