Instruct the solver to solve using the stabilised bi-conjugate gradient (BiCGStab) solver.
Assumes that the system matrix is non-symmetric.
Used for supplying solver parameters.
The estimated relative error at the end of the solver run
The number of solver iterations
The maximum number of iterations before a restart
The relative tolerance
Instruct the solver to solve using the conjugate gradient solver.
Assumes that the system matrix is symmetric positive definite.
Used for supplying solver parameters.
The estimated relative error at the end of the solver run
The number of solver iterations
The maximum number of iterations
The relative tolerance
Solve an eigenvalue problem for matrix A, with results depending on tag.
A : Matrix tag : eigenvalue computation tag instance
Must be one of * power_iter_tag * lanczos_tag See the help for each tag class for more information.
Instruct the solver to solve using the GMRES solver.
Used for supplying solver parameters.
The estimated relative error at the end of the solver run
The number of solver iterations
The maximum dimension of the Krylov space before restart
The maximum number of iterations
The maximum number of GMRES restarts
The relative tolerance
Instruct the eigenvalue computation to use the Lanczos algorithm.
Used for supplying eigenvalue computation parameters.
The tolerance factor for reorthogonalisation batches, expressed as the exponent of epsilon.
The size of the Kylov space.
The reorthogonalisation method choice.
The number of eigenvalues to return.
Instruct the solver to solve for a lower triangular system matrix
Returns the vector norm of x, if that is defined.
The norm returned depends on the ord parameter, as in SciPy.
Computes (vec1, vec2) <- (alpha*vec1+beta*vec2, -beta*vec1+alpha*vec2)
vec1 : Vector vec2 : Vector alpha : any Python, NumPy or PyViennaCL scalar (real or integer) beta : any Python, NumPy or PyViennaCL scalar (real or integer)
None
The dtypes of the parameters must match.
Operates in-place on vec1 and vec2.
Instruct the eigenvalue computation to use the power iteration algorithm.
Used for supplying eigenvalue computation parameters.
The termination factor.
If the eigenvalue does not change more than this value, the algorithm stops.
The maximum number of iterations
Returns Mul(A, B) where that is defined (see the help for Mul), otherwise returns (A * B).
Solve the linear system expressed by A x = B for x.
Instruct the solver to solve for a unit lower triangular system matrix
Instruct the solver to solve for a unit upper triangular system matrix
Instruct the solver to solve for an upper triangular system matrix