PROJECTS FOR ADVANCED

NUMERICAL COMPUTING - CS 543

Michael J. Johnson
Spring 2008

Abstract. These are the projects for Advanced Numerical Computing

– CS 543 taught at Kuwait University Spring Semester 2008.

Typeset by AMS-TEX
1
2 CS 543

1. Adem’s Project

Consider the linear differential-convolution equation

−y 00 (x) + y(x) + λ(y(x) − (µ ∗ y)(x)) = g(x), x ∈ R,

where µ(x) = e−2|x| , g is a given function which we’ll assume is continuous

and compactly supported, and λ ≥ 0 is a constant. Although this equation
probably has infinitely many solutions, we have good reasons to believe that
it has a unique bounded solution, and the goal of this project is to use the
methods taught in this course to approximate this unique bounded solution.
It is suggested that the project follows the outline below:

(a) Solve the equation in the Fourier transform domain (ie find a formula
for yb(w)).
(b) Prove that yb is integrable and conclude that y is continuous and bounded.

(c) Write an octave program which approximates the bounded solution y in

the special case when g(x) = ψ5 (σx). Here ψ5 denotes the centered cardinal
B-spline of degree 5 and σ is an adjustable parameter.
(d) Use the solution in part (c) to solve the general problem assuming g is
available as an octave function g.m
 CS 543 3

2. Maha’s Project

Consider the linear differential-convolution equation

−y 00 (x) + y(x) + λ(y(x) − (µ ∗ y)(x)) = g(x), x ∈ R,

where µ(x) = e−2|x| , g is a given function which we’ll assume is continuous

and compactly supported, and λ ≥ 0 is a constant. Although this equation
probably has infinitely many solutions, we have good reasons to believe that
it has a unique bounded solution, and the goal of this project is to use the
methods taught in this course to approximate this unique bounded solution.
Let L be the differential operator Ly = −y 00 + y. Writing our equation in
the form Ly = g − λ(y − µ ∗ y) suggests the fixed point iteration

y0 = 0
yn+1 is the unique bounded solution of Lyn+1 = g − λ(yn − µ ∗ yn )

It is suggested that the project follows the outline below:

(a) Find the Green’s function G ∈ C(R) for the differential operator Ly =
−y 00 + y. (This function G serves as the inverse of L in the sense that the
unique bounded solution of Ly = f is y = G ∗ f for all f ∈ Cc (R).)
(b) Write an octave program which implements the fixed point interation:

yn+1 = G ∗ (g − λ(yn − µ ∗ yn ))

(c) Devise a test case to assess how well the iteration approximates the
exact solution.
4 CS 543

3. Amal’s Mini Project

Write an octave function Bspline.m which works properly even when Ξ

has multiple knots. For example,
Xi=[-2 -1 -1 0 0 1 1 2]
[X,S]=Bspline(Xi)
should return the B-spline of degree 6 with simple knots at −2 and 2 and
double knots at −1, 0, 1. The returned vector X should be X=[-2 -1 0 1
2] and the matrix of coefficients S should have 4 rows (since this B-spline
only has four pieces) and 7 columns.
Suggestion If Ξ is a knot sequence with only one distinct knot, for
example Xi=[1 1 1], then the corresponding B-spline should be 0. This
leads to the question, “What is the pp representation of 0?” One possible
answer is the following:
[X,S] represents 0 if X has length 1 and S is the empty matrix.
If you agree with that, then the command
[X,S]=Bspline([1 1 1])
would produce X=[1] and S=[].