Namespace pele#
PELE IMPLEMENTATION OF Class ATLJ POTENTIAL IN C++.
Detailed Description#
A faster steepest descent implementation in pele.
Should include line search methods for use in various optimizers refer to Nocedal and Wright Chapter 3 for information.
Interface from pele array to Eigen.
preferably should be header only,
generally slow but works on ill conditioned problems
Classes#
Enums#
Functions#
Function pele::dot(Array<double> const&, Array<double> const&)
Template Function pele::dot(VecN<N, dtype> const&, VecN<N, dtype> const&)
Template Function pele::dot(MatrixNM<N, L, dtype> const&, MatrixNM<L, M, dtype> const&)
Template Function pele::dot(MatrixNM<N, M, dtype> const&, pele::VecN<M, dtype> const&)
Template Function pele::operator<<(std::ostream&, const Array<dtype>&)
Function pele::operator<<(std::ostream&, std::shared_ptr<Graph>)
Template Function pele::operator<<(std::ostream&, const pele::MatrixAdapter<dtype>&)
Template Function pele::operator<<(std::ostream&, const MatrixNM<N, M, dtype>&)
Template Function pele::operator<<(std::ostream&, const VecN<N, dtype>&)