{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PMW7MJBHHBNSZ6Z5BBVGTQ6AFB","short_pith_number":"pith:PMW7MJBH","schema_version":"1.0","canonical_sha256":"7b2df62427385b2cfb3d086a69c3c0284a30aa0476a60d71fc34bc6bc452e791","source":{"kind":"arxiv","id":"1310.6573","version":4},"attestation_state":"computed","paper":{"title":"Multigrid algorithms for $hp$-Discontinuous Galerkin discretizations of elliptic problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"M. Sarti, M. Verani, P. F. Antonietti","submitted_at":"2013-10-24T11:51:59Z","abstract_excerpt":"We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in multigrid analysis, we define a smoothing and an approximation property, which are used to prove the uniform convergence of the W-cycle scheme with respect to the granularity of the grid and the number of levels. The dependence of the convergence rate on the polynomial approximation degree $p$ is also tracked, showing that the contraction factor of the scheme deter"},"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":"1310.6573","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-24T11:51:59Z","cross_cats_sorted":[],"title_canon_sha256":"1c7aad8f8fd8ee2ec1a640ed54ceb799a50cde887b97796de33be319686f0ec2","abstract_canon_sha256":"52e7a482603c484953a8daf457a687a4b2627a25e713bdb226e14a05dce515f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:57.411058Z","signature_b64":"cZmKEyXevX4uoxSlemfn1jmeavaDmvm3tI6krJBpGcyDLIqfV6klTpwQGdv1qdoYjWa7YvLgnOgiT4yGmlSNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b2df62427385b2cfb3d086a69c3c0284a30aa0476a60d71fc34bc6bc452e791","last_reissued_at":"2026-05-18T03:05:57.410295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:57.410295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multigrid algorithms for $hp$-Discontinuous Galerkin discretizations of elliptic problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"M. Sarti, M. Verani, P. F. Antonietti","submitted_at":"2013-10-24T11:51:59Z","abstract_excerpt":"We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in multigrid analysis, we define a smoothing and an approximation property, which are used to prove the uniform convergence of the W-cycle scheme with respect to the granularity of the grid and the number of levels. The dependence of the convergence rate on the polynomial approximation degree $p$ is also tracked, showing that the contraction factor of the scheme deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6573","kind":"arxiv","version":4},"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":"1310.6573","created_at":"2026-05-18T03:05:57.410434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6573v4","created_at":"2026-05-18T03:05:57.410434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6573","created_at":"2026-05-18T03:05:57.410434+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMW7MJBHHBNS","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMW7MJBHHBNSZ6Z5","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMW7MJBH","created_at":"2026-05-18T12:27:54.935989+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/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB","json":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB.json","graph_json":"https://pith.science/api/pith-number/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/graph.json","events_json":"https://pith.science/api/pith-number/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/events.json","paper":"https://pith.science/paper/PMW7MJBH"},"agent_actions":{"view_html":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB","download_json":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB.json","view_paper":"https://pith.science/paper/PMW7MJBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6573&json=true","fetch_graph":"https://pith.science/api/pith-number/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/graph.json","fetch_events":"https://pith.science/api/pith-number/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/action/storage_attestation","attest_author":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/action/author_attestation","sign_citation":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/action/citation_signature","submit_replication":"https://pith.science/pith/PMW7MJBHHBNSZ6Z5BBVGTQ6AFB/action/replication_record"}},"created_at":"2026-05-18T03:05:57.410434+00:00","updated_at":"2026-05-18T03:05:57.410434+00:00"}