scholarly journals PHASE SPACE ERROR CONTROL WITH VARIABLE TIME-STEPPING ALGORITHMS APPLIED TO THE FORWARD EULER METHOD FOR AUTONOMOUS DYNAMICAL SYSTEMS

2019 ◽  
pp. 16-26
Author(s):  
R. Vigneswaran ◽  
S. Thilaganathan
Keyword(s):  
Fixed Point ◽  
Phase Space ◽  
Dynamical Systems ◽  
Linear System ◽  
Error Control ◽  
Coefficient Matrix ◽  
Euler Method ◽  
Space Error ◽  
Forward Euler ◽  
Forward Euler Method

We consider a phase space stability error control for numerical simulation of dynamical systems. Standard adaptive algorithm used to solve the linear systems perform well during the finite time of integration with fixed initial condition and performs poorly in three areas. To overcome the difficulties faced the Phase Space Error control criterion was introduced. A new error control was introduced by R. Vigneswaran and Tony Humbries which is generalization of the error control first proposed by some other researchers. For linear systems with a stable hyperbolic fixed point, this error control gives a numerical solution which is forced to converge to the fixed point. In earlier, it was analyzed only for forward Euler method applied to the linear system whose coefficient matrix has real negative eigenvalues. In this paper we analyze forward Euler method applied to the linear system whose coefficient matrix has complex eigenvalues with negative large real parts. Some theoretical results are obtained and numerical results are given.

scholarly journals Phase Space Error Control for Dynamical Systems

2000 ◽  
Vol 21 (6) ◽  
pp. 2275-2294 ◽  
Author(s):  
D. J. Higham ◽  
A. R. Humphries ◽  
R. J. Wain
Keyword(s):  
Phase Space ◽  
Dynamical Systems ◽  
Error Control ◽  
Space Error

scholarly journals Error estimates for forward Euler shock capturing finite element approximations of the one-dimensional Burgers' equation

2015 ◽  
Vol 25 (11) ◽  
pp. 2015-2042
Author(s):  
Erik Burman
Keyword(s):  
Finite Element ◽  
Error Estimates ◽  
Burgers Equation ◽  
Euler Method ◽  
Second Order ◽  
Shock Capturing ◽  
Discrete Solution ◽  
A Priori Bound ◽  
Forward Euler ◽  
Forward Euler Method

We propose an error analysis for a shock capturing finite element method for the Burgers' equation using the duality theory due to Tadmor. The estimates use a one-sided Lipschitz stability (Lip+-stability) estimate on the discrete solution and are obtained in a weak norm, but thanks to a total variation a priori bound on the discrete solution and an interpolation inequality, error estimates in Lp-norms (1 ≤ p < ∞) are deduced. Both first-order artificial viscosity and a nonlinear shock capturing term that formally is of second order are considered. For the discretization in time we use the forward Euler method. In the numerical section we verify the convergence order of the nonlinear scheme using the forward Euler method and a second-order strong stability preserving Runge–Kutta method. We also study the Lip+-stability property numerically and give some examples of when it holds strictly and when it is violated.

scholarly journals Model Formulation Over Lie Groups and Numerical Methods to Simulate the Motion of Gyrostats and Quadrotors

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 935 ◽  
Author(s):  
Simone Fiori
Keyword(s):  
Lie Groups ◽  
Conservative System ◽  
Euler Method ◽  
Model Formulation ◽  
Dynamical Equations ◽  
System Equation ◽  
D’Alembert Principle ◽  
Rotation Groups ◽  
Forward Euler ◽  
Forward Euler Method

The present paper recalls a formulation of non-conservative system dynamics through the Lagrange–d’Alembert principle expressed through a generalized Euler–Poincaré form of the system equation on a Lie group. The paper illustrates applications of the generalized Euler–Poincaré equations on the rotation groups to a gyrostat satellite and a quadcopter drone. The numerical solution of the dynamical equations on the rotation groups is tackled via a generalized forward Euler method and an explicit Runge–Kutta integration method tailored to Lie groups.

scholarly journals Remarks on Numerical Experiments of the Allen-Cahn Equations with Constraint via Yosida Approximation

2016 ◽  
Vol 2016 ◽  
pp. 1-16
Author(s):  
Tomoyuki Suzuki ◽  
Keisuke Takasao ◽  
Noriaki Yamazaki
Keyword(s):  
Numerical Experiments ◽  
Closed Interval ◽  
Euler Method ◽  
Multivalued Function ◽  
Original Model ◽  
Yosida Approximation ◽  
One Dimensional ◽  
Cahn Equation ◽  
Forward Euler ◽  
Forward Euler Method

We consider a one-dimensional Allen-Cahn equation with constraint from the viewpoint of numerical analysis. The constraint is provided by the subdifferential of the indicator function on the closed interval, which is the multivalued function. Therefore, it is very difficult to perform a numerical experiment of our equation. In this paper we approximate the constraint by the Yosida approximation. Then, we study the approximating system of the original model numerically. In particular, we give the criteria for the standard forward Euler method to give the stable numerical experiments of the approximating equation. Moreover, we provide the numerical experiments of the approximating equation.

scholarly journals The Bifurcation of Two Invariant Closed Curves in a Discrete Model

2018 ◽  
Vol 2018 ◽  
pp. 1-12
Author(s):  
Yingying Zhang ◽  
Yicang Zhou
Keyword(s):  
Discrete Model ◽  
Bifurcation Theory ◽  
Center Manifold ◽  
Euler Method ◽  
Flip Bifurcation ◽  
Closed Curves ◽  
Dynamical Behaviors ◽  
Discrete Population ◽  
Forward Euler ◽  
Forward Euler Method

A discrete population model integrated using the forward Euler method is investigated. The qualitative bifurcation analysis indicates that the model exhibits rich dynamical behaviors including the existence of the equilibrium state, the flip bifurcation, the Neimark-Sacker bifurcation, and two invariant closed curves. The conditions for existence of these bifurcations are derived by using the center manifold and bifurcation theory. Numerical simulations and bifurcation diagrams exhibit the complex dynamical behaviors, especially the occurrence of two invariant closed curves.

scholarly journals A fast Total Variation-based iterative algorithm for digital breast tomosynthesis image reconstruction

2016 ◽  
Vol 10 (4) ◽  
pp. 277-289 ◽  
Author(s):  
E Loli Piccolomini ◽  
E Morotti
Keyword(s):  
Fixed Point ◽  
Linear System ◽  
Total Variation ◽  
Iterative Algorithm ◽  
Digital Breast Tomosynthesis ◽  
Coefficient Matrix ◽  
Total Variation Regularization ◽  
Breast Tomosynthesis ◽  
System Solution ◽  
First Order Method

In this work, we propose a fast iterative algorithm for the reconstruction of digital breast tomosynthesis images. The algorithm solves a regularization problem, expressed as the minimization of the sum of a least-squares term and a weighted smoothed version of the Total Variation regularization function. We use a Fixed Point method for the solution of the minimization problem, requiring the solution of a linear system at each iteration, whose coefficient matrix is a positive definite approximation of the Hessian of the objective function. We propose an efficient implementation of the algorithm, where the linear system is solved by a truncated Conjugate Gradient method. We compare the Fixed Point implementation with a fast first order method such as the Scaled Gradient Projection method, that does not require any linear system solution. Numerical experiments on a breast phantom widely used in tomographic simulations show that both the methods recover microcalcifications very fast while the Fixed Point is more efficient in detecting masses, when more time is available for the algorithm execution.

Sign in / Sign up

Export Citation Format

Share Document