Sine‐cosine wavelet method for fractional oscillator equations

Purpose In this article, a novel computational method is introduced for solving the fractional nonlinear oscillator differential equations on the semi‐infinite domain. The purpose of the proposed method is to get better and more accurate results. Design/methodology/approach The proposed method is the combination of the sine‐cosine wavelets and Picard technique. The operational matrices of fractional‐order integration for sine‐cosine wavelets are derived and constructed. Picard technique is used to convert the fractional nonlinear oscillator equations into a sequence of discrete fractional linear differential equations. Operational matrices of sine‐cosine wavelets are utilized to transformed the obtained sequence of discrete equations into the systems of algebraic equations and the solutions of algebraic systems lead to the solution of fractional nonlinear oscillator equations. Findings The convergence and supporting analysis of the method are investigated. The operational matrices contains many zero entries, which lead to the high efficiency of the method, and reasonable accuracy is achieved even with less number of collocation points. Our results are in good agreement with exact solutions and more accurate as compared with homotopy perturbation method, variational iteration method, and Adomian decomposition method. Originality/value Many engineers can utilize the presented method for solving their nonlinear fractional models.     

New applications of Picard?s successive approximations

The iterative method of successive approximations, originally introduced by Émile Picard in 1890, is a basic tool for proving the existence of solutions of initial value problems regarding ordinary first order differential equations. In the present paper, it is shown that this method can be modified to get estimates for the growth of solutions of linear differential equations of the typef(k)+Ak−1(z)f(k−1)+?+A₁(z)f^′+A₀(z)f=0 with analytic coefficients. A short comparison to the growth results in the literature, obtained by means of different methods, is also given. It turns out that many known results can be proved by applying Picard?s successive approximations in an effective way. Self-contained considerations are carried out in the complex plane and in the unit disc, and some remarks about solutions of real linear differential equations are made.     

An approach to solutions of coupled semilinear partial differential equations with applications

In this work, an approach for finding the solution of coupled semi‐linear diffusion equations for initial value problems is presented. The formal exact solution is found and the Picard iteration is constructed. It is shown that the constructed sequence of solutions converges uniformly for some classes of initial value problems. The problem of dispersion of an oxygen demanding pollutant released into a uniform flow is studied. Copyright © 2000 John Wiley & Sons, Ltd.     

Identification of Linear Error-Models with Projected Dynamical Systems

Linear error models are an integral part of several parameter identification methods for feedforward and feedback control systems and lead in connection with the L ₂-norm to a convex distance measure which has to be minimised for identification purposes. The parameters are hereby often subject to specific restrictions whose intersections span a convex solution set with non-differentiability points on its boundary. For solving these well conditioned problems on-line the paper formulates the solution of the bounded convex minimisation problem as a stable equilibrium set of a proper system of differential equations. The vector field of the corresponding system of differential equations is based on a projection of the negative gradient of the distance measure. A general drawback of this approach is the discontinuous right-hand side of the differential equation caused by the projection transformation. The consequence are difficulties for the verification of the existence, uniqueness and stability of a solution trajectory. Therefore the first subject of this paper is the derivation of an alternative formulation of the projected dynamical system, which exhibits, in contrast to the original formulation, a continuous right-hand side and is thus accessible to conventional analysis methods. For this purpose the multi-dimensional stop operator is used and the existence, uniqueness and stability properties of the solution trajectories are established. The second part of this paper deals with the numerical integration of the projected dynamical system which is used for an implementation of the identification method on a digital signal processor for example. To demonstrate the performance the application of this on-line identification method to the hysteretic filter synthesis with the modified Prandtl-Ishlinskii approach is presented in the last part of this paper.     

A new Riccati equation arising in the theory of classical orthogonal polynomials

In seeking a generalized Rodrigues' formula solution to second-order linear ordinary differential equations a new Riccati equation is encountered and solved, leading to a novel development of the theory of orthogonal polynomials. Additional benefits of this approach are the automatic attainment of second solutions, the solution of the inhomogeneous form, and a means of determining the eigenvalues of fundamental classes of second-order linear differential equations. The results of this analysis will be of interest to a broad spectrum of readers and should be of pedagogic as well as theoretical value.     

A comparison of the iterative method and Picard's successive approximations for deterministic and stochastic differential equations

A comparison of Adomian's iterative method for stochastic differential equations and the Picard method of successive approximations shows interesting differences for both deterministic and stochastic differential equations. The iterative procedure is more efficient and computationally useful even in the deterministic case. In the stochastic case, the Picard method has no value, while the iterative procedure is useful and simple.     

Fractional differential equations with a Caputo derivative with respect to a Kernel function and their applications

This paper is devoted to the study of the initial value problem of nonlinear fractional differential equations involving a Caputo‐type fractional derivative with respect to another function. Existence and uniqueness results for the problem are established by means of the some standard fixed point theorems. Next, we develop the Picard iteration method for solving numerically the problem and obtain results on the long‐term behavior of solutions. Finally, we analyze a population growth model and a gross domestic product model with governing equations being fractional differential equations that we have introduced in this work.     

Efficient higher order implicit one-step methods for integration of stiff differential equations

A new implicit integration method is presented which can efficiently be applied in the solution of (stiff) differential equations. The given formulas are of a modified implicit Runge-Kutta type and areA-stable. They may containA-stable embedded methods for error estimation and step-size control.     

常微分方程解的存在唯一性定理教学研究

探讨了常微分方程初值问题解的存在唯一性定理教学策略.为便于教学和有利于学生理解并掌握其思想方法,对定理证明过程的表述作了命题化处理,给出了Picard逐步逼近法的应用实例,提出了教学讨论与知识拓展的一些有益内容.     

中立型无限时滞带跳随机泛函微分方程解的存在唯一性

本文首先在Lipschiz条件和线性增长条件下,通过Picard迭代法研究了带跳的无限时滞中立型随机微分方程解的存在唯一性,接着对这这类方程的Picard迭代解与精确解的误差进行估计,最后讨论了解的矩估计。     

An efficient nonlinear iteration scheme for nonlinear parabolic–hyperbolic system

A nonlinear iteration method named the Picard–Newton iteration is studied for a two-dimensional nonlinear coupled parabolic–hyperbolic system. It serves as an efficient method to solve a nonlinear discrete scheme with second spatial and temporal accuracy. The nonlinear iteration scheme is constructed with a linearization–discretization approach through discretizing the linearized systems of the original nonlinear partial differential equations. It can be viewed as an improved Picard iteration, and can accelerate convergence over the standard Picard iteration. Moreover, the discretization with second-order accuracy in both spatial and temporal variants is introduced to get the Picard–Newton iteration scheme. By using the energy estimate and inductive hypothesis reasoning, the difficulties arising from the nonlinearity and the coupling of different equation types are overcome. It follows that the rigorous theoretical analysis on the approximation of the solution of the Picard–Newton iteration scheme to the solution of the original continuous problem is obtained, which is different from the traditional error estimate that usually estimates the error between the solution of the nonlinear discrete scheme and the solution of the original problem. Moreover, such approximation is independent of the iteration number. Numerical experiments verify the theoretical result, and show that the Picard–Newton iteration scheme with second-order spatial and temporal accuracy is more accurate and efficient than that of first-order temporal accuracy.     

Improved pedagogy for linear differential equations by reconsidering how we measure the size of solutions

For over 50 years, the learning of teaching of a priori bounds on solutions to linear differential equations has involved a Euclidean approach to measuring the size of a solution. While the Euclidean approach to a priori bounds on solutions is somewhat manageable in the learning and teaching of the proofs involving second-order, linear problems with constant co-efficients, we believe it is not pedagogically optimal. Moreover, the Euclidean method becomes pedagogically unwieldy in the proofs involving higher-order cases. The purpose of this work is to propose a simpler pedagogical approach to establish a priori bounds on solutions by considering a different way of measuring the size of a solution to linear problems, which we refer to as the Uber size. The Uber form enables a simplification of pedagogy from the literature and the ideas are accessible to learners who have an understanding of the Fundamental Theorem of Calculus and the exponential function, both usually seen in a first course in calculus. We believe that this work will be of mathematical and pedagogical interest to those who are learning and teaching in the area of differential equations or in any of the numerous disciplines where linear differential equations are used.     

A Method for Global Approximation of the Initial Value Problem

For the numerical solution of the initial value problem a parallel, global integration method is derived and studied. It is a collocation method. If f(x,y)f(x) the method coincides with the Filippi's modified Clenshaw–Curtis quadrature [11]. Two numerical algorithms are considered and implemented, one of which is the application of the new method to Picard iterations, so it is a waveform relaxation technique [3]. Numerical experiments are favourably compared with the ones given by the known GAM [2], GBS [14] and Sarafyan [18] methods.     

A note on the polynomial solution of a class of dual integral equations arising in mixed boundary value problems of elasticity

Summary The present paper is concerned with finding an effective polynomial solution to a class of dual integral equations which arise in many mixed boundary value problems in the theory of elasticity. The dual integral equations are first transformed into a Fredholm integration equation of the second kind via an auxiliary function, which is next reduced to an infinite system of linear algebraic equations by representing the unknown auxiliary function in the form of an infinite series of Jacobi polynomials. The approximate solution of this infinite system of equations can be obtained by a suitable truncation. It is shown that the unknown function involving the dual integral equations can also be expressed in the form of an infinite series of Jacobi polynomials with the same expansion coefficients with no numerical integration involved. The main advantage of the present approach is that the solution of the dual integral equations thus obtained is numerically more stable than that obtained by reducing themdirectly into an infinite system of equations, insofar as the expansion coefficients are determined essentially by solving asecond kind integral equation.     

Some remarks on Nagumo’s theorem

We provide a simpler proof for a recent generalization of Nagumo’s uniqueness theorem by A. Constantin: On Nagumo’s theorem. Proc. Japan Acad., Ser. A 86 (2010), 41–44, for the differential equation x′ = f(t, x), x(0) = 0 and we show that not only is the solution unique but the Picard successive approximations converge to the unique solution. The proof is based on an approach that was developed in Z. S. Athanassov: Uniqueness and convergence of successive approximations for ordinary differential equations. Math. Jap. 35 (1990), 351–367. Some classical existence and uniqueness results for initial-value problems for ordinary differential equations are particular cases of our result.     

A direct variable step block multistep method for solving general third-order ODEs

This paper discusses a direct three-point implicit block multistep method for direct solution of the general third-order initial value problems of ordinary differential equations using variable step size. The method is based on a pair of explicit and implicit of Adams type formulas which are implemented in PE(CE) ^t mode and in order to avoid calculating divided difference and integration coefficients all the coefficients are stored in the code. The method approximates the numerical solution at three equally spaced points simultaneously. The Gauss Seidel approach is used for the implementation of the proposed method. The local truncation error of the proposed scheme is studied. Numerical examples are given to illustrate the efficiency of the method.     

非Lipschitz系数下随机泛函微分方程适度解的存在唯一性及其渐近性态(英文)

本文主要运用Picard迭代和算子分数次幂方法,讨论了随机时滞偏微分方程适度解的存在性与唯一性,并对解的渐近性态进行了研究.这里方程的系数不满足Lipschitz条件,时滞r>0为有限的.最后给出了一个非Lipschitz条件的例子.     

Basic existence, uniqueness and approximation results for positive solutions to nonlinear dynamic equations on time scales

This paper focuses on the qualitative and quantitative properties of solutions to certain nonlinear dynamic equations on time scales. We present some new sufficient conditions under which these general equations admit a unique, positive solution. These positive (and hence non-oscillatory) solutions: extend across unbounded intervals; and tend to a finite limit as the independent variable becomes large and positive. Our methods include: Banach’s fixed-point theorem, including the method of Picard iterations; and weighted norms and metrics in the time scale setting. Due to the wide-ranging nature of dynamic equations on time scales our results are novel: for ordinary differential equations; for difference equations; for combinations of the two areas; and for general time scales — this is demonstrated via some examples. Furthermore, we state an open problem of interest.