{"id":"f21c24d5-8ac9-4e9e-ad56-52728f119fd9","arxiv_id":"1908.05834","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"B-char approximates traceback cells by balls and uses an adjustment plus least-squares step to build a mass-conserving ELLAM-type scheme that runs much faster than polytopal implementations, with similar accuracy in 2D and 3D tests.","lead":"The paper introduces B-char, a way to implement characteristic-based transport schemes by approximating each mesh cell with a few balls instead of polygons or polyhedra. This makes 3D implementation simpler and much cheaper, while adjustment steps restore local and global mass conservation and keep accuracy comparable to standard polytopal intersection methods.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Feasibility of the constrained least-squares correction (29) is unproved; if infeasible, the claimed local+global mass conservation fails.","rationale":"The reader's weakest_assumption concerns the ball-stays-a-ball approximation, which is a genuine accuracy risk. I agree with that concern, but the most load-bearing issue for the central claim is different: the constrained least-squares problem (29) is assumed to have a solution, yet no feasibility proof is supplied and the paper even notes the preceding iterative redistribution has no guarantee of reaching the required accuracy. If (29) is infeasible for a valid input, the scheme is not mass conserving at all, whereas a deformed tracked ball only degrades accuracy while conservation could still hold. The reader's rationale does mention the missing feasibility proof, so my agreement is partial. The numerical tests are genuine evidence that the method works on certain Cartesian, divergence-free cases, so I do not think the paper should be rejected outright; however, the general claim of mass conservation is not established, and the verdict remains CONDITIONAL, unchanged from the reader's assessment.","tokens_in":19416,"tokens_out":7384,"duration_ms":85147,"concrete_test":"On a deliberately nonuniform 2D mesh (e.g., a 1×1 square cell adjacent to a 0.5×0.5 cell), use a divergence-free translation or shear velocity and the B-char algorithm with 4 balls per cell. Apply Algorithm 1 with N=10 and solve (29) with 0 ≤ 1+x ≤ 2 using a standard convex solver; record whether a feasible point exists. If it does not, the claimed conservation guarantee fails. A cheaper analytical check is to verify Hall's condition for the support graph of A(N) with row demands |K_i|_φ and column demands |M_j|_φ; exhibit any subset of rows whose neighbouring columns have smaller total demand.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The B-char method's mass-conservation guarantee rests on solving (29) with constraints 0 ≤ 1+x ≤ 2 after N iterations of (28). The paper fixes the support of A(N) (zero entries stay zero) and then imposes exact row and column sums (26)-(27), but provides no existence proof. A nonnegative matrix with this support and given margins exists only if the support graph satisfies Hall-type inequalities; the extra upper bound 2 makes feasibility even harder. Because balls leave gaps, the support can miss part of the true transport: a tracked cell can intersect balls of only one residing cell, forcing its full row demand onto a column with smaller total mass. In such a case no x satisfies (29), so the algorithm as stated has no output and the scheme is not mass conserving. Section 3.2 itself concedes 'there is no guarantee that such a result is achievable' for the iteration (28), yet the subsequent optimization is assumed to succeed. The heuristic max radius ≤ 1/4 of the smallest face diameter does not prevent sparse support on nonuniform meshes or under strong shear. This is a correctness gap in the central claim, not merely a missing convergence analysis.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes the B-char method, a ball-approximation strategy for implementing characteristic-based schemes such as ELLAM for pure advection problems. Each mesh cell is approximated by a collection of disjoint balls; back-tracking their centers gives approximate trace-back regions, and ball-ball intersections replace expensive polytopal intersections. The paper derives an initial volume transfer matrix V in Eq. (25), performs iterative row/column scalings in Eq. (28), and then solves a constrained least-squares problem in Eq. (29) to enforce exact local and global mass conservation. Numerical tests in 2D compare B-char ELLAM with a polygonal ELLAM on Cartesian meshes, report similar errors at substantially lower CPU time, and further demonstrate the method on solid-body rotation and deformational-flow benchmarks and on 3D test cases. The abstract claims that the scheme is both locally and globally mass conserving and achieves results similar to polytopal intersections at much lower cost.","tokens_in":19693,"tokens_out":3836,"duration_ms":40370,"significance":"If the central claims hold, this is a practically valuable contribution: it offers a simple, cheap way to implement ELLAM-type schemes in 3D, where polyhedral intersection computations are notoriously difficult. The strengths of the paper include a clean derivation of the ELLAM update (12), a transparent construction of the initial volume approximation (25), the explicit encoding of local and global mass conservation as constraints (26)-(27), and a substantial set of numerical benchmarks, including the solid-body rotation and deformational-flow tests. The reported CPU-time reductions are striking (up to roughly 40x on the finest 2D tests), and the 3D simulations demonstrate that the approach is usable in practice. The mass-conservation properties are true by construction when the constrained problem is feasible, so this is an engineering-oriented contribution rather than a new convergence theory. The main weakness is that the feasibility of the central constrained least-squares problem is not established, which directly affects the claimed conservation guarantee.","major_comments":[{"comment":"The central conservation claim rests on the solvability of the constrained least-squares problem (29) with the implicit box constraint 0 <= 1+x <= 2. The paper does not prove that a solution exists for the support graph induced by A^(N). A nonnegative matrix with prescribed row and column sums and with zero entries fixed at zero exists only under Hall-type conditions on the support, and the additional upper bound 2 makes feasibility harder. If a tracked cell intersects balls of only one residing cell, its entire row demand must be supplied by a column whose total mass may be smaller, in which case no x satisfies (29). The paper itself concedes, two paragraphs before Eq. (29), that after iterating (28) 'there is no guarantee that such a result is achievable'; the same issue applies to (29). Since the algorithm as stated has no output if (29) is infeasible, the claimed local and global mass conservation is not unconditional. The authors should either prove feasibility under stated assumptions (e.g., on ball packing, time step, or mesh regularity) or provide a fallback procedure, such as a provably convergent rescaling algorithm or an explicit support-enrichment step.","section":"Section 3.2, Eq. (29)"},{"comment":"The definition of V_{\\hat K,M} in Eq. (25) divides by the sum over M and l of rho_M phi_M |\\hat B_{K,s} \\cap B_{M,l}|. This denominator is zero whenever a tracked ball \\hat B_{K,s} falls entirely into a gap between residing balls. The paper mentions this possibility in Figure 3 and suggests increasing the number of balls, but provides no rigorous rule that prevents the denominator from vanishing; the algorithm as written would then encounter division by zero. Even if the denominator is positive, the normalization in (24) can become ill-conditioned when the overlap is very small, which can amplify errors in the initial approximation. The paper should specify a deterministic handling of the zero-denominator case, for example by assigning the mass of such a tracked ball proportionally to the nearest residing cell or by a fallback that does not break the subsequent conservation correction.","section":"Section 3.1, Eq. (25)"},{"comment":"The method assumes that each tracked ball remains a ball, so only centers and radii need to be tracked and ball-ball intersections are exact. The paper acknowledges that this assumption is false in general and invokes the heuristic that the maximum ball radius be at most one fourth of the smallest face diameter, but it provides no quantitative error bound or distortion limit. Under strong shear or on nonuniform meshes, the initial volume matrix (25) can deviate substantially from the true transported volumes, and the least-squares correction in (29) may then have to distort the transport matrix heavily, degrading solution quality rather than merely correcting small errors. The deformational-flow test in Section 4.1.5 shows visible distortion and amplitude loss, which the paper attributes to mesh resolution, but no diagnostic is given to distinguish the ball approximation error from the usual discretization error. The authors should provide a quantitative measure of local deformation (e.g., a bound on the condition number of the deformation gradient over a time step) and report this diagnostic in the numerical tests, or restrict the claimed accuracy regime accordingly.","section":"Section 3, ball tracking paragraph"}],"minor_comments":[{"comment":"The sentence 'Letting x = (x_j)_{j=1,...,n_c}' is a dimension mismatch: x is an n_z-vector, not an n_c-vector. This should be corrected to j=1,...,n_z.","section":"Section 3.2, Eq. (29)"},{"comment":"The sentence 'This corresponds to a loss in mass that should be deposited in another cell' is confusing, because the preceding discussion describes overlapping tracked balls causing excess mass to be deposited, i.e., a gain rather than a loss, for the cells receiving the double contribution. The wording should be clarified to avoid the apparent contradiction.","section":"Remark 3.2"},{"comment":"Algorithm 1 states that the minimal change in volumes is found so that constraints (29) are satisfied, but it does not explicitly state the positivity and upper-bound constraints 0 <= 1+x <= 2 that are described in the text. The algorithm should list these constraints or reference the full problem statement.","section":"Algorithm 1"},{"comment":"The name of the method is spelled inconsistently as 'B-Char' and 'B-char' (e.g., Section 3 vs. the abstract and Section 4). Standardize the spelling.","section":"Throughout"},{"comment":"When comparing with the results of Bochev et al., the paper reports relative errors E1 and E2 for its method and then converts the absolute errors from the literature to relative errors. The conversion is useful, but the statement that the absolute errors 'correspond to relative errors' should be accompanied by the value of the norm of the exact solution used in the conversion, for reproducibility.","section":"Section 4.1.4"}],"recommendation":"major_revision","confidential_remarks":"The paper is within the scope of the journal and reports a genuinely useful algorithmic contribution. The main obstacle is the unproved feasibility of the constrained least-squares problem (29), which is load-bearing for the mass-conservation guarantee. This is a fixable issue if the authors add a feasibility proof under reasonable assumptions or a robust fallback, but it cannot be ignored in a journal submission. I would not reject outright, since the numerical evidence is strong and the derivation of the method is clear. I would also encourage the authors to add at least one diagnostic separating ball-approximation error from mesh-discretization error in the deformational-flow test."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The B-char idea is the real thing: replacing polytopal intersections with ball intersections for characteristic-based schemes is simple, new, and clearly effective in the tests.  The derivation of the initial volume approximation (Eq. 25) is clean, and the two-step row/column scaling in Eq. (28) is a sensible way to reduce the conservation errors before the final correction.  The numerical comparison against polygonal ELLAM is fair and the speed-up is substantial.  On the tested cases, the method delivers what the abstract promises.\n\nThe soft spots are concentrated in the theoretical claims.  The biggest is the feasibility of the constrained least-squares problem in Eq. (29).  The paper states that the scheme is both locally and globally mass conserving, but that depends on the existence of a vector x with 0 ≤ 1+x ≤ 2 satisfying the exact row and column sums.  No existence proof is given, and it is not hard to construct sparse-support cases where the row demand of a tracked cell falls entirely on a single residing column whose total mass is smaller, making the constraints impossible to meet with the upper bound.  The paper itself concedes, just before introducing (29), that there is no guarantee for the iterative scaling, and the same concern carries over to the optimisation problem.  This is not just a missing convergence analysis; it is a gap in the central mass-conservation guarantee.\n\nThe second issue is the ball approximation itself.  The heuristic that balls remain balls with radius bounded by one-fourth of the smallest face diameter is plausible but unquantified.  There is no error analysis, no distortion bound, and no discussion of when the approximation degrades under strong shear.  The deformational flow test shows visible distortion at the final time, so the heuristic has limits.\n\nI also note the numerical evidence is limited to Cartesian, divergence-free, constant-porosity settings.  Non-solenoidal fields and variable porosity are only remarks, and generic meshes are left as future work.  That is fine for a first paper, but the conclusions should be scoped accordingly.  The CPU comparisons are indicative rather than rigorous, but the authors say as much.\n\nNone of these are fatal if treated as revision points.  A serious referee can ask for a feasibility condition on the support of A(N), or a relaxation of the constraints, and for a more careful statement of what is guaranteed.  The experimental evidence is strong enough that the idea deserves to be in the literature.  I would send this to peer review and read the revision carefully.","headline":"B-char is a genuinely new and practical ball-approximation idea for ELLAM, but the mass-conservation claim has an unproved feasibility gap and needs revision.","tokens_in":20182,"tokens_out":2603,"would_cite":true,"duration_ms":27511,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65M25","65M08"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims that replacing tracked cells by balls, then correcting the transfer volumes with a two-step scaling and a minimal-adjustment optimisation, yields a locally and globally mass-conserving characteristic scheme whose…","keywords":["characteristic-based schemes","ELLAM","mass conservation","ball approximation","advection equation","finite volume methods","porous media","3D implementation"],"falsifier":"Run the B-char method on a strongly shearing flow (for instance the deformational-flow test with $T=5$) and advect a dense set of points on the surface of one initial ball to obtain the exact image region; compare that region with the ball that B-char tracks. If the area of the symmetric difference—the set covered by one but not the other—is not small when the initial radius is one-fourth of the smallest face diameter, then the volume constraints (28)-(29) are being satisfied by heavily distorting the transfer matrix, and the final solution will show visible distortion and amplitude loss.","tokens_in":19196,"feed_emoji":"🔵","tokens_out":9436,"duration_ms":83291,"temperature":0.7,"pith_summary":"This paper claims that the expensive step in characteristic-based advection schemes—computing intersections of tracked cells with mesh cells—can be replaced by intersections of balls, which are nearly free to compute. It introduces the B-char method, which approximates each cell by a few packed balls, tracks their centers backward along the flow, and then corrects the resulting approximate transfer volumes so that mass is conserved both cell-by-cell and globally. The paper argues that this corrected ball scheme reproduces the accuracy of a conventional polygonal-intersection implementation of the Eulerian-Lagrangian Localised Adjoint Method (ELLAM) while running up to about 40 times faster in its 2D tests, and that it makes such schemes practical in 3D, where polyhedral intersection is the usual bottleneck. If true, this removes an implementation hurdle for Eulerian-Lagrangian methods in three-dimensional transport problems.","feed_headline":"Balls replace polygons, making 3D transport schemes practical","feed_subtitle":"A ball-based ELLAM preserves local and global mass at a fraction of the cost.","key_machinery":"The key object is the ball approximation of a cell: each cell $K$ is filled with $n_K$ disjoint balls $B_{K,s}$, and a porous density $\\rho_K$ distributes the cell's porous volume over the balls. The flow map $F_t$ moves these balls backward in time, and the paper assumes the image of a ball is again a ball, so a tracked cell is represented only by centers and radii; ball-ball intersections then give cheap estimates of how much mass each cell receives from every other cell. The argument is carried by the transfer-matrix corrections: equation (28) alternates column scalings that impose global mass balance with row scalings that impose local balance, and equation (29) solves a minimal-adjustment constrained optimisation on the nonzero transfer entries, restoring exact conservation with as little distortion of the initial ball-based approximation as possible.","core_discovery":"The central claim is that ball approximations, together with the two-step redistribution formula (28) and the minimal-adjustment optimisation problem (29), produce a locally and globally mass-conserving ELLAM-type scheme whose solutions are close to those of a polytopal-intersection implementation. The construction replaces each mesh cell with disjoint interior balls, assigns each ball an equivalent porous volume, tracks the balls backward in time under the flow, and computes ball-ball intersections to form an initial transfer matrix. A column scaling step enforces global mass conservation, a row scaling step enforces local conservation, and a quadratic program finds the minimal scaling that satisfies both constraints at once, so the correction is small when the ball approximation is good. Numerical tests on translation, rotation, solid-body rotation, and deformational flows in 2D, and on translation and rotation-stretching flows in 3D, report error levels close to the polygonal ELLAM's, with per-step runtimes up to about 40 times shorter in 2D, and 3D errors of similar magnitude to the 2D errors.","pith_inferences":["The tracked-ball assumption is the point most worth stress-testing: a quantitative bound on how far an advected ball deviates from a true ball under realistic velocity fields would upgrade the heuristic radius limit (one-fourth of the smallest face diameter) into a convergence statement.","The same ball-intersection idea should transfer to other characteristic schemes whose bottleneck is region intersection, such as MMOCAA, and to remap or particle-deposition tasks in Lagrangian methods; this is a natural extension the paper only mentions as future work.","A testable prediction is that the optimal number of balls per cell grows with flow distortion: coarse packing should suffice for translations, while shear-dominated flows would require more balls, smaller time steps, or both, to keep the tracked-ball approximation credible.","The reported speedups are tied to the prototype implementation; a production comparison would measure total time to reach a target error, including the cost of solving the optimisation problem and of packing balls on generic meshes."],"forward_implications":["Characteristic-based schemes such as ELLAM can be implemented in 3D without polyhedral intersection routines; the paper's 3D tests on a $16^3$ mesh run in tens of seconds per time step.","The B-char scheme preserves constant solutions and enforces local and global mass conservation exactly, rather than approximately, by construction of the adjusted transfer matrix.","The method extends to non-solenoidal velocity fields by tracking circumference points to approximate the deformed ball radius, at extra cost, as described in Remark 3.4.","Increasing the number of balls per cell improves the initial volume approximation and reduces the number of redistribution iterations needed, giving a tunable accuracy-cost trade-off.","Because the scheme is set in a general spatial-discretisation framework, the ball approximation can be combined with different cell-centred or hybrid discretisations used for the diffusive part of an advection-diffusion model."],"supporting_citations":[{"why":"The fully mass- and volume-conserving characteristic implementation whose local volume constraints the B-char adjustments are designed to reproduce.","marker":"[1]"},{"why":"The combined ELLAM-MMOC scheme and its volume-adjustment and polygonal-intersection strategy, used as the reference baseline in the 2D comparisons.","marker":"[9]"},{"why":"Provides the flow-map properties and generalised Liouville formula used to update tracked-ball volumes and derive the conservation constraints.","marker":"[10]"},{"why":"The optimisation-based volume-correction algorithm that motivates the constrained minimal-adjustment step in Eq. (29).","marker":"[11]"},{"why":"Introduces MMOC with adjusted advection, the globally mass-conserving characteristic scheme that frames the global conservation requirement.","marker":"[13]"},{"why":"Supplies the deformational-flow benchmark used to test the ball approximation under strong distortion.","marker":"[22]"},{"why":"Provides the solid-body rotation benchmark whose published errors the paper compares its ball-based results against.","marker":"[23]"},{"why":"Gives the Cartesian version of the deformational-flow test case used in Section 4.1.5.","marker":"[25]"}],"fun_headline_variants":["Balls replace polytopes for cheaper mass-conserving schemes","Ball-based ELLAM: fast and mass-conserving in 2D and 3D","Cheap ball intersections make 3D transport practical","Mass-conserving ball method cuts cost of 3D transport"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that a tracked ball remains a ball, so it can be described by its center and radius; this is false in general, and the paper relies on the heuristic that the balls start small enough (radius at most a quarter of the smallest face diameter) for the error to stay acceptable, without a quantitative bound.","fun_headline_variants_meta":{"raw":{"variants":["Balls replace polytopes for cheaper mass-conserving schemes","Ball-based ELLAM: fast and mass-conserving in 2D and 3D","Cheap ball intersections make 3D transport practical","Mass-conserving ball method cuts cost of 3D transport"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000272,"raw_usage":{"total_tokens":1638,"prompt_tokens":956,"completion_tokens":682,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":572,"completion_tokens_details":{"reasoning_tokens":604}},"tokens_in":572,"tokens_out":682,"duration_ms":6928,"temperature":1.0,"reasoning_tokens":604,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:03:29.711510+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the B-char method on a strongly shearing flow (for instance the deformational-flow test with $T=5$) and advect a dense set of points on the surface of one initial ball to obtain the exact image region; compare that region with the ball that B-char tracks. If the area of the symmetric difference—the set covered by one but not the other—is not small when the initial radius is one-fourth of the smallest face diameter, then the volume constraints (28)-(29) are being satisfied by heavily distorting the transfer matrix, and the final solution will show visible distortion and amplitude loss.","supporting_citations":[{"cited_title":"Arbogast and C","cited_arxiv_id":null,"evidence_quote":"The fully mass- and volume-conserving characteristic implementation whose local volume constraints the B-char adjustments are designed to reproduce."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"The combined ELLAM-MMOC scheme and its volume-adjustment and polygonal-intersection strategy, used as the reference baseline in the 2D comparisons."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the flow-map properties and generalised Liouville formula used to update tracked-ball volumes and derive the conservation constraints."},{"cited_title":"D’Elia, D","cited_arxiv_id":null,"evidence_quote":"The optimisation-based volume-correction algorithm that motivates the constrained minimal-adjustment step in Eq. (29)."},{"cited_title":"Douglas, F","cited_arxiv_id":null,"evidence_quote":"Introduces MMOC with adjusted advection, the globally mass-conserving characteristic scheme that frames the global conservation requirement."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the deformational-flow benchmark used to test the ball approximation under strong distortion."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the solid-body rotation benchmark whose published errors the paper compares its ball-based results against."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the Cartesian version of the deformational-flow test case used in Section 4.1.5."}],"review_version":1}