pith. sign in

arxiv: 1907.02472 · v1 · pith:K7CUWVSDnew · submitted 2019-07-04 · 🧮 math.NA · cs.NA

An hr-Adaptive Method for the Cubic Nonlinear Schr\"{o}dinger Equation

Pith reviewed 2026-05-25 08:51 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords hr-adaptive methodmoving meshnonlinear Schrödinger equationmonitor functionspatial error controlsecond-order convergencenumerical PDE
0
0 comments X

The pith

An hr-adaptive method for the cubic nonlinear Schrödinger equation achieves second-order spatial convergence and user-controlled error tolerance.

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

The paper develops a combined hr-adaptive numerical scheme that moves mesh nodes (r-adaptation) while also locally refining or coarsening them (h-adaptation) to solve the one-dimensional cubic nonlinear Schrödinger equation. Simulations demonstrate that the approach yields higher accuracy than pure moving-mesh methods and keeps the spatial discretization error within a user-prescribed tolerance. Evidence is supplied that a novel monitor function produces meshes for which the method attains second-order convergence in space.

Core claim

The hr-adaptive method, driven by a novel monitor function, solves the cubic NLSE in one space dimension such that the spatial error remains below a user-specified tolerance and the observed convergence rate is second order, outperforming other moving-mesh approaches in solution accuracy.

What carries the argument

The hr-adaptive procedure that couples r-adaptive node movement with h-adaptive local refinement, using a novel monitor function to generate the adaptive mesh.

If this is right

  • Spatial error stays within the tolerance supplied by the user.
  • Second-order spatial convergence is obtained for the cubic NLSE.
  • Solution accuracy exceeds that of pure moving-mesh schemes on comparable node counts.
  • The method adapts automatically when solution features become steeper or smoother over time.

Where Pith is reading between the lines

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

  • The same monitor-function construction may extend to other dispersive or nonlinear wave equations that develop localized steep gradients.
  • Error control via the tolerance parameter could reduce computational cost for long-time integrations compared with uniform meshes.
  • The hr-strategy offers a route to three-dimensional extensions where pure r-adaptation alone becomes insufficient.

Load-bearing premise

The novel monitor function produces a mesh that simultaneously delivers the claimed error control and the observed second-order spatial convergence for the cubic NLSE.

What would settle it

A numerical test in which the computed spatial error exceeds the user tolerance or the observed convergence rate drops below second order when the novel monitor function is employed.

Figures

Figures reproduced from arXiv: 1907.02472 by J.A. Mackenzie, W.R. Mekwi.

Figure 1
Figure 1. Figure 1: Numerical solution (circles) and exact solution (red line) for single soliton. [PITH_FULL_IMAGE:figures/full_fig_p013_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Mesh trajectories for the propagation of a single soliton. [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Evolution of η, ∆t and ||e||L2 with time as RTOL is quartered using ETOL= 10−8 . RTOL N0 ||e||L2 1.5 × 10−2 67 2.95 × 10−3 3.75 × 10−3 175 8.87 × 10−4 9.37 × 10−4 352 2.43 × 10−4 [PITH_FULL_IMAGE:figures/full_fig_p015_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: (a) Error in L2-norm using the hr-adaptive and energy conserving MCN schemes. (b) Error in the energy |E − E n h | using the hr-adaptive method. solution on the new grid via an interpolation based method. It is possible that frequent interpolation is a source of spatial error in the Revilla approach which could account for the discrepancy between the results. The approach in [36] uses the arc-length monito… view at source ↗
Figure 5
Figure 5. Figure 5: Numerical solution (circles) and reference solution (red line) for the interaction of [PITH_FULL_IMAGE:figures/full_fig_p019_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: (a) Mesh trajectories and (b) evolution of [PITH_FULL_IMAGE:figures/full_fig_p020_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: (a) Evolution of η and (b) time step history for the two soliton interaction problem. time with the period being approximately T = 0.8. The solution develops extremely large spatial and temporal gradients thus posing a stringent test to any numerical scheme. For the purpose of comparison with previous work, we integrated over five periods and took T = 4. For this simulation, we used the values RTOL= 10−3 ,… view at source ↗
Figure 8
Figure 8. Figure 8: (a) Solution profiles using the hr-method and (b) the evolution of the error in energy for two interacting solitons where the exact energy E = −2/3 [PITH_FULL_IMAGE:figures/full_fig_p021_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Numerical solution (circles) and reference solution (line) for interacting solitons [PITH_FULL_IMAGE:figures/full_fig_p021_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Numerical solution (circles) and reference solution (line) for the bound state of [PITH_FULL_IMAGE:figures/full_fig_p022_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: (a) Mesh trajectories for the region [−5, 5]×[0, 1] and (b) evolution of η for bound state of three solitons. The evolution of N and the time step history are shown in [PITH_FULL_IMAGE:figures/full_fig_p023_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: (a) Evolution of N and (b) time step history for bound state of three solitons. solution trajectories is shown in [PITH_FULL_IMAGE:figures/full_fig_p023_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: (a) Solution profile over 5 periods using the [PITH_FULL_IMAGE:figures/full_fig_p024_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Numerical solution (circles) and reference solution (line) for the bound state of [PITH_FULL_IMAGE:figures/full_fig_p025_14.png] view at source ↗
read the original abstract

The nonlinear Schr\"{o}dinger equation (NLSE) is one of the most important equations in quantum mechanics, and appears in a wide range of applications including optical fibre communications, plasma physics and biomolecule dynamics. It is a notoriously difficult problem to solve numerically as solutions have very steep temporal and spatial gradients. Adaptive moving mesh methods ($r$-adaptive) attempt to optimise the accuracy obtained using a fixed number of nodes by moving them to regions of steep solution features. This approach on its own is however limited if the solution becomes more or less difficult to resolve over the period of interest. Mesh refinement methods ($h$-adaptive), where the mesh is locally coarsened or refined, is an alternative adaptive strategy which is popular for time-independent problems. In this paper, we consider the effectiveness of a combined method ($hr$-adaptive) to solve the NLSE in one space dimension. Simulations are presented indicating excellent solution accuracy compared to other moving mesh approaches. The method is also shown to control the spatial error based on the user's input error tolerance. Evidence is also presented indicating second-order spatial convergence using a novel monitor function to generate the adaptive moving mesh.

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.

Referee Report

3 major / 2 minor

Summary. The paper presents an hr-adaptive finite-difference method for the one-dimensional cubic nonlinear Schrödinger equation that combines r-adaptation (moving mesh generated by a novel monitor function) with h-adaptation (local refinement/coarsening). Simulations are reported to demonstrate that the method controls the spatial error to a user-specified tolerance, achieves second-order spatial convergence, and yields higher accuracy than other moving-mesh approaches.

Significance. If the monitor-function construction and associated error estimates are shown to be sound, the work supplies a practical adaptive strategy for dispersive problems whose solutions develop localized steep gradients. The explicit demonstration of user-controlled spatial error is a useful practical contribution for applications in optics and quantum mechanics.

major comments (3)
  1. [§3.2] §3.2 (monitor-function construction): the novel monitor function is introduced without an explicit equidistribution principle or truncation-error analysis showing that the quantity being equidistributed yields a local truncation error of O(h²) for the underlying spatial discretization of the cubic NLSE; this is load-bearing for both the claimed second-order convergence and the error-control property.
  2. [§4.3] §4.3 (convergence experiments): the reported second-order rates and error-tolerance results rest on simulations whose reference solutions, error norms, and mesh-velocity coupling are not described in sufficient detail to confirm that order reduction does not occur at h-refinement interfaces or from the r-adaptation velocity term.
  3. [§3.3] §3.3 (hr-coupling): no analysis or numerical test is supplied to verify that the combined h- and r-adaptation preserves the formal order when the monitor function is recomputed after each h-refinement step.
minor comments (2)
  1. [Figure 5] Figure 5 caption should state the precise norm and reference solution used for the plotted errors.
  2. [§2] A short paragraph comparing the novel monitor to the standard arc-length or curvature monitors used in prior moving-mesh NLSE papers would improve context.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address each major point below and will revise the manuscript to incorporate the requested clarifications and supporting material.

read point-by-point responses
  1. Referee: [§3.2] §3.2 (monitor-function construction): the novel monitor function is introduced without an explicit equidistribution principle or truncation-error analysis showing that the quantity being equidistributed yields a local truncation error of O(h²) for the underlying spatial discretization of the cubic NLSE; this is load-bearing for both the claimed second-order convergence and the error-control property.

    Authors: We agree that an explicit derivation linking the monitor function to the equidistribution principle and a truncation-error analysis would strengthen the presentation. In the revised manuscript we will add a dedicated subsection deriving the monitor function from an equidistribution principle and providing a truncation-error analysis that confirms the local truncation error remains O(h²) for the underlying second-order spatial discretization of the cubic NLSE. revision: yes

  2. Referee: [§4.3] §4.3 (convergence experiments): the reported second-order rates and error-tolerance results rest on simulations whose reference solutions, error norms, and mesh-velocity coupling are not described in sufficient detail to confirm that order reduction does not occur at h-refinement interfaces or from the r-adaptation velocity term.

    Authors: We acknowledge that the current description of the numerical experiments is insufficient to allow independent verification of the reported orders. In the revision we will expand §4.3 with: (i) explicit statements of how reference solutions are generated (high-resolution fixed-mesh computations or exact solutions where available), (ii) the precise error norms used, and (iii) a description of the mesh-velocity term treatment and its handling at h-refinement interfaces, together with additional numerical checks confirming that order reduction does not occur. revision: yes

  3. Referee: [§3.3] §3.3 (hr-coupling): no analysis or numerical test is supplied to verify that the combined h- and r-adaptation preserves the formal order when the monitor function is recomputed after each h-refinement step.

    Authors: We agree that a direct verification of order preservation under the combined hr-adaptation is desirable. The revised manuscript will include a new numerical test that recomputes the monitor function after each h-refinement step and reports the observed convergence rates, thereby confirming that the formal second-order accuracy is retained. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper presents an hr-adaptive numerical method for the cubic NLSE as an independent algorithmic construction, with claims of error control and second-order convergence supported by simulations using a novel monitor function. No equations, parameter fits, or self-citations in the abstract or described claims reduce any reported result to a tautology by construction. The monitor function is introduced as part of the method rather than defined in terms of the target convergence order, and no load-bearing self-citation chains or ansatz smuggling are identifiable from the given text. This is the most common honest finding for a methods paper whose central claims rest on external simulation evidence rather than internal redefinition.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the monitor function itself is described only as novel without further specification.

pith-pipeline@v0.9.0 · 5737 in / 1056 out tokens · 27360 ms · 2026-05-25T08:51:54.604042+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages

  1. [1]

    Adjerid and J

    S. Adjerid and J. E. Flaherty. A moving finite element method with error estimation and refinement for one-dimensional time dependent partial differential equations. SIAM 24 Figure 14: Numerical solution (circles) and reference solution (line) for the bound state of three solitons using MCN scheme and a uniform mesh with N = 210. J. Numer. Anal. , 23(4):778–...

  2. [2]

    B. A. Ammons and M. Vable. An HR-method of mesh refinement for boundary element method. Int. J. Numer. Meth. Eng. , 43(6):979–996, 1998

  3. [3]

    Barletti, L

    L. Barletti, L. Brugnano, G. Frasca Caccia, and F. Iavernaro. Energy-conserving meth- ods for the nonlinear Schr¨ odinger equation.Appl. Math. Comput. , 318:3–18, 2018

  4. [4]

    Beckett and J

    G. Beckett and J. A. Mackenzie. Convergence analysis of finite difference approxima- tions on equidistributed grids to a singularly perturbed boundary value problem. Appl. Numer. Math., 35:87–109, 2000

  5. [5]

    Beckett, J

    G. Beckett, J. A. Mackenzie, A. Ramage, and D. M. Sloan. On the numerical solution of one-dimensional PDEs using adaptive methods based on equidistribution. J. Comput. Phys., 167:372–392, 2001. 25

  6. [6]

    Beckett, J

    G. Beckett, J. A. Mackenzie, and M. L. Robertson. A moving mesh finite element method for the solution of two-dimensional Stefan problems.J. Comput. Phys., 168:500– 518, 2001

  7. [7]

    C. J. Budd, S. Chen, and R. D. Russell. New self-similar solutions of the nonlinear Schr¨ odinger equation with moving mesh computations.J. Comput. Phys. , 152(2):756 – 789, 1999

  8. [8]

    C. J. Budd, W. Huang, and R. D. Russell. Adaptivity with moving grids.Acta Numerica, 18:111–241, 2009

  9. [9]

    W. Cao, W. Huang, and R. D. Russell. Comparison of two-dimensional r-adaptive finite element methods using various error indicators. Math. Comput. Simulat. , 56:127–143, 2001

  10. [10]

    W. Cao, W. Huang, and R. D. Russell. Approaches for generating moving adaptive meshes: location versus velocity. Appl. Numer. Math. , 47(2):121 – 138, 2003. Second International Workshop on Numerical Linear Algebra - Numerical Methods for Partial Differential Equations and Optimization

  11. [11]

    Ceniceros

    Hector D. Ceniceros. A semi-implicit moving mesh method for the focusing nonlinear Schr¨ odinger equation.Commun. Pur. Appl. Ana. , 1(4):1–14, October 2002

  12. [12]

    Good approximation by splines with variable knots II

    Carl de Boor. Good approximation by splines with variable knots II. In Springer Lecture Notes Series, 363. Springer-Verlag, 1973

  13. [13]

    Delfour, M

    M. Delfour, M. Fortin, and G. Payre. Finite-difference solutions of a non-linear Schr¨ odinger equation.J. Comput. Phys. , 44:277–288, 1981

  14. [14]

    Z. Fei, V. M. P´ erez-Garc´ ıa, and L. V´ azquez. Numerical simulation of nonlinear Schr¨ odinger systems: A new conservative scheme. Appl. Math. Comput. , 71:165–177, 1995

  15. [15]

    Gao and S

    Q. Gao and S. Zhang. Moving mesh strategies of adaptive methods for solving nonlinear partial differential equations. Algorithms, 9(4), 2016

  16. [16]

    Hairer and G

    E. Hairer and G. Wanner. Solving Ordinary Differential Equations II Stiff and Differential-Algebraic Problems. Springer, Berlin, 1991

  17. [17]

    D. F. Hawken, J. J. Gottlieb, and J. S. Hansen. Review of some adaptive node-movement techniques in finite-element and finite-difference solutions of partial differential equa- tions. J. Comput. Phys. , 95:254–302, 1991

  18. [18]

    B. M. Herbst, J. Ll. Morris, and A. R. Mitchell. Numerical experience with the nonlinear schr¨ odinger equation.J. Comput. Phys. , 60:282–305, 1985

  19. [19]

    F. Hu, R. Wang, X. Chen, and H. Feng. An adaptive mesh method for 1D hyperbolic conservation laws. Appl. Numer. Math. , 91:11–25, 2015

  20. [20]

    W. Huang. Practical aspects of formulation and solution of moving mesh partial differ- ential equations. J. Comput. Phys. , 171:753, 2001. 26

  21. [21]

    Huang, Y

    W. Huang, Y. Ren, and R. D. Russell. Moving mesh methods based on moving mesh partial differential equations. J. Comput. Phys. , 113:279–290, 1994

  22. [22]

    Huang, Y

    W. Huang, Y. Ren, and R. D. Russell. Moving mesh partial differential equations (MMPDES) based on the equidistribution principle. SIAM J. Numer. Anal., 31(3):709– 730, 1994

  23. [23]

    Huang and R

    W. Huang and R. D. Russell. Moving mesh strategy based on a gradient flow equation for two-dimensional problems. SIAM J. Sci. Comput. , 20(3):998–1015, 1999

  24. [24]

    Huang and R

    W. Huang and R. D. Russell. Adaptive mesh movement - the MMPDE approach and its applications. J. Comput. Appl. Math. , 128:383–398, 2001

  25. [25]

    E. Kita, K. Higuchi, and N. Kamiya. r- and hr-adaptive boundary element method for two-dimensional potential problem. Computers & Structures , 74(1):11–19, 2000

  26. [26]

    Lee, M.J

    T.E. Lee, M.J. Baines, and S. Langdon. A finite difference moving mesh method based on conservation for moving boundary problems. J. Comput. Appl. Math. , 288:1–17, 2015

  27. [27]

    R. Li, T. Tang, and P. Zhang. Moving mesh methods in multiple dimensions based on harmonic maps. J. Comput. Phys. , 170(2):562 – 588, 2001

  28. [28]

    J. A. Mackenzie and W. R. Mekwi. On the use of moving mesh methods to solve PDEs. In T. Tang and J. Xu, editors, Adaptive Computations: Theory and Algorithms , pages 242–278. Science Press, Beijing, 2007

  29. [29]

    An envelope soliton problem

    John W Miles. An envelope soliton problem. SIAM J. Appl. Math. , 41(2):227–230, October 1981

  30. [30]

    W. F. Mitchell and M. A. McClain. A Survey of hp-Adaptive Strategies for Elliptic Partial Differential Equations , pages 227–258. Springer Netherlands, 2011

  31. [31]

    L. S. Mulholland, Y. Qiu, and D. M. Sloan. Solution of evolutionary partial differen- tial equations using adaptive finite differences with pseudospectral post-processing. J. Comput. Phys., 131:280–298, 1997

  32. [32]

    B. Ong, R. Russell, and S. Ruuth. An hr moving mesh method for one-dimensional time-dependent PDEs. In Proceedings of 21st International Meshing Roundtable, pages 39–54. Springer Berlin Heidelberg, 2013

  33. [33]

    Piggott, C.C

    M.D. Piggott, C.C. Pain, G.J. Gorman, P.W. Power, and A.J.H. Goddard. h, r, and hr adaptivity with applications in numerical ocean modelling. Ocean Modelling, 10(1):95 – 113, 2005

  34. [34]

    M. A. Revilla. Simple time and space adaptation in one-dimensional evolutionary partial differential equations. Int. J. Numer. Meth. Eng. , 23:2263–2275, 1986

  35. [35]

    J. M. Sanz-Serna. Methods for the numerical solution of the nonlinear Schroedinger equation. Math. Comput., 43(167):21–27, 1984

  36. [36]

    J. M. Sanz-Serna and I. Christie. A simple adaptive technique for nonlinear wave problems. J. Comput. Phys. , 67:348–360, 1986. 27

  37. [37]

    J. M. Sanz-Serna and V. S. Manoranjan. A method for the integration in time of certain partial differential equations. J. Comput. Phys. , 52:273–289, 1983

  38. [38]

    J. M. Sanz-Serna and J. G. Verwer. Conservative and nonconservative schemes for the solution of the nonlinear Schr¨ odinger equation.IMA J. Numer. Anal. , 6:25–42, 1986

  39. [39]

    Saucez, A

    P. Saucez, A. Vande Wouwer, and W. E. Schiesser. Some observations on a static spatial remeshing method based on equidistribution principles. J. Comput. Phys., 128:274–288, 1996

  40. [40]

    T. R. Taha and M. J. Ablowitz. Analytical and numerical aspects of certain nonlinear evolution equations. II. numerical, nonlinear Schr¨ odinger equation. J. Comput. Phys. , 55:203–230, 1984

  41. [41]

    Z. Tan, Z. Zhang, Y. Huang, and T. Tang. Moving mesh methods with locally varying time steps. J. Comput. Phys. , 200:347–367, 2004

  42. [42]

    Tang and T

    H. Tang and T. Tang. Adaptive mesh methods for one- and two-dimensional hyperbolic conservation laws. SIAM J. Numer. Anal. , 41(2):487–515, 2003

  43. [43]

    T. Tang. Moving mesh methods for computational fluid dynamics. Contemporary Mathematics, 383:141–174, 2005

  44. [44]

    Vande Wouwer, Ph

    A. Vande Wouwer, Ph. Saucez, and W. E. Schiesser, editors. Adaptive Method of Lines. Chapman & Hall/CRC, 2001

  45. [45]

    J. G. Verwer, J. G. Blom, and J. M. Sanz-Serna. An adaptive moving grid method for one-dimensional systems of partial differential equations. J. Comput. Phys., 82:454–486, 1989

  46. [46]

    Wang and C

    P. Wang and C. Huang. An energy conservative difference scheme for the nonlinear fractional Schr¨ odinger equations.J. Comput. Phys. , 293:238 – 251, 2015

  47. [47]

    G. B. Whitham. Linear and Nonlinear Waves . John Wiley & Sons, 1974

  48. [48]

    S. Xie, G. Li, and S. Yi. Compact finite difference schemes with high accuracy for one- dimensional nonlinear Schr¨ odinger equation. Comput. Methods Appl. Mech. Engrg. , 198(9-12):1052 – 1060, 2009

  49. [49]

    Zhang and T

    Z. Zhang and T. Tang. An adaptive mesh redistribution algorithm for convection- dominated problems. Commun. Pur. Appl. Ana. , 1(3):341–357, 2002. 28