#include <AppDef_ResConstraintOfMyGradientOfCompute.hxx>
|
| AppDef_ResConstraintOfMyGradientOfCompute (const AppDef_MultiLine &SSP, AppParCurves_MultiCurve &SCurv, const Standard_Integer FirstPoint, const Standard_Integer LastPoint, const Handle< AppParCurves_HArray1OfConstraintCouple > &Constraints, const math_Matrix &Bern, const math_Matrix &DerivativeBern, const Standard_Real 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.
|
|
Standard_Boolean | IsDone () const |
| returns True if all has been correctly done.
|
|
Standard_Real | 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 Standard_Integer 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.
|
|
◆ AppDef_ResConstraintOfMyGradientOfCompute()
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.
◆ ConstraintDerivative()
Returns the derivative of the constraint matrix.
◆ ConstraintMatrix()
const math_Matrix & AppDef_ResConstraintOfMyGradientOfCompute::ConstraintMatrix |
( |
| ) |
const |
◆ Duale()
const math_Vector & AppDef_ResConstraintOfMyGradientOfCompute::Duale |
( |
| ) |
const |
returns the duale variables of the system.
◆ Error()
Standard_Real AppDef_ResConstraintOfMyGradientOfCompute::Error |
( |
| ) |
const |
returns the maximum difference value between the curve and the given points.
◆ InverseMatrix()
const math_Matrix & AppDef_ResConstraintOfMyGradientOfCompute::InverseMatrix |
( |
| ) |
const |
returns the Inverse of Cont*Transposed(Cont), where Cont is the constraint matrix for the algorithm.
◆ IsDone()
returns True if all has been correctly done.
◆ NbColumns()
is internally used for the fields creation.
◆ NbConstraints()
is used internally to create the fields.
The documentation for this class was generated from the following file: