refine.h File Reference

Generic algorithm for solving with backwards refinement, implemented in terms of Action's. More...

#include <myramath/utility/Number.h>
#include <myramath/MYRAMATH_EXPORT.h>
#include <vector>

Include dependency graph for refine.h:

Go to the source code of this file.

Classes
class	myra::Action< Number >
	Applies the "Action" of a linear operator, b := A*x. More...
class	myra::MatrixRange< Number >
	Represents a mutable MatrixRange. More...
class	myra::VectorRange< Number >
	Represents a mutable VectorRange. More...

Functions
std::vector< float >	myra::refine (const Action< NumberS > &A, const Action< NumberS > &M, const MatrixRange< NumberS > &B, float tolerance=1.0e-5, int iterations=20)
	Given the action of A and A's inverse (denoted M), solves A*X = B with backwards refinement.
std::vector< double >	myra::refine (const Action< NumberD > &A, const Action< NumberD > &inv_A, const MatrixRange< NumberD > &B, double tolerance, int iterations)
std::vector< float >	myra::refine (const Action< NumberC > &A, const Action< NumberC > &inv_A, const MatrixRange< NumberC > &B, float tolerance, int iterations)
std::vector< double >	myra::refine (const Action< NumberZ > &A, const Action< NumberZ > &inv_A, const MatrixRange< NumberZ > &B, double tolerance, int iterations)
std::vector< float >	myra::refine (const Action< NumberS > &A, const Action< NumberS > &M, const VectorRange< NumberS > &b, float tolerance=1.0e-5, int iterations=20)
	Given the action of A and A's inverse, solves A*x = b with backwards refinement.
std::vector< double >	myra::refine (const Action< NumberD > &A, const Action< NumberD > &inv_A, const VectorRange< NumberD > &b, double tolerance, int iterations)
std::vector< float >	myra::refine (const Action< NumberC > &A, const Action< NumberC > &inv_A, const VectorRange< NumberC > &b, float tolerance, int iterations)
std::vector< double >	myra::refine (const Action< NumberZ > &A, const Action< NumberZ > &inv_A, const VectorRange< NumberZ > &b, double tolerance, int iterations)

Detailed Description

Generic algorithm for solving with backwards refinement, implemented in terms of Action's.