public class DoubleChebyshev extends AbstractDoubleIterativeSolver
Ax = b using the Preconditioned Chebyshev Method. Chebyshev
requires an acurate estimate on the bounds of the spectrum of the matrix.| Constructor and Description |
|---|
DoubleChebyshev(DoubleMatrix1D template,
double eigmin,
double eigmax)
Constructor for Chebyshev.
|
| Modifier and Type | Method and Description |
|---|---|
void |
setEigenvalues(double eigmin,
double eigmax)
Sets the eigenvalue estimates.
|
DoubleMatrix1D |
solve(DoubleMatrix2D A,
DoubleMatrix1D b,
DoubleMatrix1D x)
Solves the given problem, writing result into the vector.
|
getIterationMonitor, getPreconditioner, setIterationMonitor, setPreconditionerpublic DoubleChebyshev(DoubleMatrix1D template, double eigmin, double eigmax)
template - Vector to use as template for the work vectors needed in the
solution processeigmin - Smallest eigenvalue. Must be positiveeigmax - Largest eigenvalue. Must be positivepublic void setEigenvalues(double eigmin,
double eigmax)
eigmin - Smallest eigenvalue. Must be positiveeigmax - Largest eigenvalue. Must be positivepublic DoubleMatrix1D solve(DoubleMatrix2D A, DoubleMatrix1D b, DoubleMatrix1D x) throws IterativeSolverDoubleNotConvergedException
DoubleIterativeSolverA - Matrix of the problemb - Right hand sidex - Solution is stored here. Also used as initial guessIterativeSolverDoubleNotConvergedExceptionJump to the Parallel Colt Homepage