Click here to Skip to main content
15,881,380 members
Everything / Polynomial

Polynomial

polynomial

Great Reads

by Xavier Junqué i de Fortuny
Polynomials Math Parser and Evaluator in VB.NET
by Henrik Vestermark
Practical implementation of a fast, robust and reliable polynomial root finder using Newton's method
by Henrik Vestermark
Practical implementation of a fast, robust and stable polynomial root finder using Halley's method
by Member 4201813
Jump forward/backward procedures for XorShift RNG explained step by step

Latest Articles

by Henrik Vestermark
Durand-Kerner method for Polynomial roots. A fast and reliable simultaneous method
by Henrik Vestermark
Laguerre's method for a stable and efficient polynomial root finder.
by Henrik Vestermark
Practical implementation of a fast, robust and stable polynomial root finder using Halley's method
by Henrik Vestermark
Fast and Stable Polynomial root finder for Polynomial with real coefficients

All Articles

Sort by Score

Polynomial 

4 May 2022 by Xavier Junqué i de Fortuny
Polynomials Math Parser and Evaluator in VB.NET
11 Oct 2023 by Henrik Vestermark
Practical implementation of a fast, robust and reliable polynomial root finder using Newton's method
11 Nov 2023 by Henrik Vestermark
Practical implementation of a fast, robust and stable polynomial root finder using Halley's method
24 Apr 2020 by Member 4201813
Jump forward/backward procedures for XorShift RNG explained step by step
14 Apr 2020 by Member 4201813
Jump forward/backward procedures for XorShift RNG explained step by step
20 Dec 2023 by Henrik Vestermark
Durand-Kerner method for Polynomial roots. A fast and reliable simultaneous method
24 Mar 2021 by Richard MacCutchan
You can get the input values by: char text[132]; int values[5]; fgets(text, 132, stdin); char* pNext = strtok(text, " \t\n"); for (int i = 0; i
24 Mar 2021 by Rick York
It is best to separate program functionality. The code Richard gave you will accept input and process it into an array of five integers. These are the coefficients in your program. The value five could be anything else you want - it...
9 May 2021 by mike@codeproject
Adding to what Rick York said in comments, also make a separate function for each basic polynomial operation you want to support. One really useful one would be a find_exponent(struct node *poly, int exponent, bool insert) function that would...
24 Mar 2021 by anonymous thisis
1. I want to make a code that user could make a input about coefficients directly, not the program maker just decides the coefficients. For example, if user puts 5 0 1 5 2, it means 5x^4+x^2+5x+2. And I guess I can make this code using fgets and...
9 May 2021 by Margarit
I am trying to add a monomial after creating a polynomial by asking user to enter number of nodes, coefficient and exponent. I have 2 polynomials. I want to ask user to choose one of the polynomials and then after that, add the entered monomial...
4 Apr 2023 by Richard MacCutchan
Lots of possibilities coefficient/Polynomials c - Google Search[^]
29 Nov 2023 by Henrik Vestermark
Laguerre's method for a stable and efficient polynomial root finder.
17 Oct 2023 by Henrik Vestermark
Fast and Stable Polynomial root finder for Polynomial with real coefficients
4 Apr 2023 by Atul Shriram rane
Hi, I have to implement LINEST function of Excel in C#.Net. Can someone please help in how to implement it or if we have any inbuilt function/Class which can help me in calculating coefficient/Polynomials. Thanks Atul What I have tried: ...
18 Apr 2023 by InvisibleMedia
This article describes how to divide two polynomials and shows the source code to calculate this division. There is also code to add, subtract and multiply two polynomials.