A study of the recursion \(y_{n+1}=y_ n+\tau y^ m_ n\)

DOI10.1016/S0022-247X(86)80010-5zbMath0599.65086MaRDI QIDQ1080638

Jan G. Verwer, Jesús María Sanz-Serna

Publication date: 1986

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

asymptotic estimatesBoundsnonlinear recursion

Mathematics Subject Classification ID

Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (10)

Numerical and mathematical analysis of blow-up problems for a stochastic differential equation ⋮ Studies in numerical nonlinear instability. II. A new look at \(u_ t+uu_ x=0\) ⋮ The numerical study of blowup with application to a nonlinear Schrödinger equation ⋮ Stability concepts and their applications ⋮ Numerical method of estimating the blow-up time and rate of the solution of ordinary differential equations -- an application to the blow-up problems of partial differential equations ⋮ The Euler method in the numerical integration of reaction-diffusion problems with blow up ⋮ On the Simulation of Nonlinear Bidimensional Spiking Neuron Models ⋮ On the blow-up time convergence of semidiscretizations of reaction-diffusion equations ⋮ Blowup in diffusion equations: A survey ⋮ Theta Method Dynamics

Cites Work

• Unnamed Item
• A numerical study of the nonlinear Schrödinger equation
• A method for the integration in time of certain partial differential equations
• Methods for the Numerical Solution of the Nonlinear Schroedinger Equation
• Conerservative and Nonconservative Schemes for the Solution of the Nonlinear Schrödinger Equation

This page was built for publication: A study of the recursion \(y_{n+1}=y_ n+\tau y^ m_ n\)