asg2.tar.gz
) including:
README
file containing assignment and solution
descriptions, e.g., program design, description of algorithm,
etc., if appropriate.
INSTALL
file containing any specific compliation
quirks peculiar to your program, e.g.,
make -f Makefile.xirtam
.
USAGE
file containing any specific usage quirks
peculiar to your program, e.g.,
./xirtam < points.in
where
./xirtam
is the executable and
points.in
is the input.
src/
directory with source code.
At this point you don't need to worry about the
unary and binary operators (including
(const matrix&, const matrix&)
,
(const matrix&, scalar)
,
(const scalar&, const matrix&)
)
and the clamp()
member function.
(Howerver, you'll probably need all of these sooner or
later so if you have time, you might as well implement
as many of them as you can now -- for matrix inversion,
implemented by operator!
, use the
ludcmp(int *indx,T *d)
and
lubksb(int *indx,T *b)
routines from
Numerical Recipes
but take care to notice that NR usually used C-style
arrays indexed at 1, not at 0!).
You are free to rewrite the class interface and declare your own matrix class, so long as it satisfies the required funcionality requirements.
Note that you have to fill in some code here!