#include <AppDef_TheResol.hxx>

Public Member Functions
	AppDef_TheResol (const AppDef_MultiLine &SSP, AppParCurves_MultiCurve &SCurv, const int FirstPoint, const int LastPoint, const occ::handle< NCollection_HArray1< AppParCurves_ConstraintCouple > > &Constraints, const math_Matrix &Bern, const math_Matrix &DerivativeBern, const double Tolerance=1.0e-10)
	Given a MultiLine SSP with constraints points, this algorithm finds the best curve solution to approximate it. The poles from SCurv issued for example from the least squares are used as a guess solution for the uzawa algorithm. The tolerance used in the Uzawa algorithms is Tolerance. A is the Bernstein matrix associated to the MultiLine and DA is the derivative bernstein matrix.(They can come from an approximation with ParLeastSquare.) The MultiCurve is modified. New MultiPoles are given.
bool	IsDone () const
	returns True if all has been correctly done.
double	Error () const
	returns the maximum difference value between the curve and the given points.
const math_Matrix &	ConstraintMatrix () const
const math_Vector &	Duale () const
	returns the duale variables of the system.
const math_Matrix &	ConstraintDerivative (const AppDef_MultiLine &SSP, const math_Vector &Parameters, const int Deg, const math_Matrix &DA)
	Returns the derivative of the constraint matrix.
const math_Matrix &	InverseMatrix () const
	returns the Inverse of Cont*Transposed(Cont), where Cont is the constraint matrix for the algorithm.

Protected Member Functions
int	NbConstraints (const AppDef_MultiLine &SSP, const int FirstPoint, const int LastPoint, const occ::handle< NCollection_HArray1< AppParCurves_ConstraintCouple > > &TheConstraints) const
	is used internally to create the fields.
int	NbColumns (const AppDef_MultiLine &SSP, const int Deg) const
	is internally used for the fields creation.

Constructor & Destructor Documentation

◆ AppDef_TheResol()

AppDef_TheResol::AppDef_TheResol	(	const AppDef_MultiLine &	SSP,
		AppParCurves_MultiCurve &	SCurv,
		const int	FirstPoint,
		const int	LastPoint,
		const occ::handle< NCollection_HArray1< AppParCurves_ConstraintCouple > > &	Constraints,
		const math_Matrix &	Bern,
		const math_Matrix &	DerivativeBern,
		const double	Tolerance = 1.0e-10 )

Given a MultiLine SSP with constraints points, this algorithm finds the best curve solution to approximate it. The poles from SCurv issued for example from the least squares are used as a guess solution for the uzawa algorithm. The tolerance used in the Uzawa algorithms is Tolerance. A is the Bernstein matrix associated to the MultiLine and DA is the derivative bernstein matrix.(They can come from an approximation with ParLeastSquare.) The MultiCurve is modified. New MultiPoles are given.

Member Function Documentation

◆ ConstraintDerivative()

const math_Matrix & AppDef_TheResol::ConstraintDerivative	(	const AppDef_MultiLine &	SSP,
		const math_Vector &	Parameters,
		const int	Deg,
		const math_Matrix &	DA )

Returns the derivative of the constraint matrix.

◆ ConstraintMatrix()

const math_Matrix & AppDef_TheResol::ConstraintMatrix ( ) const

◆ Duale()

const math_Vector & AppDef_TheResol::Duale ( ) const

returns the duale variables of the system.

◆ Error()

double AppDef_TheResol::Error ( ) const

returns the maximum difference value between the curve and the given points.

◆ InverseMatrix()

const math_Matrix & AppDef_TheResol::InverseMatrix ( ) const

returns the Inverse of Cont*Transposed(Cont), where Cont is the constraint matrix for the algorithm.

◆ IsDone()

bool AppDef_TheResol::IsDone ( ) const

returns True if all has been correctly done.

◆ NbColumns()

int AppDef_TheResol::NbColumns	(	const AppDef_MultiLine &	SSP,
		const int	Deg ) const

protected

is internally used for the fields creation.

◆ NbConstraints()

int AppDef_TheResol::NbConstraints	(	const AppDef_MultiLine &	SSP,
		const int	FirstPoint,
		const int	LastPoint,
		const occ::handle< NCollection_HArray1< AppParCurves_ConstraintCouple > > &	TheConstraints ) const