{"id":"b0d6647e-9a33-4458-aa64-b837529e3483","arxiv_id":"2411.15699","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A modal discontinuous Galerkin solver using Jacobi-polynomial bases is described and tested on compressible Euler flows with shocks.","lead":"This paper describes a computer code that simulates fast, compressible gas flows using a high-accuracy technique called Discontinuous Galerkin, with polynomial bases built from Jacobi functions so the accuracy order can be raised easily. The authors test it on standard shock-wave and airfoil problems and argue that higher-order settings give the same accuracy with less computation.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Row-sum mass lumping for quads/hexes (Eq. 29) is unvalidated on non-affine elements and could break the claimed design-order accuracy; the convergence tests do not exercise it.","rationale":"The reader's weakest assumption identifies precisely the same load-bearing point: the row-sum lumped mass matrix of Eq. (29) is assumed, without analysis or numerical evidence, to preserve design-order accuracy on non-affine quadrilateral and hexahedral elements. My independent reading confirms that this is the least secure link in the central claim. The affine-mesh convergence table is credible and supports the standard DG machinery on triangles and Cartesian quads, but it says nothing about the lumping approximation that is actually used on the deformed quads and hexes in the application benchmarks. The concern is not that the method is wrong; it is that the manuscript does not establish the claimed accuracy in the regime where its one nonstandard algebraic step matters. Because the reader already issued a conditional verdict, this stress-test does not move the verdict; it sharpens the condition: provide a deformed-mesh convergence study with and without mass lumping, or restrict the accuracy claims to affine elements. I also note the Eq. (15) normalization typo and the confusing triangle-basis domain description in Section 2.2, but these appear to be presentation errors rather than the load-bearing scientific issue.","tokens_in":19589,"tokens_out":10246,"duration_ms":98449,"concrete_test":"Repeat the Table 1 smooth-flow convergence study on non-affine quadrilateral meshes, e.g., a Cartesian grid whose interior vertices are displaced by a fixed fraction of h in a smooth sinusoidal pattern, for N=1,2,3, running once with the row-sum lumped mass matrix of Eq. (29) and once with the consistent mass matrix of Eq. (27). If the lumped version fails to reach the design orders N+1 (or falls materially below the consistent-mass rates), the claim of design-order accuracy on unstructured quadrilaterals/hexahedra is not supported. A minimal variant: displace one interior mesh line in the existing square test by 0.1h and compare L1/L2 rates; a drop of more than 0.5 in the observed order would confirm the concern.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that the discretization of Eq. (30) achieve design-order accuracy on the mixed unstructured meshes used in the benchmarks. For quadrilateral and hexahedral elements the isoparametric Jacobian determinant J(ξ) in Eq. (27) is not constant, so the exact mass matrix is not diagonal. Equation (29) replaces it by a row-sum lumped diagonal matrix, which perturbs the L2 projection defining the DG time derivative. The paper provides no error analysis for this lumping, no comparison against the consistent mass matrix, and no convergence test on non-affine quadrilateral or hexahedral elements: Table 1 uses only uniform Cartesian quads and straight-sided triangles, where J is constant and lumping is exact. The NACA0012 and Schardin simulations use stretched and curved bilinear quads, so those results do not validate the stated order of accuracy on the very element type where Eq. (29) is invoked. If row-sum lumping is inconsistent on non-affine quads/hexes, the reported accuracy of those benchmark cases is not representative of the method as described. A secondary as-written issue is Eq. (15), whose RHS omits the normalization factor of the Jacobi polynomial; since the affine-mesh convergence results are plausible, this is likely a typographical error rather than the code path, but it should be corrected.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript presents a discontinuous Galerkin solver for the compressible Euler equations using orthonormal Jacobi-polynomial bases (modal expansion) on mixed unstructured meshes. The basis is constructed via tensor products for quadrilaterals/hexahedra and via Proriol-Koornwinder-Dubiner polynomials for triangles/tetrahedra/wedges. The discretization follows the standard DG weak form with HLLC fluxes, SSP-RK time stepping, and a shock-capturing scheme combining a troubled-cell indicator and a vertex-based slope limiter. Convergence rates for polynomial orders N=1,2,3 are verified on Cartesian quadrilateral and triangular meshes, and several 2D/3D benchmark flows are compared with literature and experimental data.","tokens_in":19825,"tokens_out":9384,"duration_ms":77630,"significance":"If the method performs as claimed, the paper provides a reusable modal DG framework that can in principle be extended to arbitrary order on mixed elements. The strengths include a clean construction of orthonormal bases, convergence tables that match expected orders N+1 on affine meshes, CPU-cost comparisons showing high-order efficiency, and validation against experimental shock patterns. The main limitation is that the design-order claim is not demonstrated on the non-affine quadrilateral/hexahedral elements for which the paper introduces row-sum mass lumping; the benchmark cases on those element types are only qualitative. Thus the central claim is plausible but not yet fully supported.","major_comments":[{"comment":"Row-sum mass lumping for quadrilaterals and hexahedra is introduced without justification. For non-affine elements the Jacobian determinant J(ξ) in Eq. (27) is not constant, so the exact mass matrix is not diagonal and the lumped diagonal matrix changes the L2 projection. Table 1 only uses Cartesian quads and straight-sided triangles, where J is constant and lumping is exact, so the verified convergence rates do not test Eq. (29). The NACA0012 (Sec. 5.3) and Schardin (Sec. 5.4) simulations use non-affine quads, but their accuracy is only evaluated qualitatively. The authors should either (i) prove or cite that row-sum lumping preserves the DG order for tensor-product Legendre bases on bilinear/trilinear elements, (ii) add a convergence study on a smooth problem with non-affine quadrilaterals/hexahedra, or (iii) use the consistent mass matrix. This is load-bearing for the central arbitrary-order claim.","section":"2.3, Eq. (29)"},{"comment":"The derivative formula is missing the normalization factor. Since φ_n = P_n^{(0,0)} = J_n^{(0,0)}/√γ_n with γ_n = 2/(2n+1), the correct identity is dφ_n/dξ = √(n(n+1)) P_{n-1}^{(1,1)} = √(n(n+1)) J_{n-1}^{(1,1)}/√γ_{n-1}^{(1,1)}. As written, the RHS uses the unnormalized J_{n-1}^{(1,1)} and is off by a factor. The convergence results indicate the implementation uses the correct formula, but the published equation must be corrected.","section":"2.2, Eq. (15)"},{"comment":"The shock-capturing scheme, described in the abstract as 'improved', is specified only by citing Fu & Shu and Kuzmin, with no equations or algorithmic details for the troubled-cell indicator, the gradient reconstruction from adjacent elements, or the limiting procedure. Because this is advertised as a contribution, the section should be expanded to make the scheme reproducible.","section":"3.4"}],"minor_comments":[{"comment":"The sentence 'the isoparametric quadrilateral element is a square' in the paragraph after Eq. (18) should refer to the triangle; the text also appears to say 'cube' when discussing the tetrahedron. Please correct the element-type names.","section":"2.2, after Eqs. (18)-(20)"},{"comment":"The problem statement is inconsistent: it says 'supersonic flow' and M∞ = 0.8, but later states 'inflow Mach number of 0.85'; the computational domain is given as '[−4,−4] × [6,4]'. Please correct these values and clarify the free-stream condition.","section":"5.3"},{"comment":"The notation p for polynomial order in Table 1 is not clearly tied to N used elsewhere; the text refers to 'p1' and N=1 interchangeably. Define the relationship explicitly.","section":"4, Table 1"},{"comment":"The statement that the Runge-Kutta order should be higher than the polynomial order is imprecise; for an N-th order spatial discretization the time integrator should be at least order N+1, and the three-stage third-order scheme in Eq. (44) is not sufficient for N=3. Please clarify which RK scheme is used for each N.","section":"3.3"},{"comment":"There are numerous typos (e.g., 'Langende', 'increaselingly', 'simulaition', 'quadridual', 'prssure', 'arifoil', 'discription') and inconsistent symbols (e.g., 'ϕ' vs 'φ', 'P' vs 'J'). A thorough proofreading is needed.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The mass-lumping issue is the key technical gap. If the authors provide a convergence study on non-affine elements or switch to a consistent mass matrix, the central claim can be assessed properly. The paper's novelty is incremental (modal DG with Jacobi bases is standard), but the mixed-element implementation and cpu-time comparisons are useful. The manuscript is not ready in its current form."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a competent implementation paper for a standard modal DG solver. It doesn't propose a new method—the Jacobi/PKD basis, HLLC flux, Fu-Shu indicator, and Kuzmin limiter are all established—but it is a useful, clearly written engineering reference, and the convergence results in Table 1 support the basic claim of design-order accuracy for N=1,2,3 on the meshes tested.\n\nWhat it does well: the derivation is careful and the benchmark suite is broad. The CPU-time comparison at fixed error is a nice practical point, and the Schardin and blunt-cylinder comparisons to experiment are credible sanity checks. I also appreciate that the triangle/tet basis construction is spelled out with explicit formulas; someone with a working FVM code could reimplement this DG solver without much guesswork.\n\nSoft spots, in order of importance. First, Eq. (29): row-sum mass lumping on quadrilateral and hexahedral elements is asserted without any error analysis or a convergence test that actually exercises it. The Table 1 meshes are Cartesian quads and straight-sided triangles, where J is constant and lumping is exact. The NACA0012 and Schardin runs use stretched and curved bilinear quads, so those benchmarks do not validate the order of accuracy on the element type where Eq. (29) matters. If the lumping breaks design order on non-affine quads, the real-world accuracy of those cases is not representative of the stated method. This is the main thing I'd want fixed: either add a non-affine quad/hex convergence study, or compare consistent vs lumped mass matrices.\n\nSecond, Eq. (15) is wrong as written: the derivative of the normalized Legendre basis should be sqrt(n(n+1)) P_{n-1}^{(1,1)}, not sqrt(n(n+1)) J_{n-1}^{(1,1)}. The normalized factor seems to be missing. The clean convergence results suggest the code uses the correct formula, but as a paper it's a typo that must be corrected.\n\nThird, the 'arbitrary high-order' claim is only demonstrated up to N=3. Nothing wrong with that as a proof of concept, but the title and abstract promise more than the evidence shows. Similarly, the 'improved' shock-capturing is really a combination of two cited methods; I don't see a quantitative comparison that would establish an improvement. No code or data is released, so these are claims to take on faith.\n\nThe paper is honest about what it does and the citation pattern is appropriate. The central numerical results are plausible and the method is well established, so I would send it to a CFD journal with a request for revision. It deserves a serious referee, but the authors should be pushed to validate the mass lumping and fix Eq. (15).","headline":"A solid, clearly written modal DG engineering paper that delivers expected convergence on straight-sided meshes but overclaims 'arbitrary order' and leaves row-sum mass lumping on non-affine quads unvalidated.","tokens_in":20413,"tokens_out":3562,"would_cite":false,"duration_ms":31609,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65M60","65M70","76M10","76N15"],"pacs":["47.11.Fg","47.40.-x"],"model":"deepseek-v4-flash","headline":"This paper constructs an arbitrary-high-order discontinuous Galerkin solver for the compressible Euler equations from Jacobi-polynomial modal bases on mixed unstructured meshes, and verifies design-order convergence and shock-resolving…","keywords":["Discontinuous Galerkin method","Jacobi polynomials","modal expansion","compressible Euler equations","unstructured mesh","HLLC Riemann solver","shock capturing","high-order convergence"],"falsifier":"Run the Section 4 smooth-flow convergence test on strongly stretched or curved quadrilateral and hexahedral meshes, comparing the row-sum lumped mass matrix with the consistent one. If the lumped solver's $L^1$ error converges at a lower order than the consistent solver's, or below $N+1$ for polynomial order $N$, the central accuracy claim is falsified.","tokens_in":1682,"feed_emoji":"💨","tokens_out":7500,"duration_ms":113894,"temperature":0.7,"pith_summary":"This paper proposes a Discontinuous Galerkin solver for the compressible Euler equations whose spatial basis of arbitrary polynomial order is built from one-dimensional Jacobi polynomials, extended by tensor products to quadrilaterals and hexahedra and by collapsed-coordinate variants to triangles, tetrahedra, and wedges. The discretization is derived by requiring the residual of the Euler equations to be orthogonal to these basis functions, with HLLC numerical fluxes at element boundaries, Gauss-Jacobi quadrature for integration, and a shock-detection plus slope-limiting procedure for discontinuities. The authors report design convergence rates of roughly 2, 3, and 4 for polynomial orders 1, 2, and 3 on both triangle and quadrilateral meshes, and show that the high-order versions reach a given error level in less CPU time than lower-order versions on finer grids. They then demonstrate the solver on the forward step, double Mach reflection, transonic NACA0012 flow, Schardin's problem, and a Mach-4 blunt-cylinder flow, comparing favorably with reference computations and experiments. The point of the paper is that a single Jacobi-based modal framework can support arbitrary order and mixed element types without rebuilding the basis.","feed_headline":"Jacobi-based DG solver hits design accuracy on shock flows","feed_subtitle":"An arbitrary-order modal scheme on mixed unstructured meshes converges at rates 2–4 and matches Mach-4 shock experiments.","key_machinery":"The central object is the set of normalized Jacobi polynomials $P^{(0,0)}_n = \\sqrt{(2n+1)/2}\\,J^{(0,0)}_n$, with $\\alpha=\\beta=0$, used as an orthonormal modal basis on the reference element. Tensor products $\\phi_{ijk}=P_iP_jP_k$ give the square and cube bases, while a collapsed-coordinate Jacobi construction for triangles and tetrahedra uses the factors $(1-\\eta)^i$ and $(1-\\zeta)^{i+j}$ to maintain orthogonality on simplices. This basis carries the argument because orthogonality makes the mass matrix diagonal on simplices, reduces the spatial discretization to the matrix-vector form of Eq. (30), and fixes the Gauss-Jacobi quadrature that evaluates the volume and face integrals. The HLLC flux supplies the inter-element coupling, and the trouble-cell detector plus slope limiter supplies the shock capturing.","core_discovery":"On the paper's own terms, the discovery is that an arbitrary-high-order modal DG method for compressible flows can be constructed uniformly from normalized 1D Jacobi polynomials, with the Legendre case $\\alpha=\\beta=0$, and that this construction works across triangles, quadrilaterals, tetrahedra, hexahedra, and wedges, giving discrete Euler equations with a diagonal mass matrix on simplices and a row-sum lumped mass matrix on quadrilaterals and hexahedra. The numerical flux is the HLLC Riemann solver applied after rotating the velocity into the boundary-normal local frame, volume and face integrals use Gauss-Jacobi quadrature with simplex rules for triangles and tetrahedra, and time stepping uses strong-stability-preserving schemes with a CFL limit of $C \\le 0.4/(2N+1)$. Discontinuous cells are flagged by a troubled-cell indicator and smoothed by a vertex-based slope limiter. With this machinery, the paper reports convergence orders close to $N+1$ for $N=1,2,3$ and benchmark results for shocks that match reference solutions and experiments.","pith_inferences":["A natural extension the paper does not explore is choosing nonzero Jacobi parameters $\\alpha,\\beta$ to tune resolution toward boundaries or interfaces.","The untested interaction of row-sum mass lumping with curved boundary elements is the most direct place to probe whether design accuracy persists at very high order.","The same basis and quadrature machinery should carry over to the Navier-Stokes equations, since only the viscous fluxes would need adding; the paper itself treats only the inviscid Euler system.","The troubled-cell threshold $C_k = 0.015 \\times 2^{k-1}$ is used across all examples; whether it needs retuning for higher Mach numbers or higher orders is an open question beyond the paper's tests."],"forward_implications":["The same Jacobi-based code can switch spatial order by changing one integer $N$; no new basis functions need to be derived.","On smooth flows, orders $N=2$ and $N=3$ reach a given error level on coarser meshes and in less CPU time than $N=1$ on fine meshes, so high order is not inherently more expensive.","Mixed-element meshes, including hexahedra combined with tetrahedra and wedges, can be used in one solver, allowing geometry-flexible meshing without sacrificing high order.","The shock-detection plus local limiting confines limiting to genuinely discontinuous cells, so smooth regions keep the high-order accuracy."],"supporting_citations":[{"why":"Supplies the spectral/hp element modal-expansion framework that motivates expanding state variables in orthogonal polynomials.","marker":"[22]"},{"why":"Provides the Jacobi polynomials, their orthogonality relations, and derivative identities used to build the basis.","marker":"[27]"},{"why":"Gives the collapsed-coordinate Jacobi basis on triangles and tetrahedra that extends the construction to simplices.","marker":"[28, 29, 30]"},{"why":"Provides the HLLC approximate Riemann solver used for the numerical flux at element boundaries.","marker":"[33]"},{"why":"Supplies the Gauss-Jacobi quadrature nodes and weights used for volume integration.","marker":"[34]"},{"why":"Provides the simplex quadrature rules used for triangle and tetrahedron integration.","marker":"[36]"},{"why":"Supplies the troubled-cell indicator used to detect discontinuity elements before limiting.","marker":"[23]"},{"why":"Provides the vertex-based slope limiter used to reconstruct variables in troubled cells.","marker":"[39]"},{"why":"Supplies the forward-step and double-Mach-reflection benchmark problems used to validate shock capturing.","marker":"[40]"},{"why":"Provides the reference pressure-coefficient result for the NACA0012 airfoil comparison.","marker":"[38]"}],"fun_headline_variants":["Jacobi-based DG achieves high-order accuracy on shocks","Arbitrary-order DG on mixed meshes via Jacobi polynomials","DG solver with Jacobi basis matches shock experiments","Modal DG on unstructured meshes with Jacobi expansion"],"cache_read_input_tokens":22528,"weakest_assumption_plain":"For quadrilateral and hexahedral cells, the solver replaces the mass matrix by its row-sum lumped version and assumes this preserves the claimed order of accuracy, even though no error analysis, no comparison with the consistent mass matrix, and no study of curved or stretched cells is given.","fun_headline_variants_meta":{"raw":{"variants":["Jacobi-based DG achieves high-order accuracy on shocks","Arbitrary-order DG on mixed meshes via Jacobi polynomials","DG solver with Jacobi basis matches shock experiments","Modal DG on unstructured meshes with Jacobi expansion"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000944,"raw_usage":{"total_tokens":4079,"prompt_tokens":1036,"completion_tokens":3043,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":652,"completion_tokens_details":{"reasoning_tokens":2978}},"tokens_in":652,"tokens_out":3043,"duration_ms":19202,"temperature":1.0,"reasoning_tokens":2978,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T14:01:12.750321+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the Section 4 smooth-flow convergence test on strongly stretched or curved quadrilateral and hexahedral meshes, comparing the row-sum lumped mass matrix with the consistent one. If the lumped solver's $L^1$ error converges at a lower order than the consistent solver's, or below $N+1$ for polynomial order $N$, the central accuracy claim is falsified.","supporting_citations":[{"cited_title":"Szeg¨ o, Orthogonal polynomials, American Mathematical Society, Providence, RI, 1939","cited_arxiv_id":null,"evidence_quote":"Provides the Jacobi polynomials, their orthogonality relations, and derivative identities used to build the basis."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Gauss-Jacobi quadrature nodes and weights used for volume integration."},{"cited_title":"Grundmann, H.-M","cited_arxiv_id":null,"evidence_quote":"Provides the simplex quadrature rules used for triangle and tetrahedron integration."},{"cited_title":"Fu, C.-W","cited_arxiv_id":null,"evidence_quote":"Supplies the troubled-cell indicator used to detect discontinuity elements before limiting."},{"cited_title":"Kuzmin, A vertex-based hierarchical slope limiter for p-adaptive discontinuous galerkin methods, Journal of computational and applied mathematics 233 (12) (2010) 3077–3085","cited_arxiv_id":null,"evidence_quote":"Provides the vertex-based slope limiter used to reconstruct variables in troubled cells."},{"cited_title":"Woodward, P","cited_arxiv_id":null,"evidence_quote":"Supplies the forward-step and double-Mach-reflection benchmark problems used to validate shock capturing."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the reference pressure-coefficient result for the NACA0012 airfoil comparison."}],"review_version":1}