{"id":"7868f360-1822-452d-9802-0833200ace3a","arxiv_id":"2606.04864","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"An algebraic two-grid multiscale preconditioner for SPD systems that builds coarse basis functions from the matrix using graph partitioning and local eigenproblems, showing robustness and better performance than standard AMG on Darcy flow tests.","lead":"The paper presents a two-grid algebraic multiscale preconditioner for large sparse SPD matrices from elliptic problems with highly heterogeneous coefficients, constructing the coarse space directly from the matrix via graph partitioning and local generalized eigenvalue solvers. This algebraic approach requires no geometric information and is tested for robustness on heterogeneous Darcy flow problems.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Local generalized eigenproblems on graph-partitioned subdomains may fail to capture global low-energy modes when high-contrast channels cross partition boundaries.","rationale":"The reader's weakest_assumption is precisely the load-bearing point; the abstract-only limitation noted by the reader is secondary once the construction detail is examined. No other internal inconsistency or missing support is visible from the given material.","tokens_in":1596,"tokens_out":307,"duration_ms":14231,"concrete_test":"Construct a 2-D high-contrast test case (contrast 10^6) containing one straight high-conductivity channel that crosses at least three METIS partitions; solve with the reported preconditioner and record PCG iterations. Repeat after re-partitioning with edge weights proportional to |a_ij| so the channel lies inside one subdomain. If the iteration count rises by >2x in the first configuration while remaining stable in the second, the load-bearing assumption fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (robustness w.r.t. contrast and size, superiority to AMG) rests on the coarse space from graph partitioning + local gen-eig solves reliably extracting the slow modes. The matrix graph is partitioned without explicit coefficient weighting, so a thin high-conductivity channel spanning several subdomains will be split; each local eigenproblem then sees only a truncated segment and cannot produce the global mode. This is exactly the condition required for the numerical results on heterogeneous Darcy problems to generalize.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript proposes a two-grid algebraic multiscale preconditioner for large sparse SPD matrices from elliptic problems with highly heterogeneous coefficients. The coarse space is constructed directly from the system matrix via graph partitioning followed by local generalized eigenvalue solves on the subdomains, producing basis functions that capture low-energy modes. The approach requires no geometric information, is naturally parallelizable, and is tested on heterogeneous Darcy flow problems, where it is reported to be robust to coefficient contrast and problem size, to outperform standard algebraic multigrid on large-scale cases, and to exhibit good parallel scalability.","tokens_in":1681,"tokens_out":487,"duration_ms":22681,"significance":"If the central construction reliably extracts the slow modes and the reported numerical behavior generalizes, the method would supply a purely algebraic two-grid preconditioner usable in matrix-only and unstructured settings where geometric multiscale techniques are unavailable. The emphasis on parallel construction and the direct comparison to AMG on challenging heterogeneous cases are concrete strengths that could influence preconditioner design for large-scale elliptic problems.","major_comments":[{"comment":"Abstract and method description: the claim that local generalized eigenvalue problems on graph-partitioned subdomains capture the global low-energy modes responsible for slow convergence is load-bearing for the robustness statement. Because the partitioning uses the unweighted matrix graph, a high-conductivity channel that crosses subdomain boundaries is split; each local eigenproblem then sees only a truncated segment and cannot produce the corresponding global mode. This directly affects whether the reported robustness to arbitrary coefficient contrast holds.","section":"Abstract and method description"},{"comment":"Numerical results section: the superiority to standard AMG and the robustness claims are supported only by the presented Darcy-flow experiments. Without additional tests that deliberately place high-contrast channels across partition boundaries (or an a-priori argument that the local eigenproblems still recover the necessary modes), the generalization from the reported cases to the full class of heterogeneous coefficients remains unverified.","section":"Numerical results section"}],"minor_comments":[{"comment":"The abstract states that the construction is 'naturally parallelizable' but does not quantify the communication pattern or the scaling of the local eigen-solves with subdomain size; a brief remark on this point would improve clarity.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the detailed and constructive report. The two major comments identify a substantive issue with the justification of the method's robustness. We respond point by point below and indicate the revisions we will make.","responses":[{"response":"We agree that the unweighted graph partitioning can split high-conductivity channels and that each local eigenproblem therefore sees only a truncated segment. The manuscript's claim that the local solves capture the global low-energy modes is therefore not accompanied by a rigorous argument that the assembled coarse space recovers the necessary global modes when such splitting occurs. We will revise the method-description section to remove the unqualified statement that the basis functions capture the global low-energy modes and instead describe precisely what the local eigenproblems compute. We will also add a short discussion of the limitation introduced by unweighted partitioning.","revision_made":"yes","referee_comment":"[Abstract and method description] Abstract and method description: the claim that local generalized eigenvalue problems on graph-partitioned subdomains capture the global low-energy modes responsible for slow convergence is load-bearing for the robustness statement. Because the partitioning uses the unweighted matrix graph, a high-conductivity channel that crosses subdomain boundaries is split; each local eigenproblem then sees only a truncated segment and cannot produce the corresponding global mode. This directly affects whether the reported robustness to arbitrary coefficient contrast holds."},{"response":"The existing numerical section contains only the Darcy-flow suite; no experiments deliberately place high-contrast channels across the partition boundaries produced by the unweighted graph partitioner. We will add a new subsection with two such test cases (one 2-D and one 3-D) in which a high-conductivity channel is forced to cross multiple subdomain interfaces. The revised manuscript will report iteration counts and timings for these cases alongside the original suite, allowing the reader to assess whether the observed robustness persists under the splitting scenario identified by the referee.","revision_made":"yes","referee_comment":"[Numerical results section] Numerical results section: the superiority to standard AMG and the robustness claims are supported only by the presented Darcy-flow experiments. Without additional tests that deliberately place high-contrast channels across partition boundaries (or an a-priori argument that the local eigenproblems still recover the necessary modes), the generalization from the reported cases to the full class of heterogeneous coefficients remains unverified."}],"tokens_in":1297,"tokens_out":500,"duration_ms":18037,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that the paper gives a matrix-only two-grid algebraic multiscale preconditioner. The coarse basis is built by partitioning the graph of the input matrix and solving local generalized eigenvalue problems on the resulting subdomains. This is meant to capture low-energy modes for SPD systems from heterogeneous elliptic problems without needing any geometry.\n\nIt does a straightforward job of describing a parallel construction that works from the matrix alone, which can matter for unstructured or black-box settings. The abstract reports numerical tests on heterogeneous Darcy flows that claim robustness to contrast and size, plus better results than standard AMG on some large cases.\n\nThe soft spot is the partitioning step. It uses the unweighted matrix graph, so a high-conductivity channel that runs across several subdomains gets split. Each local eigenproblem then sees only a fragment and cannot produce the full global mode that slows convergence. The abstract asserts the method is robust, but nothing in the description shows how the tests avoid this situation or whether the local solves are modified to compensate. If the experiments do not include crossing channels, the central claim does not generalize.\n\nThe rest of the approach follows standard combinations of graph partitioning and local spectral methods. No circularity is visible from what is given.\n\nThis is for people who need algebraic preconditioners for large elliptic systems in porous-media or similar codes. A reader already working on matrix-only multiscale methods might want to look at the construction and the reported timings.\n\nIt should go to peer review so the numerical evidence can be checked against the crossing-channel case.","headline":"This algebraic two-grid preconditioner builds a coarse space from matrix-graph partitioning plus local generalized eigenproblems, but the robustness claim for high-contrast elliptic problems looks vulnerable when channels cross partitions.","tokens_in":2157,"tokens_out":397,"would_cite":false,"duration_ms":26053,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A two-grid algebraic multiscale preconditioner builds its coarse space directly from the matrix via graph partitioning and local eigenvalue solves to handle high-contrast elliptic problems without geometry.","keywords":["algebraic multiscale preconditioner","symmetric positive definite matrices","heterogeneous coefficients","graph partitioning","generalized eigenvalue problems","Darcy flow","parallel scalability","multigrid methods"],"falsifier":"A Darcy flow test with extreme coefficient contrast where the number of preconditioned Krylov iterations fails to decrease or grows as the contrast ratio increases.","tokens_in":2487,"feed_emoji":"","tokens_out":648,"duration_ms":21378,"temperature":0.7,"pith_summary":"The paper introduces a two-grid algebraic multiscale preconditioner designed for large sparse symmetric positive definite matrices that arise from elliptic partial differential equations with highly heterogeneous coefficients. It constructs the necessary coarse space directly from the matrix entries using graph partitioning to divide the problem and local generalized eigenvalue problems to identify important modes. This construction avoids any need for underlying geometric information, which makes the method applicable to unstructured grids or situations where only the matrix is available. The authors demonstrate through numerical experiments on heterogeneous Darcy flow that the resulting preconditioner maintains robustness across varying coefficient contrasts and problem sizes while showing better performance than standard algebraic multigrid approaches on difficult large-scale problems and exhibiting good parallel scalability.","feed_headline":"Algebraic coarse space preconditions high-contrast elliptic problems","feed_subtitle":"Graph partitioning and local eigenvalue solves capture low-energy modes in large sparse SPD systems without geometry.","key_machinery":"Graph partitioning of the matrix followed by local generalized eigenvalue solves to generate coarse basis functions that capture low-energy modes.","core_discovery":"The central discovery is a two-grid algebraic multiscale preconditioner whose coarse space is obtained by graph partitioning the system matrix and solving local generalized eigenvalue problems on the resulting subdomains. This produces basis functions that capture the low-energy modes responsible for slow convergence in highly heterogeneous elliptic problems. The method operates without geometric information and is naturally parallelizable in its construction.","pith_inferences":["The same partitioning-plus-local-eigenvalue construction could be tested on other elliptic operators such as linear elasticity or anisotropic diffusion.","Replacing the two-grid structure with a recursive multilevel version might further improve scalability for problems exceeding current test sizes.","The approach may combine with existing sparse-direct or iterative solvers in standard libraries to reduce overall setup time.","Varying the number of eigenvectors retained per subdomain offers a tunable parameter for trading setup cost against iteration count."],"forward_implications":["The preconditioner remains robust with respect to coefficient contrast and problem size for heterogeneous Darcy flow problems.","It outperforms standard algebraic multigrid on challenging large-scale cases.","Construction and application exhibit good parallel scalability.","The method applies directly to unstructured meshes and matrix-only inputs."],"fun_headline_variants":["Algebraic multiscale preconditioner from graph partitioning of SPD matrix","Two-grid algebraic preconditioner uses local eigenvalue problems on SPD matrices","Graph partitioning builds coarse space for multiscale SPD preconditioning","Local generalized eigenvalues precondition large heterogeneous SPD systems"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The coarse space from graph partitioning and local generalized eigenvalue solves will reliably capture the global low-energy modes responsible for slow convergence in highly heterogeneous elliptic problems.","fun_headline_variants_meta":{"raw":{"variants":["Algebraic multiscale preconditioner from graph partitioning of SPD matrix","Two-grid algebraic preconditioner uses local eigenvalue problems on SPD matrices","Graph partitioning builds coarse space for multiscale SPD preconditioning","Local generalized eigenvalues precondition large heterogeneous SPD systems"]},"model":"grok-4.3","cost_usd":0.005299,"raw_usage":{"total_tokens":2492,"prompt_tokens":530,"num_sources_used":0,"completion_tokens":64,"cost_in_usd_ticks":52987000,"prompt_tokens_details":{"text_tokens":530,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1898,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":530,"tokens_out":64,"duration_ms":17394,"temperature":1.0,"reasoning_tokens":1898,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T05:04:21.020444+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A Darcy flow test with extreme coefficient contrast where the number of preconditioned Krylov iterations fails to decrease or grows as the contrast ratio increases.","supporting_citations":[],"review_version":1}