Finding Square Roots and Solving Quadratic Equations
نویسندگان
چکیده
Now, the formula does not provide us with a solution that is written in decimal form; to get such a solution we need to evaluate the above expression. To this end, since most computers perform additions, subtractions, multiplications, and even divisions very fast, we should focus on the need to take a squareroot. In short, the “explicit” solution for the quadratic equation actually reduces our problem to finding an algorithm for computing squareroots. Even if we have such an algorithm, we have to ask if using the quadratic formula is the most efficient way to solve this equation; in other words, whether the best algorithm for finding squareroots is superior to the best algorithm that solves the quadratic equation without using the formula. As we shall show now, we can extend the powerful square root algorithm we proposed in the last lecture so that it solves general quadratic equations, making the use of the quadratic formula (2) unnecessary (and, in fact, inefficient).
منابع مشابه
Algorithm for Solving Massively Underdefined Systems of Multivariate Quadratic Equations over Finite Fields
Multivariate Quadratic Equations over Finite Fields Heliang Huang, Wansu Bao* Zhengzhou Information Science and Technology Institute, Zhengzhou 450000, China ABSTRACT Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the un...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملSolving the liner quadratic differential equations with constant coefficients using Taylor series with step size h
In this study we produced a new method for solving regular differential equations with step size h and Taylor series. This method analyzes a regular differential equation with initial values and step size h. this types of equations include quadratic and cubic homogenous equations with constant coeffcients and cubic and second-level equations.
متن کاملAnother Look at Square Roots and Traces (and Quadratic Equations) in Fields of Even Characteristic
We discuss irreducible polynomials that can be used to speed up square root extraction in fields of characteristic two. The obvious applications are to point halving methods for elliptic curves and divisor halving methods for hyperelliptic curves. Irreducible polynomials P (X) such that the square root ζ of a zero x of P (X) is a sparse polynomial are considered and those for which ζ has minima...
متن کاملFinite Field Arithmetic
11.1 Prime fields of odd characteristic 201 Representations and reductions • Multiplication • Inversion and division • Exponentiation • Squares and square roots 11.2 Finite fields of characteristic 2 213 Representation • Multiplication • Squaring • Inversion and division • Exponentiation • Square roots and quadratic equations 11.3 Optimal extension fields 229 Introduction • Multiplication • Exp...
متن کامل