On the susceptibility of numerical methods to computational chaos and superstability
From MaRDI portal
Publication:2199566
Recommendations
Cites work
- scientific article; zbMATH DE number 3850404 (Why is no real title available?)
- scientific article; zbMATH DE number 193486 (Why is no real title available?)
- A Unified Approach to Spurious Solutions Introduced by Time Discretisation. Part I: Basic Theory
- Analysis Still Matters: A Surprising Instance of Failure of Runge--Kutta--Felberg ODE Solvers
- CHARACTERISTIC LYAPUNOV EXPONENTS AND SMOOTH ERGODIC THEORY
- Central difference scheme and chaos
- Chaos in numerical analysis of ordinary differential equations
- Computational chaos - a prelude to computational instability
- Defect-controlled numerical methods and shadowing for chaotic differential equations
- Detection of the onset of numerical chaotic instabilities by Lyapunov exponents
- Deterministic Nonperiodic Flow
- Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. I: The dynamics of time discretization and its implications for algorithm development in computational fluid dynamics
- Euler-like discrete models of the logistic differential equation
- Explicit finite-difference methods for nonlinear dynamic systems: Froude's pendulum
- On Homoclinic Structure and Numerically Induced Chaos for the Nonlinear Schrödinger Equation
- On spurious asymptotic numerical solutions of explicit Runge-Kutta methods
- On spurious fixed points of Runge-Kutta methods
- Suppression of numerically induced chaos with nonstandard finite difference schemes
- The Lorenz attractor exists
- The Lorenz equations: bifurcations, chaos, and strange attractors
- Unified approach to spurious solutions introduced by time discretization Part II: BDF-like methods
- What good are numerical simulations of chaotic dynamical systems?
Cited in
(5)- Detection of the onset of numerical chaotic instabilities by Lyapunov exponents
- Computation of the largest positive Lyapunov exponent using rounding mode and recursive least square algorithm
- Computational chaos - a prelude to computational instability
- Chaos induced by the generalized Euler method
- Detecting unreliable computer simulations of recursive functions with interval extensions
This page was built for publication: On the susceptibility of numerical methods to computational chaos and superstability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199566)