The weak Galerkin method for a class of Gross-Pitaevskii type eigenvalue problems

Qilong Zhai; Wei Lu

arxiv: 2605.29264 · v1 · pith:SWSKDCPZnew · submitted 2026-05-28 · 🧮 math.NA · cs.NA

The weak Galerkin method for a class of Gross-Pitaevskii type eigenvalue problems

Wei Lu , Qilong Zhai This is my paper

Pith reviewed 2026-06-29 06:27 UTC · model grok-4.3

classification 🧮 math.NA cs.NA

keywords weak Galerkin methodGross-Pitaevskii equationnonlinear eigenvalue problemlower boundfinite element methodground statepost-processing technique

0 comments

The pith

Weak Galerkin discretization of Gross-Pitaevskii eigenvalue problems yields lower bounds on energy and eigenvalues.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper applies the weak Galerkin finite element method to a class of nonlinear eigenvalue problems modeled after the Gross-Pitaevskii equation. It establishes that the resulting discrete energy is a lower bound for the true energy. A simple post-processing step on the computed solution then produces a lower bound for the ground state eigenvalue. This is valuable for providing rigorous error control from below in numerical simulations of nonlinear quantum systems. The analysis is supported by numerical experiments that demonstrate the bounds in practice.

Core claim

By using the weak Galerkin method on the variational form of the Gross-Pitaevskii type problem, the discrete solution satisfies that its energy is less than or equal to the energy of the exact solution. Post-processing the discrete eigenfunction then gives a quantity that is a lower bound for the ground state eigenvalue.

What carries the argument

The weak Galerkin finite element discretization, which uses a weak gradient operator to handle possibly discontinuous piecewise polynomial functions.

If this is right

The discrete energy functional evaluated at the weak Galerkin solution is bounded above by the continuous energy.
Post-processing produces a lower bound for the ground state eigenvalue.
The theoretical lower bound property holds for the class of problems considered under standard assumptions on the nonlinearity.
Numerical experiments confirm that the computed quantities respect the predicted bounds.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

This lower bound property could be combined with upper bound methods to bracket the true eigenvalue.
The method might be adapted to time-dependent Gross-Pitaevskii equations or other nonlinear PDEs.
In applications like Bose-Einstein condensation, such bounds could help certify the accuracy of computed ground states without knowing the exact value.

Load-bearing premise

The weak Galerkin approximation satisfies a discrete energy that does not exceed the continuous energy for the chosen spaces and the nonlinearity of the problem.

What would settle it

Finding a specific Gross-Pitaevskii problem where the post-processed eigenvalue from the weak Galerkin scheme exceeds the known exact ground state eigenvalue.

Figures

Figures reproduced from arXiv: 2605.29264 by Qilong Zhai, Wei Lu.

read the original abstract

This paper aims to employ the weak Galerkin method to solve a class of nonlinear eigenvalue problems. We proved the weak Galerkin scheme produces lower bound for the energy. Moreover, by the post-processing technique, we obtain lower bound for the ground state eigenvalue. Finally, numerical experiments are provided to validate the theoretical analysis.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Weak Galerkin gives lower bounds on energy for Gross-Pitaevskii problems, with post-processing for the eigenvalue bound.

read the letter

The paper applies the weak Galerkin method to Gross-Pitaevskii type nonlinear eigenvalue problems and proves that the scheme produces a lower bound for the energy. A post-processing step then yields a lower bound for the ground state eigenvalue, with numerical experiments to check the claims.

The extension works because the variational structure carries over. The weak gradient and the handling of the nonlinearity let the discrete energy sit below the continuous energy under the chosen spaces, which is the key step for the lower bound. This is a straightforward but useful application of an existing framework to this class of problems.

The lower bound result is the main contribution and it looks supported by the variational arguments. The stress-test note finds no inconsistency with the quartic term or the stabilizer, so the central claim holds up on the given description. The numerics are included to validate, which helps.

Soft spots are minor. The abstract is short on the precise growth or smoothness assumptions for the nonlinearity, so the full paper needs to state those clearly for the proofs to be checked. The post-processing details would also benefit from explicit verification that the bound is preserved. Nothing indicates a load-bearing flaw.

This is for readers in numerical analysis who work on finite element methods for nonlinear eigenvalues in quantum mechanics. Someone looking for certified lower bounds in this setting would get direct value from the energy inequality and the post-processing step.

It deserves peer review. The claim is concrete, the method is standard enough to reproduce, and the variational reasoning is the right tool for the job.

Referee Report

0 major / 3 minor

Summary. The manuscript develops a weak Galerkin finite-element discretization for a class of Gross-Pitaevskii-type nonlinear eigenvalue problems. It claims to prove that the resulting discrete energy is a lower bound for the continuous energy functional and, via a post-processing step, that a lower bound is obtained for the ground-state eigenvalue; numerical experiments are supplied to illustrate the theory.

Significance. If the variational argument establishing the discrete-energy lower bound holds under the stated assumptions on the nonlinearity and the chosen weak-gradient spaces, the result supplies a practical route to guaranteed lower bounds for both the energy and the eigenvalue. Such bounds complement the more common upper-bound constructions and are useful in applications where variational principles govern the ground state. The combination of weak Galerkin with post-processing is a targeted contribution to the numerical analysis of nonlinear eigenvalue problems.

minor comments (3)

[§2] The precise assumptions on the nonlinearity (growth conditions, convexity, etc.) are stated only briefly; they should be collected explicitly in §2 before the variational formulation is introduced, so that the reader can verify they are exactly the hypotheses used in the lower-bound proof.
[§4] The post-processing operator that converts the discrete energy bound into an eigenvalue lower bound is described at a high level; a short paragraph or algorithm box clarifying the steps (including any additional solves) would improve reproducibility.
[§5] In the numerical section, the tables report errors but do not indicate the polynomial degree or mesh-size sequence used for each example; adding this information would make the observed convergence rates directly comparable to the theoretical predictions.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive evaluation of our manuscript and the recommendation of minor revision. The referee summary correctly identifies the key results: the weak Galerkin scheme yields a lower bound on the discrete energy, and post-processing produces a lower bound on the ground-state eigenvalue, with supporting numerical experiments.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper establishes lower bounds on the discrete energy and ground-state eigenvalue through variational arguments applied to the weak Galerkin discretization of the Gross-Pitaevskii nonlinearity; these bounds are derived directly from the weak gradient definition and the chosen finite-element spaces rather than from any fitted parameter, self-referential definition, or load-bearing self-citation chain. The post-processing step for the eigenvalue is presented as a consequence of the energy inequality, with no reduction to inputs by construction visible in the stated claims or abstract. Numerical experiments are described only as validation of the analysis, not as the origin of the bounds. The derivation chain is therefore self-contained against external variational principles.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; all such items remain unknown.

pith-pipeline@v0.9.1-grok · 5569 in / 1044 out tokens · 22234 ms · 2026-06-29T06:27:55.142753+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

2 extracted references

[1]

Cancès, R

[1]E. Cancès, R. Chakir, and Y. Maday,Numerical analysis of nonlinear eigenvalue problems, Journal of Scientific Computing, 45 (2009). [2]Q. Lin, H. Xie, and J. Xu,Lower bounds of the discretization error for piecewise polynomials, Math. Comput., 83 (2013), pp. 1–13. [3]Y. Maday and C. Marcati,Analyticity andhpdiscontinuous galerkin approximation of non- ...

2009
[2]

17 [8]Q. Zhai, H. Xie, R. Zhang, and Z. Zhang,The weak galerkin method for elliptic eigenvalue problems, Communications in Computational Physics, 26 (2019), pp. 160–191. 18

2019

[1] [1]

Cancès, R

[1]E. Cancès, R. Chakir, and Y. Maday,Numerical analysis of nonlinear eigenvalue problems, Journal of Scientific Computing, 45 (2009). [2]Q. Lin, H. Xie, and J. Xu,Lower bounds of the discretization error for piecewise polynomials, Math. Comput., 83 (2013), pp. 1–13. [3]Y. Maday and C. Marcati,Analyticity andhpdiscontinuous galerkin approximation of non- ...

2009

[2] [2]

17 [8]Q. Zhai, H. Xie, R. Zhang, and Z. Zhang,The weak galerkin method for elliptic eigenvalue problems, Communications in Computational Physics, 26 (2019), pp. 160–191. 18

2019