#include <Laguerre.h>
|
| | Original () |
| |
| void | operator() (std::vector< T > &poly, std::vector< std::complex< T > > &roots, std::vector< int > &conv, int itmax=80) override |
| | Find the roots of a polynomial using Laguerre's method.
|
| |
|
| void | laguer (const std::vector< std::complex< T > > &a, std::complex< T > &x, int &converged, int itmax) |
| | Laguerre's method to find a root of a polynomial.
|
| |
|
| static constexpr T | eps = std::numeric_limits<T>::epsilon() |
| |
◆ Original()
◆ laguer()
template<typename T >
| void Laguerre::Original< T >::laguer |
( |
const std::vector< std::complex< T > > & | a, |
|
|
std::complex< T > & | x, |
|
|
int & | converged, |
|
|
int | itmax ) |
|
inlineprivate |
Laguerre's method to find a root of a polynomial.
- Parameters
-
◆ operator()()
template<typename T >
| void Laguerre::Original< T >::operator() |
( |
std::vector< T > & | poly, |
|
|
std::vector< std::complex< T > > & | roots, |
|
|
std::vector< int > & | conv, |
|
|
int | itmax = 80 ) |
|
inlineoverridevirtual |
Find the roots of a polynomial using Laguerre's method.
- Parameters
-
| poly | Polynomial object. |
| roots | Vector to store the roots. |
| conv | Vector to store convergence status of each root. |
| itmax | Maximum number of iterations. |
Implements BaseSolver< T >.
◆ eps
The documentation for this class was generated from the following file: