GitHub

This C++ program is designed for finding the zero of a polynomial in a given interval and tolerence using Bisection, Secant and Hybrid Methods.

In order to run the program: 1)You need to compile the source code file (UtkuTurkbey.cpp) with a C++ compiler, and create "UtkuTurkbey.exe" executable file. 2)You need to run a command line, direct ...
BBC

Example - Finding roots of a cubic polynomial

First, we need to find which number when substituted into the equation will give the answer zero. \(f(1) = {(1)^3} + 4{(1)^2} + (1) - 6 = 0\) Therefore \((x - 1)\)is a factor. Factorise the quadratic ...
JSTOR Daily

Further Reduction of Zero-One Polynomial Programming Problems to Zero-One Linear Programming Problems

Operations Research, Vol. 21, No. 1, Mathematical Programming and Its Applications (Jan. - Feb., 1973), pp. 156-161 (6 pages) This paper gives rules that enable the transformation of a 0-1 polynomial ...
JSTOR Daily

Product Integration Over Infinite Intervals I. Rules Based on the Zeros of Hermite Polynomials

The paper discusses both theoretical properties and practical implementation of product integration rules of the form $$\int^\infty_{-\infty} k(x)f(x) dx \approx \sum ...
IEEE

Generalized Chebyshev Function of Arbitrary Order With Real-Frequency Zero Pairs in an Explicit Rational Polynomial Expression

Abstract: Generalized Chebyshev functions of an arbitrary order with up to three real-frequency zero pairs are derived in an explicit rational polynomial expression. Given in-band ripple level and ...