{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GQWK5BGTLPISSB32OHLZOJVW7U","short_pith_number":"pith:GQWK5BGT","schema_version":"1.0","canonical_sha256":"342cae84d35bd129077a71d79726b6fd36c28f80c86c7a2c8c141752a2d1dcd0","source":{"kind":"arxiv","id":"1803.03717","version":1},"attestation_state":"computed","paper":{"title":"Low-Rank Solution Methods for Stochastic Eigenvalue Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Howard C. Elman, Tengfei Su","submitted_at":"2018-03-09T23:09:56Z","abstract_excerpt":"We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. A low-rank variant of the inverse subspace iteration algorithm is presented for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. The algorithm is tested"},"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":"1803.03717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-09T23:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"eb17bca8e9b6ecc2e5307b6f4522f0cec16e48dbf27054cde9a58b47013a6f46","abstract_canon_sha256":"a93342e80586244d60cbc9236c574f96da6eec3500f5827b8a384276bbf2d922"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.365187Z","signature_b64":"s+GQlhnRjWcE/cQKXf12+wPZlr9PuwkOS3pHpdm8t1vqvvI6aKc0hsYaX96zQ/+pjBwYuam7yQ2O/bHvMf8NDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"342cae84d35bd129077a71d79726b6fd36c28f80c86c7a2c8c141752a2d1dcd0","last_reissued_at":"2026-05-18T00:21:38.364473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.364473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Solution Methods for Stochastic Eigenvalue Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Howard C. Elman, Tengfei Su","submitted_at":"2018-03-09T23:09:56Z","abstract_excerpt":"We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. A low-rank variant of the inverse subspace iteration algorithm is presented for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. The algorithm is tested"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03717","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":"1803.03717","created_at":"2026-05-18T00:21:38.364596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03717v1","created_at":"2026-05-18T00:21:38.364596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03717","created_at":"2026-05-18T00:21:38.364596+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQWK5BGTLPIS","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQWK5BGTLPISSB32","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQWK5BGT","created_at":"2026-05-18T12:32:25.280505+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/GQWK5BGTLPISSB32OHLZOJVW7U","json":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U.json","graph_json":"https://pith.science/api/pith-number/GQWK5BGTLPISSB32OHLZOJVW7U/graph.json","events_json":"https://pith.science/api/pith-number/GQWK5BGTLPISSB32OHLZOJVW7U/events.json","paper":"https://pith.science/paper/GQWK5BGT"},"agent_actions":{"view_html":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U","download_json":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U.json","view_paper":"https://pith.science/paper/GQWK5BGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03717&json=true","fetch_graph":"https://pith.science/api/pith-number/GQWK5BGTLPISSB32OHLZOJVW7U/graph.json","fetch_events":"https://pith.science/api/pith-number/GQWK5BGTLPISSB32OHLZOJVW7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U/action/storage_attestation","attest_author":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U/action/author_attestation","sign_citation":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U/action/citation_signature","submit_replication":"https://pith.science/pith/GQWK5BGTLPISSB32OHLZOJVW7U/action/replication_record"}},"created_at":"2026-05-18T00:21:38.364596+00:00","updated_at":"2026-05-18T00:21:38.364596+00:00"}