{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GGEDJS5BABUEQL7HU3PEEFPD24","short_pith_number":"pith:GGEDJS5B","schema_version":"1.0","canonical_sha256":"318834cba10068482fe7a6de4215e3d709a7d990e6c6a7f94774610a3b22c566","source":{"kind":"arxiv","id":"1507.04008","version":1},"attestation_state":"computed","paper":{"title":"Neumann-Neumann Waveform Relaxation Algorithm in Multiple subdomains for Hyperbolic Problems in 1D and 2D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.AP","authors_text":"Bankim C. Mandal","submitted_at":"2015-07-14T20:08:10Z","abstract_excerpt":"We present a Waveform Relaxation (WR) version of the Neumann-Neumann algorithm for the wave equation in space-time. The method is based on a non-overlapping spatial domain decomposition, and the iteration involves subdomain solves in space-time with corresponding interface condition, followed by a correction step. Using a Fourier-Laplace transform argument, for a particular relaxation parameter, we prove convergence of the algorithm in a finite number of steps for finite time intervals. The number of steps depends on the size of the subdomains and the time window length on which the algorithm "},"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":"1507.04008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-07-14T20:08:10Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"dcb4e87f9724d405535fd9fdcd435f635480ccd3356c69bc190430a065d915d3","abstract_canon_sha256":"a2e21a3145f2610ef18bef426e10f75b48029553791608b07795b8eaeed7dc91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:44.395243Z","signature_b64":"e3cbhVc2rWrOekiIhjBGad8TlbKKM83vXXbg4TQeR1Iey2z6LdJHVCIULxsggPwJBtmfznAyjRlEMkiZSBLFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"318834cba10068482fe7a6de4215e3d709a7d990e6c6a7f94774610a3b22c566","last_reissued_at":"2026-05-18T01:36:44.394610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:44.394610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neumann-Neumann Waveform Relaxation Algorithm in Multiple subdomains for Hyperbolic Problems in 1D and 2D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.AP","authors_text":"Bankim C. Mandal","submitted_at":"2015-07-14T20:08:10Z","abstract_excerpt":"We present a Waveform Relaxation (WR) version of the Neumann-Neumann algorithm for the wave equation in space-time. The method is based on a non-overlapping spatial domain decomposition, and the iteration involves subdomain solves in space-time with corresponding interface condition, followed by a correction step. Using a Fourier-Laplace transform argument, for a particular relaxation parameter, we prove convergence of the algorithm in a finite number of steps for finite time intervals. The number of steps depends on the size of the subdomains and the time window length on which the algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04008","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":"1507.04008","created_at":"2026-05-18T01:36:44.394699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04008v1","created_at":"2026-05-18T01:36:44.394699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04008","created_at":"2026-05-18T01:36:44.394699+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGEDJS5BABUE","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGEDJS5BABUEQL7H","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGEDJS5B","created_at":"2026-05-18T12:29:22.688609+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/GGEDJS5BABUEQL7HU3PEEFPD24","json":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24.json","graph_json":"https://pith.science/api/pith-number/GGEDJS5BABUEQL7HU3PEEFPD24/graph.json","events_json":"https://pith.science/api/pith-number/GGEDJS5BABUEQL7HU3PEEFPD24/events.json","paper":"https://pith.science/paper/GGEDJS5B"},"agent_actions":{"view_html":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24","download_json":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24.json","view_paper":"https://pith.science/paper/GGEDJS5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04008&json=true","fetch_graph":"https://pith.science/api/pith-number/GGEDJS5BABUEQL7HU3PEEFPD24/graph.json","fetch_events":"https://pith.science/api/pith-number/GGEDJS5BABUEQL7HU3PEEFPD24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24/action/storage_attestation","attest_author":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24/action/author_attestation","sign_citation":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24/action/citation_signature","submit_replication":"https://pith.science/pith/GGEDJS5BABUEQL7HU3PEEFPD24/action/replication_record"}},"created_at":"2026-05-18T01:36:44.394699+00:00","updated_at":"2026-05-18T01:36:44.394699+00:00"}