|
Self defined
case |
Please define the dimension of your matrix:
n=
important: 3 <= n <= 1024 !
how many eigenvalues should be found?
p=
important: 1 <= p <= 30
choose epsaccept for the termination criterion
epsaccept =
important: 1.0e-16 <= epsaccept <= 1.0e-2
how many steps may be performed at most?
steps = 1 <= steps <= 10000
Set the initial guess X0 here : p*n entries.
(This must not be orthogonal.) Each column must begin at a new line, but may extend over several
lines, entries separated by blank or comma.
If you do not want to use this, write "xxx" here. Then we generate some
X0 randomly and orthogonalize it subsequently.
Write here the piece of code which performs y=A*x.
The result must be named y, the input must be named x, the dimension must be named n .
You may use: a matrix a, whose entries must be set then, a vector zeisum with n
components, the integer variables i,j,k for indices or loops,
the logicals bool1, bool2, bool3, constants pi, e=exp(1), sqrt2=sqrt(2.0).
you cannot define variable names yourself.
|