%  Demo I 
%  ======

% Set the following input parameters 

clear; 
path(path,'/home/bai/ABLEpack/SRC') 
path(path,'/home/bai/ABLEpack/APPLS') 

% parameters for the test  problem
%A = randn(100); 
load t4000;   % test matrix from Lou, and claim the breakdown 
B = 0; 
problem = 1; 
precond = 0; 
testprob = 1;
testmatname = 'sparse random matrix';
alpha = 0; 
%eig_ext = 1; 
%aeig = eig(A); 
eig_ext = 0; 
aeig = 0;
maxeig = 2;   % number of required eigenvalues

% input parameters for algorithm. 
nb = 2;       % initial blocksize
maxit = 100;   % maximum number of Lanczos-iter, altered by maxmsz
matbal = 0;   % whether balance the test matrix (only for standard eigenproblem)
fulldual = 1; % use full-duality if fulldual = 1
semidual = 0; % maintain semi-duality if semidual = 1
group = 0;    % adapt to the order of the largest cluster if group = 1
treatbd = 1;  % cure breakdown if treatbd = 1.

pbdy
