Feedback Stabilization Methods for the Numerical Solution of Systems of Ordinary Differential Equations

In this work we study the problem of step size selection for numerical schemes, which guarantees that the numerical solution presents the same qualitative behavior as the original system of ordinary differential equations, by means of tools from nonlinear control theory. Lyapunov-based and Small-Gain feedback stabilization methods are exploited and numerous illustrating applications are presented for systems with a globally asymptotically stable equilibrium point. The obtained results can be used for the control of the global discretization error as well.Comment: 33 pages, 9 figures. Submitted for possible publication to BIT Numerical Mathematic

Exponentially fitted fifth-order two-step peer explicit methods

The so called peer methods for the numerical solution of Initial Value Problems (IVP) in ordinary differential systems were introduced by R. Weiner et al [6, 7, 11, 12, 13] for solving different types of problems either in sequential or parallel computers. In this work, we study exponentially fitted three-stage peer schemes that are able to fit functional spaces with dimension six. Finally, some numerical experiments are presented to show the behaviour of the new peer schemes for some periodic problems

Convergence Acceleration Techniques

This work describes numerical methods that are useful in many areas: examples include statistical modelling (bioinformatics, computational biology), theoretical physics, and even pure mathematics. The methods are primarily useful for the acceleration of slowly convergent and the summation of divergent series that are ubiquitous in relevant applications. The computing time is reduced in many cases by orders of magnitude.Comment: 6 pages, LaTeX; provides an easy-to-understand introduction to the field of convergence acceleratio

On the convergence of Lawson methods for semilinear stiff problems

Since their introduction in 1967, Lawson methods have achieved constant interest in the time discretization of evolution equations. The methods were originally devised for the numerical solution of stiff differential equations. Meanwhile, they constitute a well-established class of exponential integrators. The popularity of Lawson methods is in some contrast to the fact that they may have a bad convergence behaviour, since they do not satisfy any of the stiff order conditions. The aim of this paper is to explain this discrepancy. It is shown that non-stiff order conditions together with appropriate regularity assumptions imply high-order convergence of Lawson methods. Note, however, that the term regularity here includes the behaviour of the solution at the boundary. For instance, Lawson methods will behave well in the case of periodic boundary conditions, but they will show a dramatic order reduction for, e.g., Dirichlet boundary conditions. The precise regularity assumptions required for high-order convergence are worked out in this paper and related to the corresponding assumptions for splitting schemes. In contrast to previous work, the analysis is based on expansions of the exact and the numerical solution along the flow of the homogeneous problem. Numerical examples for the Schr\"odinger equation are included

A Note on the DQ Analysis of Anisotropic Plates

Recently, Bert, Wang and Striz [1, 2] applied the differential quadrature (DQ) and harmonic differential quadrature (HDQ) methods to analyze static and dynamic behaviors of anisotropic plates. Their studies showed that the methods were conceptually simple and computationally efficient in comparison to other numerical techniques. Based on some recent work by the present author [3, 4], the purpose of this note is to further simplify the formulation effort and improve computing efficiency in applying the DQ and HDQ methods for these cases