Parallel Colt 0.7.2

Uses of Interface
cern.colt.matrix.tdouble.algo.solver.DoubleIterativeSolver

Packages that use DoubleIterativeSolver
cern.colt.matrix.tdouble.algo.solver Iterative solvers BiCG - BiConjugate gradients. BiCGstab - BiConjugate gradients stabilized. CG - Conjugate gradients. CGS - Conjugate gradients squared. Chebyshev - The Chebyshev iteration for symmetrical, positive definite matrices. GMRES - Generalized minimal residual using restart. IR - Iterative refinement (Richardson's method). QMR - Quasi-minimal residual. HyBR - Hybrid Bidiagonalization Regularization.  
 

Uses of DoubleIterativeSolver in cern.colt.matrix.tdouble.algo.solver
 

Classes in cern.colt.matrix.tdouble.algo.solver that implement DoubleIterativeSolver
 class AbstractDoubleIterativeSolver
          Partial implementation of an iterative solver
 class DoubleBiCG
          BiCG solver.
 class DoubleBiCGstab
          BiCG stablized solver.
 class DoubleCG
          Conjugate Gradients solver.
 class DoubleCGLS
          CGLS is Conjugate Gradient for Least Squares method used for solving large-scale, ill-posed inverse problems of the form: b = A*x + noise.
 class DoubleCGS
          Conjugate Gradients squared solver.
 class DoubleChebyshev
          Chebyshev solver.
 class DoubleGMRES
          GMRES solver.
 class DoubleHyBR
          HyBR is a Hybrid Bidiagonalization Regularization method used for solving large-scale, ill-posed inverse problems of the form: b = A*x + noise The method combines an iterative Lanczos Bidiagonalization (LBD) Method with an SVD-based regularization method to stabilize the semiconvergence behavior that is characteristic of many ill-posed problems.
 class DoubleIR
          Iterative Refinement.
 class DoubleMRNSD
          MRNSD is Modified Residual Norm Steepest Descent method used for solving large-scale, ill-posed inverse problems of the form: b = A*x + noise.
 class DoubleQMR
          Quasi-Minimal Residual method.
 


Parallel Colt 0.7.2

Jump to the Parallel Colt Homepage