Computation of optimal linear strong stability preserving methods via adaptive spectral transformations of Poisson-Charlier measures
From MaRDI portal
Publication:2051079
absolutely monotonic functionsGaussian quadrature rulesgeneralized Laguerre polynomialsoptimal threshold factorsPoisson-Charlier polynomialsRunge-Kutta methodsspectral transformationsstrong stability preserving schemes
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical quadrature and cubature formulas (65D32) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20)
Abstract: Strong stability preserving (SSP) coefficients govern the maximally allowable step-size at which positivity or contractivity preservation of integration methods for initial value problems is guaranteed. In this paper, we show that the task of computing linear SSP coefficients of explicit one-step methods is, to a certain extent, equivalent to the problem of characterizing positive quadratures with integer nodes with respect to Poisson-Charlier measures. Using this equivalence, we provide sharp upper and lower bounds for the optimal linear SSP coefficients in terms of the zeros of generalized Laguerre orthogonal polynomials. This in particular provides us with a sharp upper bound for the optimal SSP coefficients of explicit Runge-Kutta methods. Also based on this equivalence, we propose a highly efficient and stable algorithm for computing these coefficients, and their associated optimal linear SSP methods, based on adaptive spectral transformations of Poisson-Charlier measures. The algorithm possesses the remarkable property that its complexity depends only on the order of the method and thus is independent of the number of stages. Our results are achieved by adapting and extending an ingenious technique by Bernstein in his seminal work on absolutely monotonic functions. Moreover, the techniques introduced in this work can be adapted to solve the integer quadrature problem for any positive discrete multi-parametric measure supported on under some mild conditions on the zeros of the associated orthogonal polynomials.
Recommendations
- Strong stability preserving explicit peer methods
- Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations
- Optimal implicit strong stability preserving Runge-Kutta methods
- Strong stability preserving properties of composition Runge-Kutta schemes
- Explicit strong stability preserving multistep Runge-Kutta methods
Cites work
- \(q\)-blossoming and Hermite-Padé approximants to the \(q\)-exponential function
- Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
- Absolute monotonicity of rational functions occurring in the numerical solution of initial value problems
- An Implemention of Christoffel's Theorem in the Theory of Orthogonal Polynomials
- Approximation by Chebyshevian Bernstein operators versus convergence of dimension elevation
- Blossoms are polar forms
- Calculation of Gauss Quadrature Rules
- Complex Bézier curves and the geometry of polygons
- Computation of optimal monotonicity preserving general linear methods
- Conservation de la positivité lors de la discrétisation des problèmes d'évolution paraboliques
- Contractivity in the numerical solution of initial value problems
- Contractivity of Runge-Kutta methods
- Contractivity preserving explicit linear multistep methods
- Contractivity-Preserving Implicit Linear Multistep Methods
- High-order RKDG methods for computational electromagnetics
- scientific article; zbMATH DE number 3820981 (Why is no real title available?)
- scientific article; zbMATH DE number 3485662 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- scientific article; zbMATH DE number 3037624 (Why is no real title available?)
- On certain determinants whose elements are orthogonal polynomials
- On strong stability preserving time discretization methods
- Optimal implicit strong stability preserving Runge-Kutta methods
- Rational functions with maximal radius of absolute monotonicity
- Strong stability preserving properties of Runge--Kutta time discretization methods for linear constant coefficient operators
- Strong stability-preserving high-order time discretization methods
- The CFL Condition for Spectral Approximations to Hyperbolic Initial-Boundary Value Problems
- The fundamental blossoming inequality in Chebyshev spaces. I: Applications to Schur functions
- Zeros of classical orthogonal polynomials of a discrete variable
This page was built for publication: Computation of optimal linear strong stability preserving methods via adaptive spectral transformations of Poisson-Charlier measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051079)
