{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4PWH5CA2EJ62HQFMJU5OCII2FZ","short_pith_number":"pith:4PWH5CA2","schema_version":"1.0","canonical_sha256":"e3ec7e881a227da3c0ac4d3ae1211a2e7bee52307a15c041640f19d81cb247d3","source":{"kind":"arxiv","id":"1811.09334","version":1},"attestation_state":"computed","paper":{"title":"Randomized QLP algorithm and error analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Hua Xiang, Nianci Wu","submitted_at":"2018-11-23T01:03:24Z","abstract_excerpt":"In this paper, we describe the randomized QLP (RQLP) algorithm and its enhanced version (ERQLP) for computing the low rank approximation to $A$ of size $m\\times n$ efficiently such that $A\\approx QLP$, where $L$ is the rank-$k$ lower-triangular matrix, $Q$ and $P$ are column orthogonal matrices. The theoretical cost of the implementation of RQLP and ERQLP only needs $\\mathcal{O}(mnk)$. Moreover, we derive the upper bounds of the expected approximation error $\\mathbb{E}\\left [ (\\sigma_{j}(A) - \\sigma_{j} (L))/ \\sigma_{j}(A) \\right] $ for $j=1,\\cdots, k$, and prove that the $L$-values of the pro"},"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":"1811.09334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-23T01:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"f3497f343b585282e6ae8af853297fe25c1c05c459d5c58d3f5bd43c07a88c2f","abstract_canon_sha256":"0a6532b88bf8c4f9da9853e13ab8c280789eddd027ba21a7d65082967703c4c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:03.663949Z","signature_b64":"8oK7WPzAtEa5Xr7u5z/o+weeu68wRHIuk56oe/BqTiC8JBLN42g5G0RKaUdmw0/s4leKnGcrluvHBho8FTJSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ec7e881a227da3c0ac4d3ae1211a2e7bee52307a15c041640f19d81cb247d3","last_reissued_at":"2026-05-18T00:00:03.663534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:03.663534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized QLP algorithm and error analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Hua Xiang, Nianci Wu","submitted_at":"2018-11-23T01:03:24Z","abstract_excerpt":"In this paper, we describe the randomized QLP (RQLP) algorithm and its enhanced version (ERQLP) for computing the low rank approximation to $A$ of size $m\\times n$ efficiently such that $A\\approx QLP$, where $L$ is the rank-$k$ lower-triangular matrix, $Q$ and $P$ are column orthogonal matrices. The theoretical cost of the implementation of RQLP and ERQLP only needs $\\mathcal{O}(mnk)$. Moreover, we derive the upper bounds of the expected approximation error $\\mathbb{E}\\left [ (\\sigma_{j}(A) - \\sigma_{j} (L))/ \\sigma_{j}(A) \\right] $ for $j=1,\\cdots, k$, and prove that the $L$-values of the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09334","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":"1811.09334","created_at":"2026-05-18T00:00:03.663592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09334v1","created_at":"2026-05-18T00:00:03.663592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09334","created_at":"2026-05-18T00:00:03.663592+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PWH5CA2EJ62","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PWH5CA2EJ62HQFM","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PWH5CA2","created_at":"2026-05-18T12:32:05.422762+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/4PWH5CA2EJ62HQFMJU5OCII2FZ","json":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ.json","graph_json":"https://pith.science/api/pith-number/4PWH5CA2EJ62HQFMJU5OCII2FZ/graph.json","events_json":"https://pith.science/api/pith-number/4PWH5CA2EJ62HQFMJU5OCII2FZ/events.json","paper":"https://pith.science/paper/4PWH5CA2"},"agent_actions":{"view_html":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ","download_json":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ.json","view_paper":"https://pith.science/paper/4PWH5CA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09334&json=true","fetch_graph":"https://pith.science/api/pith-number/4PWH5CA2EJ62HQFMJU5OCII2FZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4PWH5CA2EJ62HQFMJU5OCII2FZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/action/storage_attestation","attest_author":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/action/author_attestation","sign_citation":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/action/citation_signature","submit_replication":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/action/replication_record"}},"created_at":"2026-05-18T00:00:03.663592+00:00","updated_at":"2026-05-18T00:00:03.663592+00:00"}