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.

48 lines
1.5 KiB

4 months ago
// This file is part of Bertini 2.
//
// b2/core/include/function_tree/simplify.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.
//
// b2/core/include/function_tree/simplify.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 b2/core/include/function_tree/simplify.hpp. If not, see
// <http://www.gnu.org/licenses/>.
//
// Copyright(C) 2017-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 wisconsin-eau claire
/**
\file include/function_tree/simplify.hpp
\brief simplification methods for nodal functions
General methods exploting polymorphism, for simplifying a Node, and all subnodes
*/
#ifndef BERTINI_FUNCTION_TREE_SIMPLIFY_HPP
#define BERTINI_FUNCTION_TREE_SIMPLIFY_HPP
#pragma once
#include "function_tree/node.hpp"
namespace bertini {
unsigned Simplify(std::shared_ptr<bertini::node::Node> const& n);
} // namespace bertini
#endif // include guards