{"id":"6398401e-abeb-458b-8e0d-1afaf71ca720","arxiv_id":"2501.16248","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"A new algebraic multigrid algorithm coarsens PDE systems by coarsening a nodal dual problem and constructing orientation-aware averages along paths, yielding near-kernel-preserving interpolation for curl-curl, grad-div, and Stokes systems.","lead":"This paper introduces a new algebraic multigrid coarsening and interpolation method for systems of partial differential equations with large near-kernels, such as Maxwell's curl-curl equations and Stokes flow. The method coarsens a nodal dual problem and constructs coarse variables by averaging edge unknowns along paths, and tests show it can reproduce geometric multigrid behavior on structured meshes.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Arbitrary length-two path selection in Algorithm 4.1 is the unproven load-bearing step: it can break near-kernel preservation and coarse re-discretization on unstructured/boundary meshes.","rationale":"The paper's two central contributions—matching coarsening and interpolation—are concentrated in Algorithm 4.1. The only mechanism for preserving near kernels is the signed averaging over length-two paths. If path selection is arbitrary, there is no proof that the coarse variables preserve the near-kernel components on unstructured meshes, and the boundary-triangle experiment is direct evidence of failure in a concrete case. The missing proof for dropping S_E compounds the issue but is secondary; the primary risk is that the algebraic construction does not enforce the property on which the headline claim depends. The reader's weakest assumption already identified boundary degradation and the assumption that paths preserve near-kernel components, so this stress-test largely aligns with that reading. Since the concern is already reflected in the conditional verdict, no change to that verdict is needed.","tokens_in":9175,"tokens_out":2617,"duration_ms":27279,"concrete_test":"Enumerate all valid path choices in Algorithm 4.1 for a small triangular mesh with Dirichlet boundary (e.g., n around 1000, realized by permuting DoF labels to exercise different tie-breaks) and compute the two-grid convergence rate and the coarse near-kernel residual ||P^T A P N_c||/||N_c|| for each choice. If the rate or residual varies materially (e.g., max-min > 0.05), the arbitrary path choice is load-bearing and the abstract claim must be qualified. If all choices give essentially the reported rate near 0.94 and equivalent coarse residuals, the concern is settled in the paper's favor.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (abstract: 'when the coarse variables align with the geometric refinement, our method reproduces re-discretization on unstructured meshes') rests on Algorithm 4.1 preserving every near-kernel component through coarse variables built from length-two paths. Section 4.3 says that when multiple paths exist between coarse nodes, 'we only pick one of them based on the labeling order for simplicity.' No argument shows that the chosen path is the one whose orientation matches the near-kernel structure encoded in N, and the paper's own triangular Dirichlet experiment (Figure 6.1b, rate 0.94; Section 4.3 discussion of excluded near-kernel modes near boundaries) is direct evidence that the construction can miss near-kernel components in realistic settings. In addition, the simplification R:=REG and S:=SI requires dropping S_E; the paper offers only a numerically observed range equivalence via a post-scaling transformation (Section 4.2), not a proof. Thus the reproduction claim is not guaranteed by the algebraic construction; it is contingent on favorable path selection and boundary placement.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an algebraic multigrid (AMG) coarsening and interpolation scheme for symmetric positive definite systems with large near-kernels, targeting H(curl), H(div), and Stokes-type PDE systems. The setup has three stages: (i) an automatic smoother construction that detects local near-kernels N via local eigen-decompositions (Algorithm 3.1, based on prior work); (ii) a coarsening stage that performs a classical C/F splitting on the nodal dual matrix N^T A N and then builds coarse variables R and fine variables S by forming oriented length-two paths between coarse nodes, with signs taken from the rows of N (Algorithm 4.1); and (iii) an interpolation stage that computes a sparse approximation of the ideal interpolation operator P* = (I - S(S^T A S)^{-1} S^T A) R^T and uses the Galerkin coarse operator. The authors claim that, when the coarse variables align with the geometric refinement, the method reproduces re-discretization on unstructured meshes. Numerical experiments on uniform quadrilateral and triangular meshes for curl-curl problems (periodic and Dirichlet boundary conditions) and on a periodic MAC Stokes problem show convergence rates that are competitive with geometric interpolation and far better than classical pointwise ideal interpolation, although the Dirichlet triangle case has a slow asymptotic rate of 0.94.","tokens_in":9367,"tokens_out":4907,"duration_ms":46458,"significance":"If the proposed construction works as broadly as claimed, it would be a valuable contribution: it provides a genuinely algebraic way to build coarse variables that preserve the near-kernel structure of H(curl), H(div), and Stokes systems, without explicit geometric mesh information, and it packages this with an automatic smoother and a complete two-grid method. The idea of coarsening the nodal dual problem N^T A N and then defining coarse variables as oriented averages along paths is concrete and novel, and the numerical evidence on periodic quad and Stokes problems is encouraging. The paper also correctly uses compatible relaxation as a diagnostic: the reported CR rates match the observed two-grid rates, including the degraded Dirichlet case, which lends credibility to the measurement methodology. However, the strength of the central claim in the abstract is not matched by the evidence: no unstructured mesh is tested, the one boundary-sensitive test degrades substantially, and two load-bearing steps rest on numerical observation rather than analysis.","major_comments":[{"comment":"The arbitrary length-two path selection is a load-bearing step that is not justified. The paragraph in Section 4.3 states that 'If multiple paths exist between them, we only pick one of them based on the labeling order for simplicity.' The coarse variable constructed in line 9 of Algorithm 4.1 preserves a near-kernel component only if the chosen path carries the correct orientation information; no argument is given that the labeling-order path does so, and no characterization is given of the configurations in which such a path exists. The paper's own Dirichlet triangle experiment (Section 6.1, Figure 6.1b) demonstrates that the construction can miss near-kernel components near boundaries, producing an asymptotic two-grid rate of 0.94, and the text attributes this precisely to missing paths to boundary coarse nodes. This is direct evidence that the path-selection heuristic can fail in realistic settings. Consequently, the abstract's claim that the method 'reproduces re-discretization on unstructured meshes' is not established by the presented construction or experiments.","section":"Algorithm 4.1 and Section 4.3"},{"comment":"Dropping S_E from the coarse variables is justified only by a numerically computed post-scaling transformation, not by analysis. The text says: 'we find that we can completely drop the SE term from the definition of R and that the range of this approximation and that of using RE and SE defined in (4.2) are the same. Though we have not found an appropriate analytical form, we are able to compute a post-scaling transformation numerically that establishes the equivalence ... for a set of example problems and coarse grids.' This is a central algorithmic step because the final choices R := REG and S := SI do not form the full GAMG splitting assumed in Section 1 (Eq. (1.4) with RS=0, S^T S=I, R R^T=I); the paper itself notes that the splitting is only partial, with dim(span(R^T)) + dim(span(S)) <= n. The convergence theory in Section 1, including Eq. (1.3) and the ideal interpolation formula (1.5), relies on the full-splitting orthogonality conditions. Without an analysis of the range equivalence or of the error introduced by the partial splitting, the theoretical support for the final interpolation operator is incomplete, and the claim that the method follows the GAMG ideal-interpolation framework is only heuristic.","section":"Section 4.2, Eq. (4.4)-(4.5)"},{"comment":"The numerical experiments do not support the unstructured-mesh claim in the abstract. All curl-curl experiments in Section 6 are on uniform quadrilateral meshes with periodic boundary conditions or on a uniform triangular mesh with a straight Dirichlet boundary; the Stokes experiment is also on a uniform periodic quadrilateral MAC mesh. No genuinely unstructured mesh (variable topology, irregular node distribution, curved or reentrant boundaries) is tested. Moreover, the only non-periodic test, the Dirichlet triangle in Figure 6.1b, shows a notably degraded rate (0.94) that the authors attribute to missing near-kernel components near the boundary. The abstract states that 'when the coarse variables align with the geometric refinement, our method reproduces re-discretization on unstructured meshes,' but the evidence only supports a much weaker statement: on structured meshes where the algorithm happens to recover geometric refinement, the two-grid rate is close to the geometric interpolation rate. The claim should either be substantiated with unstructured-mesh experiments or qualified accordingly.","section":"Abstract and Section 6"}],"minor_comments":[{"comment":"The matrix R is used in the expression K(P R) before it is defined; the definition of R as a restriction matrix with RP = I_c appears only after Eq. (1.3). Please introduce R before its first use.","section":"Section 1, Eq. (1.3)"},{"comment":"The notation for constructing the column of R^T is difficult to parse: the expression 'RT = [RT · · · 0 [±1]DoF1 · · · 0 · · · [±1]DoF2 0 · · ·]^T' mixes a recursive appearance of R^T with the new column. A clearer notation, e.g., appending a column vector with two nonzero entries, would aid reproducibility.","section":"Algorithm 4.1, line 9"},{"comment":"The claim that a post-scaling transformation establishes range equivalence 'for a set of example problems and coarse grids' is not accompanied by any details, table, or figure documenting those examples. Since this is a key step, at least a concise summary of the verification should be provided.","section":"Section 4.2, paragraph after Eq. (4.4)"},{"comment":"The sentence 'we focus only the primary global Stokes system' appears to be missing the word 'on' and should read 'we focus only on the primary global Stokes system.' The identity 'Ae = −∆ + βI = ∇ × ∇ × −∇∇ · +βI' also appears typographically garbled; the second term should presumably be '-∇∇·'.","section":"Section 5"},{"comment":"The text states that the asymptotic rate in Figure 6.1b is 0.94, but this value is not directly annotated in the plot; please add a label or a text reference so the reader can verify the number against the curve.","section":"Section 6.1, Figure 6.1"},{"comment":"The concluding sentence describing future work ('use CR to identify inadequately coarsened regions and add coarse variables iteratively') essentially acknowledges that the current algorithm, without adaptive enrichment, is not fully robust near boundaries. This is a useful limitation statement, but it should be moved to or echoed in the numerical results section so that the boundary degradation is presented as a known limitation of the current method, not only as future work.","section":"Section 7, Conclusions"}],"recommendation":"major_revision","confidential_remarks":"The paper reports an interesting algorithmic idea and the numerical results on periodic structured meshes are persuasive. The main gap is that the abstract's central claim is stronger than the evidence: no unstructured mesh tests are presented, the boundary case degrades substantially, and the two key simplifications (dropping S_E and arbitrary path selection) are justified only heuristically or numerically. I would encourage the authors to either provide a theoretical analysis of the path-selection condition under which near-kernels are preserved, or add experiments on genuinely unstructured meshes and restrict the abstract's claim accordingly. The paper is within the scope of the journal and is likely publishable after this work; the issues are fixable within the manuscript's scope, so I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Briefly: this paper describes a way to build AMG coarsening and interpolation for curl-curl, grad-div, and Stokes systems by coarsening a nodal dual problem N^T A N and then forming coarse variables as orientation-aware averages along length-two paths in the original graph. That is a new combination, and Algorithm 4.1 is concrete and implementable. The numerical results on periodic quadrilateral meshes show two-grid rates close to the geometric ideal, and the PCG test confirms the coarse space is capturing the near-kernel components. The Stokes experiments (MAC scheme with Vanka smoothing) are a nice extension and suggest the idea transfers to saddle-point problems.\n\nThe main weakness is that the two load-bearing simplifications—dropping S_E from the coarse variables and picking an arbitrary one of several length-two paths—are justified by numerical observation rather than analysis. The paper states the range equivalence after dropping S_E is established by a post-scaling transformation, but no proof is given. The stress-test concern about arbitrary path selection is fair: when multiple paths connect two coarse nodes, the chosen path may not align with the near-kernel structure encoded in N, and the paper offers no argument that it does. The Dirichlet triangle case (rate 0.94) is direct evidence that the construction can miss near-kernel modes near boundaries, and the paper honestly says so.\n\nThe abstract claims the method 'reproduces re-discretization on unstructured meshes,' but the experiments only use uniform meshes, so that claim is stronger than the evidence. The paper also doesn't compare against established specialized solvers (e.g., Hiptmair smoothers or ADS/AMS), which would help calibrate the practical value.\n\nNone of this sinks the paper. The core idea is interesting, the algorithm is clearly specified, and the authors are upfront about the open issues. The boundary degradation is a known limitation with suggested fixes. The lack of analysis for S_E is a gap a referee should push on, but it's not a fatal error; the numerical evidence is suggestive.\n\nWho is this for? Researchers working on algebraic multigrid for Maxwell and Stokes problems, and anyone who wants a concrete alternative to geometric coarsening for H(curl)/H(div). It deserves a serious referee: the referees should ask for comparisons, a refined discussion of path selection, and ideally an analysis or at least a systematic study of when the range equivalence holds. I would accept it for review with major revisions.\n\nFor my own work, I'd cite it as a current example of nodal coarsening for near-kernel systems.","headline":"A useful new coarsening idea for AMG on H(curl)/H(div)/Stokes systems, with honest accounting of the parts that are still heuristic; worth a serious referee.","tokens_in":9920,"tokens_out":4118,"would_cite":true,"duration_ms":37655,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65N55","65F10","65N30"],"pacs":[],"model":"deepseek-v4-flash","headline":"An algebraic AMG coarsening for PDE systems preserves near-kernel components by averaging along length-two paths of a nodal dual problem, and matches geometric re-discretization when the paths align with refinement.","keywords":["algebraic multigrid","compatible relaxation","ideal interpolation","H(curl)","H(div)","Stokes system","near-kernel approximation","nodal coarsening"],"falsifier":"Run the two-grid solver on a uniform triangular mesh with Dirichlet boundary conditions for the curl-curl problem at $\\beta = 0.01$ and watch the convergence rate as the mesh is refined: the paper's own result shows the rate settling at 0.94, so if the rate does not improve once boundary-adjacent coarse variables are added, the claim that the algebraic coarse space always contains the full near-kernel is false in that setting.","tokens_in":8968,"feed_emoji":"🧮","tokens_out":10179,"duration_ms":81539,"temperature":0.7,"pith_summary":"This paper tries to make algebraic multigrid work for systems of PDEs whose matrices have large near-nullspaces—the curl-curl, grad-div, and Stokes problems—where ordinary pointwise smoothers and injection coarsening fail. Its proposal is to coarsen a nodal 'dual' problem built from an automatically computed near-kernel matrix and then to form each coarse variable as an orientation-consistent average of two fine unknowns along a short path, which preserves the near-kernel components on the coarse grid without using any geometric mesh information. If this works, AMG for these systems becomes a practical two-grid method with interpolation that is sparser than the ideal harmonic extension, and on structured meshes it exactly reproduces the coarse-grid re-discretization one would write down geometrically.","feed_headline":"Algebraic AMG reproduces re-discretization for PDE systems","feed_subtitle":"Coarsening a nodal dual problem with path averages gives H(curl), H(div), and Stokes solvers without mesh geometry.","key_machinery":"The load-bearing mechanism is Algorithm 4.1, which works as follows: the near-kernel finder Algorithm 3.1 (local eigen-decompositions on diameter-$m$ sets, filtered by an eigenvalue threshold) supplies a matrix $N$ of near-kernel vectors; the algorithm forms the nodal dual matrix $A_N = N^T A N$ and coarsens it with a classical C/F splitting; then for every pair of coarse nodes that are distance-two neighbors in the graph of $A_N$, it picks one mutual distance-one neighbor and selects two fine DoFs forming a length-two path, adding a row to $R^T$ that has $\\pm 1$ entries at those DoFs with signs fixed by $N$. The remaining DoFs become the fine basis $S = [I, 0]^T$, and the interpolation is the local harmonic extension $P_\\star = (I - S(S^T A S)^{-1} S^T A) R^T$. The property that matters is that this path averaging keeps the orientation information of the underlying near-kernel in the coarse space, something injection coarsening cannot do when near-kernels overlap.","core_discovery":"The central claim is that the near-kernels of H(curl), H(div), and Stokes systems can be preserved algebraically in an AMG coarse space by running a classical C/F splitting on the nodal dual matrix $N^T A N$, where $N$ is a matrix of local near-kernel vectors, and then defining each coarse variable as the sum of two fine DoFs that lie on a length-two path between coarse nodes, with signs taken from the corresponding rows of $N$. This construction decouples the fine and coarse variables completely, so the resulting ideal interpolation $P_\\star = (I - S(S^T A S)^{-1} S^T A) R^T$ is sparse and local. When the path selection coincides with geometric mesh refinement, the algebraic interpolation reproduces the geometric interpolation (and hence re-discretization) for structured and unstructured meshes alike, and the same machinery applies to the Stokes saddle-point system by identifying it with a curl-curl problem on a dual mesh.","pith_inferences":["The Dirichlet-triangle result (rate 0.94) suggests a cheap remedy the paper leaves implicit: run CR globally, locate regions where the coarse variables miss the near-kernel (near boundaries), and add extra coarse variables there before building interpolation.","The path selection in Algorithm 4.1 picks one arbitrary length-two path when several exist; one could replace this with a matching optimization minimizing the energy of the resulting interpolation, which may improve robustness on very unstructured meshes.","Because the method identifies curl-curl, grad-div, and Stokes coarsening, the same nodal-dual construction may transfer to other de Rham complex discretizations, such as H(div)-conforming magnetostatics or nearly incompressible elasticity, where the near-kernel is a gradient or curl of a smaller space.","The equivalence between path-based coarse variables and geometric refinement could be turned into an algebraic test: the degree to which the algebraic coarsening matches re-discretization measures how 'geometric' an unstructured mesh actually is."],"forward_implications":["AMG setup for H(curl), H(div), and grad-div systems reduces to a classical AMG coarsening of the nodal dual matrix $N^T A N$, so no geometric mesh information is required.","The coarse and fine variables are completely decoupled, giving an interpolation that is sparser than the global ideal harmonic extension while still preserving near-kernels.","Wherever the algebraic length-two paths agree with the geometric refinement pattern, the method reproduces the re-discretized coarse operator, so convergence matches the geometric multigrid baseline.","The Stokes system can be coarsened with the same rules by treating pressure as nodal and velocity as edge degrees of freedom on a dual mesh; the coarse velocities then preserve the discrete divergence constraint.","Compatible relaxation on the selected coarse variables predicts the two-grid convergence rate, making CR a practical monitor for coarsening quality."],"supporting_citations":[{"why":"Supplies the GAMG framework and the ideal interpolation formula that the paper modifies.","marker":"[6]"},{"why":"Provides the two-grid convergence estimates that link compatible relaxation speed to uniform two-level convergence.","marker":"[7]"},{"why":"Gives the optimal interpolation and compatible relaxation theory used to design and monitor the coarsening.","marker":"[3]"},{"why":"Algorithm 3.1 for automated smoother construction (local near-kernel computation) is taken from this thesis.","marker":"[5]"},{"why":"Serves as the algebraic precursor for preserving near-kernels on the coarse mesh by averaging with correct orientations.","marker":"[13]"},{"why":"Defines the optimal interpolation used as the benchmark in the numerical comparisons.","marker":"[1]"},{"why":"Supplies the lowest-order Nédélec finite elements used to discretize the H(curl) systems.","marker":"[12]"}],"fun_headline_variants":["Algebraic coarsening reproduces re-discretization for PDE systems","New AMG coarsening gives sparse ideal interpolation for PDE systems","Algebraic multigrid preserves near-kernels without mesh geometry","Nodal dual coarsening yields Stokes solvers from algebraic AMG"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole construction assumes the local near-kernel finder (Algorithm 3.1) catches every smooth mode the smoother cannot remove, and that coarsening $N^T A N$ with length-two paths preserves every one of those modes on the coarse grid; the Dirichlet-triangle test (rate 0.94) shows this can fail near boundaries.","fun_headline_variants_meta":{"raw":{"variants":["Algebraic coarsening reproduces re-discretization for PDE systems","New AMG coarsening gives sparse ideal interpolation for PDE systems","Algebraic multigrid preserves near-kernels without mesh geometry","Nodal dual coarsening yields Stokes solvers from algebraic AMG"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000499,"raw_usage":{"total_tokens":2448,"prompt_tokens":954,"completion_tokens":1494,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":570,"completion_tokens_details":{"reasoning_tokens":1417}},"tokens_in":570,"tokens_out":1494,"duration_ms":10466,"temperature":1.0,"reasoning_tokens":1417,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T13:36:27.786395+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the two-grid solver on a uniform triangular mesh with Dirichlet boundary conditions for the curl-curl problem at $\\beta = 0.01$ and watch the convergence rate as the mesh is refined: the paper's own result shows the rate settling at 0.94, so if the rate does not improve once boundary-adjacent coarse variables are added, the claim that the algebraic coarse space always contains the full near-kernel is false in that setting.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the GAMG framework and the ideal interpolation formula that the paper modifies."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the two-grid convergence estimates that link compatible relaxation speed to uniform two-level convergence."},{"cited_title":"Brannick, F","cited_arxiv_id":null,"evidence_quote":"Gives the optimal interpolation and compatible relaxation theory used to design and monitor the coarsening."},{"cited_title":"Claus, Multigrid smoothers for saddle point systems , PhD thesis, Universit¨ atsbibliothek Wuppertal, 2019","cited_arxiv_id":null,"evidence_quote":"Algorithm 3.1 for automated smoother construction (local near-kernel computation) is taken from this thesis."},{"cited_title":"Reitzinger and J","cited_arxiv_id":null,"evidence_quote":"Serves as the algebraic precursor for preserving near-kernels on the coarse mesh by averaging with correct orientations."},{"cited_title":"Generalized Optimal AMG Convergence Theory for Nonsymmetric and Indefinite Problems","cited_arxiv_id":"2401.11146","evidence_quote":"Defines the optimal interpolation used as the benchmark in the numerical comparisons."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the lowest-order Nédélec finite elements used to discretize the H(curl) systems."}],"review_version":1}