{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DDIJZPJUWFRBO3RVW4B76KBAZO","short_pith_number":"pith:DDIJZPJU","schema_version":"1.0","canonical_sha256":"18d09cbd34b162176e35b703ff2820cbbc2ec2b562267fc9d40cabd6643b664d","source":{"kind":"arxiv","id":"2511.18996","version":2},"attestation_state":"computed","paper":{"title":"Local Multilevel Preconditioned Jacobi-Davidson Method for Elliptic Eigenvalue Problems on Adaptive Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A local multilevel preconditioned Jacobi-Davidson method achieves optimal O(N) complexity and uniform convergence for elliptic eigenvalue problems on adaptive meshes.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jianing Guo, Qigang Liang, Xuejun Xu","submitted_at":"2025-11-24T11:21:20Z","abstract_excerpt":"In this work, we propose an efficient adaptive multilevel preconditioned Jacobi-Davidson (PJD) method for eigenvalue problems with singularity. Our multilevel method utilizes a local smoothing strategy to solve the preconditioned Jacobi-Davidson algebraic systems arising from adaptive finite element methods (AFEM). As a result, the algorithm holds optimal computational complexity $O(N)$. The theoretical analysis reveals that our method has a uniform convergence rate with respect to mesh levels and degrees of freedom. Further, the convergence rate is not affected by highly discontinuous coeffic"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2511.18996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-11-24T11:21:20Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"65f303106e46da335db43086ef0fb1a3c16f4fc9f2ec3eefbbd5a94a6a29442e","abstract_canon_sha256":"122cc407cc9733e102eb897a17d3e8be010282456b1720b05cf02035a65d4906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:32.988213Z","signature_b64":"0XjaoP/aXtZ6oQa5ZUt0mVfjIQouJKMKiJ9HQCgyJhzZZS4HpAppy+kaMxzKxnyJ350rbp3B7Z9HmHPyxYkWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18d09cbd34b162176e35b703ff2820cbbc2ec2b562267fc9d40cabd6643b664d","last_reissued_at":"2026-05-18T03:09:32.987504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:32.987504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Multilevel Preconditioned Jacobi-Davidson Method for Elliptic Eigenvalue Problems on Adaptive Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A local multilevel preconditioned Jacobi-Davidson method achieves optimal O(N) complexity and uniform convergence for elliptic eigenvalue problems on adaptive meshes.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jianing Guo, Qigang Liang, Xuejun Xu","submitted_at":"2025-11-24T11:21:20Z","abstract_excerpt":"In this work, we propose an efficient adaptive multilevel preconditioned Jacobi-Davidson (PJD) method for eigenvalue problems with singularity. Our multilevel method utilizes a local smoothing strategy to solve the preconditioned Jacobi-Davidson algebraic systems arising from adaptive finite element methods (AFEM). As a result, the algorithm holds optimal computational complexity $O(N)$. The theoretical analysis reveals that our method has a uniform convergence rate with respect to mesh levels and degrees of freedom. Further, the convergence rate is not affected by highly discontinuous coeffic"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our multilevel method utilizes a local smoothing strategy to solve the preconditioned Jacobi-Davidson algebraic systems arising from adaptive finite element methods (AFEM). As a result, the algorithm holds optimal computational complexity O(N). The theoretical analysis reveals that our method has a uniform convergence rate with respect to mesh levels and degrees of freedom. Further, the convergence rate is not affected by highly discontinuous coefficients within the domain.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The local smoothing strategy on the newest mesh elements produces a sufficiently accurate preconditioner for the Jacobi-Davidson correction equation at every level; this is invoked in the complexity and convergence analysis but its precise error bound relative to the global residual is not visible in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A local multilevel preconditioned Jacobi-Davidson solver for singular elliptic eigenvalue problems on adaptive meshes achieves O(N) complexity and uniform convergence independent of mesh level and coefficient discontinuities.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A local multilevel preconditioned Jacobi-Davidson method achieves optimal O(N) complexity and uniform convergence for elliptic eigenvalue problems on adaptive meshes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"91113d7eaa20d149e3bc88b99440de14d82a4cc7b6b64524f6f454c0b5df0807"},"source":{"id":"2511.18996","kind":"arxiv","version":2},"verdict":{"id":"0b1412cb-7a73-4c6f-83fe-6ed42461c050","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T05:36:46.793909Z","strongest_claim":"Our multilevel method utilizes a local smoothing strategy to solve the preconditioned Jacobi-Davidson algebraic systems arising from adaptive finite element methods (AFEM). As a result, the algorithm holds optimal computational complexity O(N). The theoretical analysis reveals that our method has a uniform convergence rate with respect to mesh levels and degrees of freedom. Further, the convergence rate is not affected by highly discontinuous coefficients within the domain.","one_line_summary":"A local multilevel preconditioned Jacobi-Davidson solver for singular elliptic eigenvalue problems on adaptive meshes achieves O(N) complexity and uniform convergence independent of mesh level and coefficient discontinuities.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The local smoothing strategy on the newest mesh elements produces a sufficiently accurate preconditioner for the Jacobi-Davidson correction equation at every level; this is invoked in the complexity and convergence analysis but its precise error bound relative to the global residual is not visible in the abstract.","pith_extraction_headline":"A local multilevel preconditioned Jacobi-Davidson method achieves optimal O(N) complexity and uniform convergence for elliptic eigenvalue problems on adaptive meshes."},"references":{"count":21,"sample":[{"doi":"10.1007/s00211-008-0169-3","year":2008,"title":"Dai, X., Xu, J., Zhou, A.: Convergence and optimal complexity of adaptive finite element eigenvalue computations. Numer. Math.110(3), 313–355 (2008) https: //doi.org/10.1007/s00211-008-0169-3","work_id":"7699901b-9dc7-4ed1-92d0-1411d58d4a68","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/s1064827501383713","year":2002,"title":"Chen, Z., Dai, S.: On the efficiency of adaptive finite element methods for elliptic problems with discontinuous coefficients. SIAM J. Sci. Comput.24(2), 443–462 (2002) https://doi.org/10.1137/S106482","work_id":"2978eb4e-e755-4a5f-918a-0d0e6d17e1b2","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1093/imanum/dru059","year":1934,"title":"Dai, X., He, L., Zhou, A.: Convergence and quasi-optimal complexity of adaptive finite element computations for multiple eigenvalues. IMA J. Numer. Anal.35(4), 1934–1977 (2015) https://doi.org/10.1093","work_id":"b22e4aea-dc3c-432e-92a7-8fb38f8a2a68","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s00211-014-0671-8","year":2015,"title":"Gallistl, D.: An optimal adaptive FEM for eigenvalue clusters. Numer. Math. 130(3), 467–496 (2015) https://doi.org/10.1007/s00211-014-0671-8","work_id":"d98d154a-0f68-4e51-b52f-1a6b680451ce","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1090/mcom/3549","year":2020,"title":"Canc` es, E., Dusson, G., Maday, Y., Stamm, B., Vohral´ ık, M.: Guaranteed a pos- teriori bounds for eigenvalues and eigenvectors: multiplicities and clusters. Math. Comp.89(326), 2563–2611 (2020) htt","work_id":"df14ebc8-27d0-496f-9f85-eff43219cb02","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":21,"snapshot_sha256":"db310a7ba09275c84ab2345a9a0c9934665bd1e5ded4719c2de48f73d0e2081b","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"520c3eee13541d3b133131a8dc73e3002fb3e8f4c5952a6535cb48a8badbd8cd"},"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":"2511.18996","created_at":"2026-05-18T03:09:32.987607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.18996v2","created_at":"2026-05-18T03:09:32.987607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.18996","created_at":"2026-05-18T03:09:32.987607+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDIJZPJUWFRB","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDIJZPJUWFRBO3RV","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDIJZPJU","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO","json":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO.json","graph_json":"https://pith.science/api/pith-number/DDIJZPJUWFRBO3RVW4B76KBAZO/graph.json","events_json":"https://pith.science/api/pith-number/DDIJZPJUWFRBO3RVW4B76KBAZO/events.json","paper":"https://pith.science/paper/DDIJZPJU"},"agent_actions":{"view_html":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO","download_json":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO.json","view_paper":"https://pith.science/paper/DDIJZPJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.18996&json=true","fetch_graph":"https://pith.science/api/pith-number/DDIJZPJUWFRBO3RVW4B76KBAZO/graph.json","fetch_events":"https://pith.science/api/pith-number/DDIJZPJUWFRBO3RVW4B76KBAZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO/action/storage_attestation","attest_author":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO/action/author_attestation","sign_citation":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO/action/citation_signature","submit_replication":"https://pith.science/pith/DDIJZPJUWFRBO3RVW4B76KBAZO/action/replication_record"}},"created_at":"2026-05-18T03:09:32.987607+00:00","updated_at":"2026-05-18T03:09:32.987607+00:00"}