/*
 * Copyright (c) 2012-2013, Peter Abeles. All Rights Reserved.
 *
 * This file is part of DDogleg (http://ddogleg.org).
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.ddogleg.solver;

/**
 * Types of polynomial root finding algorithms that can be used
 *
 * @author Peter Abeles
 */
public enum RootFinderType {
	/**
	 * Eigenvalue decomposition based.  Returns real and complex roots. Most accurate but slightly slower.
	 */
	EVD,
	/**
	 * Uses Sturm sequences to find roots.  Only real roots and the fastest algorithm, but slightly less accurate.
	 */
	STURM
}