Verifying approximate solutions to differential equations
نویسندگان
چکیده
منابع مشابه
Approximate Solution of Fuzzy Fractional Differential Equations
In this paper we propose a method for computing approximations of solution of fuzzy fractional differential equations using fuzzy variational iteration method. Defining a fuzzy fractional derivative, we verify the utility of the method through two illustrative examples.
متن کاملApproximate Solutions of Set-Valued Stochastic Differential Equations
In this paper, we consider the problem of approximate solutions of set-valued stochastic differential equations. We firstly prove an inequality of set-valued Itô integrals, which is related to classical Itô isometry, and an inequality of set-valued Lebesgue integrals. Both of the inequalities play an important role to discuss set-valued stochastic differential equations. Then we mainly state th...
متن کاملOn Approximate Solutions of Second-Order Linear Partial Differential Equations
In this paper, a Chebyshev polynomial approximation for the solution of second-order partial differential equations with two variables and variable coefficients is given. Also, Chebyshev matrix is introduced. This method is based on taking the truncated Chebyshev expansions of the functions in the partial differential equations. Hence, the result matrix equation can be solved and approximate va...
متن کاملC-approximate Solutions of Second-order Singular Ordinary Differential Equations
In this work a new method is developed to obtain C1-approximate solutions of initial and boundary-value problems generated from a one parameter second order singular ordinary differential equation. Information about the order of approximation is also given by introducing the so called growth index of a function. Conditions are given for the existence of such approximations for initial and bound...
متن کاملApproximate solutions to large Stein matrix equations
In the present paper, we propose numerical methods for solving the Stein equation AXC − X − D = 0 where the matrix A is large and sparse. Such problems appear in discrete-time control problems, filtering and image restoration. We consider the case where the matrix D is of full rank and the case where D is factored as a product of two matrices. The proposed methods are Krylov subspace methods ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2006
ISSN: 0377-0427
DOI: 10.1016/j.cam.2005.03.006