Spectral models use timestep stability criteria based on maximum phase speeds similar to the CFL condition.
Peer-reviewed literature on numerical analysis confirms that spectral approximations to hyperbolic equations are governed by CFL-like stability conditions constraining the timestep.
rails:sufficiency:supported:single_source:for=1+0p:against=0+0p | v55:sufficiency
The CFL condition for spectral approximations to hyperbolic initial-boundary value problems. 1991. https://doi.org/10.1090/s0025-5718-1991-1066833-9
We study the stability of spectral approximations to scalar hyperbolic initial-boundary value problems with variable coefficients. Time is discretized by explicit multi-level or Runge-Kutta methods of order ≤ 3 \leq 3 (forward Euler time-differencing is included), and we study spatial discretizations by spectral and pseudospectral approximations associated with the general family of Jacobi polynomials. We prove that these fully explicit spectral approximations are stable provided their time step, Δ t \Delta t , is restricted by the CFL-like condition Δ t > Const ∙ N − 2 \Delta t > {\text {Const}} \bullet {N^{ - 2}} , where N equals the spatial number of degrees of freedom. We give two independent proofs of this result, depending on two different choices of appropriate L 2 {L^2} -weighted norms. In both approaches, the proofs hinge on a certain inverse inequality interesting for its own sake. Our result confirms the commonly held belief that the above CFL stability restriction, which is extensively used in practical implementations, guarantees the stability (and hence the convergence) of fully-explicit spectral approximations in the nonperiodic case.
See more details
Challenge the receipt
Citation formatting by citeproc-js (Frank Bennett) and the Citation Style Language project. Source and licenses.
Terms · Privacy · How verdicts work · Dispute this receipt