general class for contact search with respect to one contour-parameter
More...
#include <functions_contact.h>
List of all members.
Public Member Functions |
| | Contact1sSearch (DistanceFunction< double(double)> *func_) |
| | constructor
|
| | Contact1sSearch (DistanceFunction< double(double)> *func_, fmatvec::Function< double(double)> *jac_) |
| | constructor
|
|
void | setInitialValue (const double &s0_) |
|
void | setNodes (const fmatvec::Vec &nodes_) |
|
void | setSearchAll (bool searchAll_) |
| void | setEqualSpacing (const int &n, const double &x0, const double &dx) |
| | set equally distanced nodes
|
| double | slv () |
| | solve for the one potential contact point with minimal distance (might be negative)
|
| fmatvec::Mat | slvAll () |
| | solve for all potential contact points
|
Private Attributes |
|
DistanceFunction< double(double)> * | func |
| | distance-function holding all information for contact-search
|
|
fmatvec::Function< double(double)> * | jac |
| | Jacobian of root function part of distance function.
|
|
double | s0 |
| | initial value for Newton method
|
|
fmatvec::Vec | nodes |
| | nodes defining search-areas for Regula-Falsi
|
|
bool | searchAll |
| | all area searching by Regular-Falsi or known initial value for Newton-Method?
|
Detailed Description
general class for contact search with respect to one contour-parameter
- Author:
- Roland Zander
- Date:
- 2009-07-10 some comments (Thorsten Schindler)
-
2010-03-07 added slvAll for finding "all" roots (Roland Zander)
General remarks:
- both operators () and [] are necessary to calculate the root-function "()" and the distance of possible contact points "[]"
- then it is possible to compare different root-values during e.g. regula falsi
Constructor & Destructor Documentation
constructor
- Parameters:
-
| root | function numerical Jacobian evaluation only local search |
constructor
- Parameters:
-
| root | function |
| Jacobian | evaluation only local search |
Member Function Documentation
set equally distanced nodes
- Parameters:
-
| number | of search areas |
| beginning | parameter |
| width | |
solve for the one potential contact point with minimal distance (might be negative)
- Returns:
- point with minimal distance at contour-parameter
solve for all potential contact points
- Returns:
- matrix holding LagrangeParameterPosition in col(0) and respective distances in col(1)
The documentation for this class was generated from the following file: