pith. sign in

arxiv: 2604.20536 · v1 · submitted 2026-04-22 · 🧮 math.NA · cs.NA

Construction of Laguerre pseudospectral differentiation matrices

Emma Nel , Nicholas Hale This is my paper

Pith reviewed 2026-05-09 23:46 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords Laguerre polynomialspseudospectral methodsdifferentiation matricesnumerical stabilitycollocation nodesspectral methodsorthogonal polynomialsnumerical linear algebra
0
0 comments X

The pith

Laguerre pseudospectral differentiation matrices can be constructed stably by reformulating off-diagonal entries and using closed-form diagonals together with a fast node generator.

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

The paper develops a method to build these matrices without the loss of precision that occurs when subtracting nearly equal quantities in the classical formulas. Off-diagonal entries are rewritten so that all quantities can be generated at once by an existing fast algorithm that also produces the collocation nodes. Diagonal entries are supplied directly by a closed expression chosen for floating-point stability. This produces an all-in-one routine that maintains accuracy at far larger point counts than standard constructions allow.

Core claim

The construction avoids the catastrophic cancellation present in classical formulations and yields an all-in-one procedure for generating differentiation matrices by reformulating the off-diagonal entries and computing all required quantities simultaneously using an existing fast algorithm that also generates the collocation nodes, with a closed-form expression employed for the diagonal entries to improve numerical accuracy.

What carries the argument

Reformulation of the off-diagonal entries of the differentiation matrix together with a closed-form expression for the diagonal entries, integrated with a fast algorithm for simultaneous generation of collocation nodes.

If this is right

  • The matrices remain accurate and robust at significantly larger numbers of collocation points than standard implementations permit.
  • Generation of the full differentiation matrix becomes a single combined step with node computation.
  • Classical subtraction-based formulas for off-diagonal entries are replaced by expressions free of catastrophic cancellation.
  • High-order pseudospectral approximations on the half-line become feasible without repeated reformulation of the matrix.

Where Pith is reading between the lines

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

  • The same combination of reformulation and closed-form terms could be tested on differentiation matrices for other classical orthogonal polynomials.
  • Higher-resolution Laguerre spectral methods for boundary-value problems on unbounded domains may now be practical without custom preconditioning.
  • Embedding matrix construction inside the node generator reduces the number of separate numerical steps required in a typical pseudospectral code.

Load-bearing premise

The existing fast algorithm for generating collocation nodes can be adapted without introducing new instabilities and the closed-form expression for the diagonal remains stable in ordinary floating-point arithmetic.

What would settle it

For N greater than 300, compare the maximum absolute difference between the matrix produced by the new procedure and a reference matrix computed in quadruple precision; if the difference grows beyond 1e-12 while the reference stays accurate, the stability claim fails.

read the original abstract

In this paper, we present a stable and efficient approach for constructing Laguerre pseudospectral differentiation matrices. The proposed method reformulates the off-diagonal entries and computes all required quantities simultaneously using an existing fast algorithm that also generates the collocation nodes. For the diagonal entries, a closed-form expression is employed to improve numerical accuracy. This construction avoids the catastrophic cancellation present in classical formulations and yields an all-in-one procedure for generating differentiation matrices. Numerical experiments demonstrate improved robustness and sustained high accuracy for significantly larger numbers of collocation points compared to standard implementations.

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

0 major / 1 minor

Summary. The paper presents a stable and efficient construction for Laguerre pseudospectral differentiation matrices. Off-diagonal entries are reformulated to be computed simultaneously with the collocation nodes via an existing fast algorithm, while diagonal entries use a closed-form expression to avoid catastrophic cancellation. This yields an all-in-one procedure, with numerical experiments claimed to demonstrate improved robustness and sustained accuracy for significantly larger numbers of collocation points than standard implementations.

Significance. If the stability and accuracy claims hold, the method provides a practical improvement for pseudospectral methods on semi-infinite domains, where Laguerre polynomials are commonly used. The reuse of a fast node-generation algorithm and the closed-form diagonal are strengths that could enable reliable high-order computations in applications such as quantum mechanics or boundary-layer problems.

minor comments (1)
  1. [Abstract] The abstract states that numerical experiments demonstrate improved robustness and high accuracy for larger N, but does not report specific quantitative metrics (e.g., maximum absolute errors, condition numbers, or direct comparisons at particular N values). Including such data in the results section would strengthen the central claim of superiority over classical formulations.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and for recommending minor revision. The referee's summary correctly captures the key elements of our work: the reformulation of off-diagonal entries to be computed simultaneously with the nodes via a fast algorithm, the use of a closed-form expression for the diagonal to avoid cancellation, and the resulting all-in-one procedure that maintains accuracy for larger numbers of collocation points.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper's central construction reformulates the off-diagonal entries of the Laguerre differentiation matrix by leveraging an existing fast algorithm for collocation nodes (which simultaneously generates the nodes themselves) and substitutes a closed-form expression for the diagonal entries to sidestep cancellation. This is explicitly described as mathematically equivalent to classical constructions while improving numerical stability, with no reduction of any claimed result to a fitted parameter, self-defined quantity, or load-bearing self-citation chain. The derivation rests on standard properties of Laguerre polynomials and pseudospectral differentiation, which are independently established outside the paper and do not loop back to the present claims.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based solely on the abstract, the construction relies on standard properties of Laguerre polynomials and an existing fast algorithm for collocation nodes; no free parameters, axioms beyond standard math, or invented entities are apparent.

pith-pipeline@v0.9.0 · 5373 in / 978 out tokens · 59144 ms · 2026-05-09T23:46:50.494214+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

45 extracted references · 45 canonical work pages

  1. [1]

    Adams, L. (2022). DMSuite.jl . https://github.com/l90lpa/DMSuite.jl. GitHub repository, accessed February 3, 2026

    work page 2022

  2. [2]

    Adhikari, R. (2013). pyddx. https://github.com/ronojoy/pyddx. GitHub repository, accessed February 3, 2026

    work page 2013

  3. [3]

    and Trummer, M

    Baltensperger, R. and Trummer, M. R. (2003). Spectral differencing with a twist. SIAM J. Sci. Comput. , 24(5):1465--1487

    work page 2003

  4. [4]

    Boyd, J. P. (2001). Chebyshev and F ourier spectral methods . Dover Publications, 2nd edition

    work page 2001

  5. [5]

    J., Vasil, G

    Burns, K. J., Vasil, G. M., Oishi, J. S., Lecoanet, D., and Brown, B. P. (2020). Dedalus: A flexible framework for numerical simulations with spectral methods. Phys. Rev. Res. , 2(2)

    work page 2020

  6. [6]

    Y., Quarteroni, A., and Zang, T

    Canuto, C., Hussaini, M. Y., Quarteroni, A., and Zang, T. A. (1988). Spectral methods in fluid dynamics . Springer Series in Computational Physics. Springer-Verlag, New York

    work page 1988

  7. [7]

    Y., Quarteroni, A., and Zang, T

    Canuto, C., Hussaini, M. Y., Quarteroni, A., and Zang, T. A. (2006). Spectral methods: Fundamentals in single domains . Scientific Computation. Springer-Verlag, Berlin

    work page 2006

  8. [8]

    Driscoll, T. A. and Hale, N. (2016). Rectangular spectral collocation. IMA J. Numer. Anal. , 36(1):108--132

    work page 2016

  9. [9]

    A., Hale, N., and Trefethen, L

    Driscoll, T. A., Hale, N., and Trefethen, L. N., editors (2014). Chebfun Guide . Pafnuty Publications, Oxford

    work page 2014

  10. [10]

    Funaro, D. (1990). Computational aspects of pseudospectral L aguerre approximations. Appl. Numer. Math. , 6(6):447--457

    work page 1990

  11. [11]

    Gatteschi, L. (2002). Asymptotics and bounds for the zeros of L aguerre polynomials: a survey. J. Comput. Appl. Math. , 144(1-2):7--27

    work page 2002

  12. [12]

    Gautschi, W. (2004). Orthogonal polynomials: computation and approximation . Numerical Mathematics and Scientific Computation. Oxford University Press, New York

    work page 2004

  13. [13]

    Gheorghiu, C.-I. (2013). Laguerre collocation solutions to boundary layer type problems. Numer. Algorithms , 64(2):385--401

    work page 2013

  14. [14]

    Gil, A., Segura, J., and Temme, N. M. (2018). Asymptotic approximations to the nodes and weights of G auss- H ermite and G auss- L aguerre quadratures. Stud. Appl. Math. , 140(3):298--332

    work page 2018

  15. [15]

    Gil, A., Segura, J., and Temme, N. M. (2019). Fast, reliable and unrestricted iterative computation of G auss- H ermite and G auss- L aguerre quadratures. Numer. Math. , 143(3):649--682

    work page 2019

  16. [16]

    Gil, A., Segura, J., and Temme, N. M. (2025). Fast and accurate computation of classical Gaussian quadratures. Preprint, arXiv:2509.16716

    work page arXiv 2025

  17. [17]

    Glaser, A., Liu, X., and Rokhlin, V. (2007). A fast algorithm for the calculation of the roots of special functions. SIAM J. Sci. Comput. , 29(4):1420--1438

    work page 2007

  18. [18]

    Golub, G. H. and Welsch, J. H. (1969). Calculation of G auss quadrature rules. Math. Comp. , 23:221--230

    work page 1969

  19. [19]

    and Orszag, S

    Gottlieb, D. and Orszag, S. A. (1977). Numerical analysis of spectral methods: Theory and applications , volume 26 of CBMS-NSF Regional Conference Series in Applied Mathematics . SIAM

    work page 1977

  20. [20]

    and Eisenstat, S

    Gu, M. and Eisenstat, S. C. (1995). A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. , 16(1):172--191

    work page 1995

  21. [21]

    Hale, N., Thomann, E., and Weideman, J. (2025). Approximate solutions to a nonlinear functional differential equation. Preprint, arXiv:2401.11733

    work page arXiv 2025

  22. [22]

    Henrici, P. (1964). Elements of numerical analysis . John Wiley & Sons

    work page 1964

  23. [23]

    and Yu, H

    Huang, S. and Yu, H. (2024). Improved L aguerre spectral methods with less round-off errors and better stability. J. Sci. Comput. , 101(3)

    work page 2024

  24. [24]

    Jewell, N. (2009). Laguerre spectral/pseudospectral library. https://www.mathworks.com/matlabcentral/fileexchange/26089-laguerre-spectral-pseudospectral-library. MATLAB Central File Exchange, accessed February 3, 2026

    work page 2009

  25. [25]

    and Delkhosh, M

    Latifi, S. and Delkhosh, M. (2019). SPSMAT : GNU Octave software package for spectral and pseudospectral methods

    work page 2019

  26. [26]

    Maday, Y., Pernaud-Thomas, B., and Vandeven, H. (1985). Reappraisal of Laguerre type spectral methods. La Recherche Aerospatiale , 6:13--35

    work page 1985

  27. [27]

    Mortensen, M. (2018). Shenfun: High performance spectral Galerkin computing platform. Journal of Open Source Software , 3(31):1071

    work page 2018

  28. [28]

    Nel, E. (2026). MATLAB code to accompany: Construction of L aguerre pseudospectral differentiation matrices. https://github.com/Emma-Nel/LaguerreDifmat. GitHub repository, accessed April 21, 2026

    work page 2026

  29. [29]

    Olver, F. W. J., Lozier, D. W., Boisvert, R. F., and Clark, C. W., editors (2010). N IST handbook of mathematical functions . Cambridge University Press

    work page 2010

  30. [30]

    and Townsend, A

    Olver, S. and Townsend, A. (2014). A practical framework for infinite-dimensional linear algebra. In 2014 First Workshop for High Performance Technical Computing in Dynamic Languages , pages 57--62

    work page 2014

  31. [31]

    and Huybrechs, D

    Opsomer, P. and Huybrechs, D. (2023). High-order asymptotic expansions of G aussian quadrature rules with classical and generalized weight functions. J. Comput. Appl. Math. , 434

    work page 2023

  32. [32]

    Shen, J. (2000). Stable and efficient spectral methods in unbounded domains using L aguerre functions. SIAM J. Numer. Anal. , 38(4):1113--1133

    work page 2000

  33. [33]

    Shen, J., Tang, T., and Wang, L.-L. (2011). Spectral methods: Algorithms, analysis and applications , volume 41 of Springer Series in Computational Mathematics . Springer, Heidelberg

    work page 2011

  34. [34]

    and Wang, L.-L

    Shen, J. and Wang, L.-L. (2009). Some recent advances on spectral methods for unbounded domains. Commun. Comput. Phys. , 5(2-4):195--241

    work page 2009

  35. [35]

    Steinerberger, S. (2018). Electrostatic interpretation of zeros of orthogonal polynomials. Proc. Amer. Math. Soc. , 146(12):5323--5331

    work page 2018

  36. [36]

    Stieltjes, T. J. (1885). Sur certains polyn \^o mes qui v \'e rifient une \'e quation diff \'e rentielle lin \'e aire du second ordre et sur la th \'e orie des fonctions de lam \'e . Acta Mathematica , 6:321--326

    work page

  37. [37]

    Szeg\" o , G. (1939). Orthogonal polynomials , volume 23 of American Mathematical Society Colloquium Publications . American Mathematical Society, 3rd edition

    work page 1939

  38. [38]

    von Winckel, G. (2004). Pseudospectral differentiation on an arbitrary grid. https://www.mathworks.com/matlabcentral/fileexchange/5515-pseudospectral-differentiation-on-an-arbitrary-grid. MATLAB Central File Exchange, accessed February 3, 2026

    work page 2004

  39. [39]

    Wang, H. (2024). Convergence analysis of L aguerre approximations for analytic functions. Math. Comp. , 93(350):2861--2884

    work page 2024

  40. [40]

    and Guo, B.-Y

    Wang, T.-J. and Guo, B.-Y. (2008). Composite generalized L aguerre- L egendre pseudospectral method for F okker- P lanck equation in an infinite channel. Appl. Numer. Math. , 58(10):1448--1466

    work page 2008

  41. [41]

    and Sun, T

    Wang, T.-J. and Sun, T. (2016). Mixed pseudospectral method for heat transfer. Math. Model. Anal. , 21(2):199--219

    work page 2016

  42. [42]

    Weideman, J. A. C. (2003a). A MATLAB Differentiation Matrix Suite . https://appliedmaths.sun.ac.za/ weideman/research/differ.html. Personal website of J.A.C. Weideman, accessed March 4, 2026

    work page 2026

  43. [43]

    Weideman, J. A. C. (2003b). DMSUITE . https://www.mathworks.com/matlabcentral/fileexchange/29-dmsuite. MATLAB Central File Exchange, accessed March 4, 2026

    work page 2026

  44. [44]

    Weideman, J. A. C. and Reddy, S. C. (2000). A MATLAB differentiation matrix suite. ACM Trans. Math. Software , 26(4):465--519

    work page 2000

  45. [45]

    Welfert, B. D. (1997). Generation of pseudospectral differentiation matrices I . SIAM J. Numer. Anal. , 34(4):1640--1657

    work page 1997