Collaboration diagram for Algorithms for solving system of equations.:
|
Classes | |
| class | XC::BFBRoydenBase |
| Base class for Broyden's method solution algorithms. More... | |
| class | XC::BFGS |
| Broyden–Fletcher–Goldfarb–Shann solution algorithm. More... | |
| class | XC::Broyden |
| Broyden method solution algorithm. More... | |
| class | XC::EquiSolnAlgo |
| Base class for solution algorithms. More... | |
| class | XC::EquiSolnConvAlgo |
| EquiSolnConvAlgo is a class which performs a Newton-Raphson solution algorithm in solving the equations. More... | |
| class | XC::KrylovNewton |
| KrylovNewton algorithm object which uses a Krylov subspace accelerator to accelerate the convergence of the modified newton method. More... | |
| class | XC::BisectionLineSearch |
| Bisection line search solution algorithm. More... | |
| class | XC::InitialInterpolatedLineSearch |
| This performs the search by using a form of linear interpolation to find the best solution. More... | |
| class | XC::LineSearch |
| Base class for line search algorithms. More... | |
| class | XC::NewtonLineSearch |
| performs a Newton-Raphson with line search solution algorithm in solving the equations as outline in Crissfield's book. More... | |
| class | XC::RegulaFalsiLineSearch |
| performs the search for U(i+1) = U(i) + eta * deltaU(i) by regula falsi method to find the best solution. More... | |
| class | XC::SecantLineSearch |
| performs the search for U(i+1) = U(i) + eta * deltaU(i) by using the secant method to find the best solution. More... | |
| class | XC::Linear |
| Linear solution algorithm. More... | |
| class | XC::ModifiedNewton |
| Modified Newton-Raphson algorithm. More... | |
| class | XC::NewtonBased |
| Base class for algorithms based on Newton method. More... | |
| class | XC::NewtonRaphson |
| Newton-Raphson algorgitht. More... | |
| class | XC::PeriodicNewton |
| PeriodicNewton is a class which performs a Periodic Newton-Raphson solution algorithm in solving the equations. More... | |
