template<typename _MatrixType>
class Eigen::IterScaling< _MatrixType >
iterative scaling algorithm to equilibrate rows and column norms in matrices
This class can be used as a preprocessing tool to accelerate the convergence of iterative methods
This feature is useful to limit the pivoting amount during LU/ILU factorization The scaling strategy as presented here preserves the symmetry of the problem NOTE It is assumed that the matrix does not have empty row or column,
Example with key steps
b =
scal.LeftScaling().cwiseProduct(
b);
x =
scal.RightScaling().cwiseProduct(
x);
int n
Definition BiCGSTAB_simple.cpp:1
Scalar * b
Definition benchVecAdd.cpp:17
Matrix< SCALARA, Dynamic, Dynamic, opt_A > A
Definition bench_gemm.cpp:48
iterative scaling algorithm to equilibrate rows and column norms in matrices
Definition Scaling.h:49
void computeRef(MatrixType &mat)
Definition Scaling.h:149
The matrix class, also used for vectors and row-vectors.
Definition Matrix.h:180
A versatible sparse matrix representation.
Definition SparseMatrix.h:98
set noclip points set clip one set noclip two set bar set border lt lw set xdata set ydata set zdata set x2data set y2data set boxwidth set dummy x
Definition gnuplot_common_settings.hh:12
int EIGEN_BLAS_FUNC() scal(int *n, RealScalar *palpha, RealScalar *px, int *incx)
Definition level1_impl.h:117
- Template Parameters
-
| _MatrixType | the type of the matrix. It should be a real square sparsematrix |
References : D. Ruiz and B. Ucar, A Symmetry Preserving Algorithm for Matrix Scaling, INRIA Research report RR-7552
- See also
- IncompleteLUT