Polyhedral Homotopy Continuation Method for solving sparse polynomial system, optimized by only tracing real zeros
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

54 lines
1.5 KiB

// This file is part of Bertini 2.
//
// nag_algorithms/sharpen.hpp is free software: you can redistribute it and/or
// modify it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
//(at your option) any later version.
//
// nag_algorithms/sharpen.hpp is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with nag_algorithms/sharpen.hpp. If not, see
// <http://www.gnu.org/licenses/>.
//
// Copyright(C) 2015 - 2021 by Bertini2 Development Team
//
// See <http://www.gnu.org/licenses/> for a copy of the license,
// as well as COPYING. Bertini2 is provided with permitted
// additional terms in the b2/licenses/ directory.
// individual authors of this file include:
// silviana amethyst, university of notre dame
/**
\file nag_algorithms/sharpen.hpp
\brief Provides the algorithms for sharpening points.
*/
#pragma once
#include "detail/visitable.hpp"
#include "io/generators.hpp"
#include "nag_algorithms/common/config.hpp"
#include "nag_algorithms/midpath_check.hpp"
#include "num_traits.hpp"
#include "tracking.hpp"
namespace bertini {
namespace algorithm {
namespace output {
struct Sharpen {};
} // namespace output
template <class SystemType>
struct Sharpen {};
} // namespace algorithm
} // namespace bertini