Take the 2-minute tour ×
Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. It's 100% free, no registration required.

problem comes from "Numerical solution of fractional integro-differential , equations by collocation method , E.A. Rawashdeh, Department of Mathematics, Yarmouk University, Irbid 21110, Jordan"

$D^qy(t)=p(t)y(t)+f(t)+\int_{0}^{1}{K(t,s)y(s)\,ds} , t\in I=[0,1]$

I want to create a maple code to check if the results in given article is valid or not but I do not have any idea about collocation method!

any reference to collocation method solution are welcome!

share|improve this question
    
Hi @hannnndy, and welcome to SciComp! Can you post the citation for the article you're trying to validate in your question? –  Paul Sep 15 '12 at 15:58
    
Hi @Paul, and thanks! it's Applied Mathematics and Computation 176 (2006) 1–6 by E.A. Rawashdeh - Department of Mathematics, Yarmouk University, Irbid 21110, Jordan - Ó 2005 Elsevier Inc. All rights reserved. –  Mohammad Rafiee Sep 16 '12 at 4:28
add comment

2 Answers 2

up vote 2 down vote accepted

As I understand it, collocation method for partial differential equations is something akin to interpolation. First we characterize the solution space as a linear combination of some set of linearly independent functions $\phi_i(x)$. The appropriate choice of $\phi_i(x)$ depends on the problem. But assuming that the anticipated solution is sufficiently smooth, the simplest and easiest case to consider is the space of polynomials on $x$. Thus, the solution is of the form $u(x) = \sum \alpha_i \phi_i(x)$ where each $\phi_i(x)$ is a different (linearly independent) polynomial function.

The goal is to determine which coefficients $\alpha_i$ make the best approximation. We do so by substituting the linear combination directly into the partial differential equation. Once you do this, you obtain expressions in terms of the functions $\phi_i(x)$ (lets call this expression EQ1). Now, you need to force this expression to be exact at a finite number of points x. So, we pick a set of points $\{x_i\}$ and evaluate EQ1 at these points. This results in a linear system of equations whose unknowns are the $\alpha_i$'s.

To put the process into context, let's consider the 1 dimensional boundary value problem:

$U_{xx} = f$ on $\Omega = (0,1)$
$u=0$ on $\partial \Omega$

Suppose I expect the solution to be smooth enough that it can be characterized by polynomials. I can choose $\phi_i=x^i$. Then my linear combination would be $u(x)=\sum \alpha_i x^i$ for $i=0,...,n$. I can substitute this linear combination directly into the pde and obtain:

$$U_{xx} = f$$ $$\frac{\partial^2}{\partial x^2}[\sum_{i=1}^n \alpha_i \phi_i(x)]=f(x)$$ $$\sum_{i=0}^n \alpha_i \phi_i''(x)=f(x)$$ (lets call this last equation EQ1).

Now, we need to choose points in our domain $\Omega = (0,1)$ to force EQ1 to be true. Since there are n+1 coefficients ($\alpha_i$), we need to choose n+1 points. While theoretically we can choose any points in the domain, certain choices of points produce better accuracy than others. In my experience on smooth problems, the points are chosen as the n+1 gaussian quadrature points on (0,1). Keep in mind that this is probably not the optimal choice for all problems and that each specific problem may have a better choice of points. Once we know the points $x_k$, we evaluate EQ1 at each point $x_k$ and obtain:

$$\sum_{i=1}^n \alpha_i \phi_i''(x_k)=f(x_k)$$ for $k=0,...,n$

Thus, we have a system of equations for the unknowns $\alpha_i$, which we can solve by whatever method we see fit. Once we know the exact values of the $\alpha_i$'s, the final solution, again, is just their linear combination:

$u(x) = \sum_{i=0}^n\alpha_i \phi_i(x)$

Unfortunately I can't access the journal where your article is, so I can't say with certainty that this is how it works for an integro-differential equation. But this is the general framework of the collocation method.

Update

After considering the comments, I realized there are 2 other important conditions on the choice of functions $\phi_i(x)$:

  1. They must all satisfy the boundary conditions.
  2. Ideally, they should have small support.

My initial choice of basis functions $\phi_i(x)=x^i$ do not all satisfy the boundary condition at $u(1)=0$. Furthermore, polynomial functions are non-zero over a large region, leading to a dense matrix system which can be costly to solve. Often, cubic hermite functions are used in place of the usual polynomial functions because:

  1. They can naturally be adjusted to satisfy the boundary conditions.
  2. They lead to sparse linear systems of equations
share|improve this answer
    
You forgot the $y(1)=0$ b. c. which is not automatically satisfied by your choice of $\phi_i$. –  Stefano M Sep 16 '12 at 13:34
    
You're right! My mistake. I guess the polynomials basis can be adjusted to satsify the boundary conditions –  Paul Sep 16 '12 at 14:30
    
@Paul wow dude! there is a problem, it becomes more complicatd to me, but first of all how can I calculate $a_i$? –  Mohammad Rafiee Sep 16 '12 at 18:12
    
@hannnndy: Do you understand how to setup the system of linear equations? –  Paul Sep 16 '12 at 22:15
add comment

If you want to experiment and play with collocation method - I can suggest you to try my own code bernstein-poly.

It is an implementation of a collocation method using Bernstein polynomials. These are pretty interesting. I'm still working on a paper - haven't published anything yet, except at my blog.

For now it is intended for two-point BVP's.

You are also welcome to send some suggestions for improvement.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.