|
| | TangentiallyDiscontinuousConformalPMLMapping () |
| | Default constructor (empty) More...
|
| |
| virtual void | pole_line_search (const Vector< double > &x_inner, const Vector< double > &p, const double &k, double &nun, std::complex< double > &tnu, const double &alpha=0.0)=0 |
| | Search along the line 0 to nun for pole (or closest point to) More...
|
| |
| virtual bool | newton_step_to_pole (const Vector< double > &x_inner, const Vector< double > &p, const Vector< double > &dx_inner_dacross, const Vector< double > &dp_dacross, double &nu, double &zeta, std::complex< double > &tnu, std::complex< double > &alpha, std::complex< double > &beta)=0 |
| | Make a Newton step towards a pole (pole is when du/dtnu=0s) More...
|
| |
| virtual void | set_initial_guess (const Vector< double > &x_inner, const Vector< double > &p, const double &nun, const std::complex< double > &tnu)=0 |
| |
| | TangentiallyVaryingConformalPMLMapping () |
| | Default constructor (empty) More...
|
| |
| virtual void | get_mapping_jacobian (const Vector< double > &x, const Vector< double > &x_inner, const Vector< double > &x_outer, const Vector< double > &dx_inner_dacross, const Vector< double > &dp_dacross, const double &k, std::complex< double > &tnu, std::complex< double > &dtnu_dnu, std::complex< double > &dtnu_dacross, const double &alpha=0.0)=0 |
| | Pure virtual to return PML mapping Jacobian. More...
|
| |
Class to hold the mapping function (gamma) for the PML which defines how the coordinates are transformed in the PML. This PML mapping aims to transform the solution into a straight line, and requires a lot of information from the element. Returns a mapping Jacobian which I haven't quite worked out yet
Definition at line 217 of file pml_mapping_functions.h.