Search results

Create the page "Polynomial" on this wiki! See also the search results found.

Page title matches

• Notes:Polynomial ring
  ...,X^2,\ldots,X^n,\ldots\} }} be the [[free monoid generated by]] {{M|X}}. A polynomial over a [[ring]]<ref group="Note">After Grillet writes "''(with identity)''"
  1 KB (220 words) - 19:42, 19 November 2016
• Polynomial u-ring
  * A ''polynomial'', {{M|P\in R[X]}}, over {{M|R}} is a [[mapping]]: {{M|P:M\rightarrow R}} b * It is normal to identify {{M|r\in R}} with the ''constant polynomial''<ref name="AAPAG"/>: {{M|a_n:\eq\left\{\begin{array}{lr}0 & \text{if }n>0\
  3 KB (643 words) - 02:34, 20 November 2016
• Bernstein polynomial/Definition
  </noinclude>The {{M|n}}^th ''Bernstein polynomial'' for a function {{M|f:I\rightarrow\mathbb{R} }} (where {{M|I:\eq[0,1]\subs
  447 B (69 words) - 10:44, 25 November 2016
• Bernstein polynomial
  547 B (91 words) - 10:44, 25 November 2016
• Reversing the order of coefficients of a polynomial
  {{Stub page|grade=A**|msg=Flesh this out, make a 0 condition, write the polynomial as {{M|\sum_{i\eq 0}^n a_ix^i}} and so forth [[User:Alec|Alec]] ([[User tal
  675 B (131 words) - 13:45, 18 December 2017

Page text matches

• Monomial
  ...al''<ref name="C">Combinatorics - Russell Merris</ref> is a a [[Polynomial|polynomial]] consisting of "no {{M|+}} sign" if you will (unless it is in the coeffici In short, it is a polynomial of just one term.
  942 B (143 words) - 13:49, 17 June 2015
• Notes:Modules
  ...is finite {{caution|I would have thought}})</ref> be given. Then for any [[polynomial]], {{M|p(x)\in F[x]}} (where {{M|F[x]}} denotes the space of [[polynomials ...linear operator {{M|\tau:V\rightarrow V}} we can define the product of a [[polynomial]], {{M|p(x)\in F[x]}} and a [[vector]], {{M|v\in V}} by:
  4 KB (808 words) - 17:18, 11 October 2016
• Notes:Polynomial ring
  ...,X^2,\ldots,X^n,\ldots\} }} be the [[free monoid generated by]] {{M|X}}. A polynomial over a [[ring]]<ref group="Note">After Grillet writes "''(with identity)''"
  1 KB (220 words) - 19:42, 19 November 2016
• Polynomial u-ring
  * A ''polynomial'', {{M|P\in R[X]}}, over {{M|R}} is a [[mapping]]: {{M|P:M\rightarrow R}} b * It is normal to identify {{M|r\in R}} with the ''constant polynomial''<ref name="AAPAG"/>: {{M|a_n:\eq\left\{\begin{array}{lr}0 & \text{if }n>0\
  3 KB (643 words) - 02:34, 20 November 2016
• Example:A smooth function that is not real analytic
  ...bb{R} }} is the map with {{M|p_m:y\mapsto p(y)}} meaning {{link|evaluation|polynomial}} at {{M|y\in\mathbb{R} }}. ...ure whether or not there'd be problems with a 0 {{link|degree|polynomial}} polynomial, but I want to sidestep it}} we shall prove this by induction starting from
  5 KB (1,030 words) - 04:25, 27 November 2016
• Bernstein polynomial/Definition
  </noinclude>The {{M|n}}^th ''Bernstein polynomial'' for a function {{M|f:I\rightarrow\mathbb{R} }} (where {{M|I:\eq[0,1]\subs
  447 B (69 words) - 10:44, 25 November 2016
• Weierstrass approximation theorem
  * there exists a [[polynomial]], {{M|p(x):\mathbb{R}\rightarrow\mathbb{R} }} such that ...|[0,1]}} then apply the reverse of that "contraction" to put the resulting polynomial on {{M|[a,b]}}.
  8 KB (1,610 words) - 08:17, 28 December 2016
• Reversing the order of coefficients of a polynomial
  {{Stub page|grade=A**|msg=Flesh this out, make a 0 condition, write the polynomial as {{M|\sum_{i\eq 0}^n a_ix^i}} and so forth [[User:Alec|Alec]] ([[User tal
  675 B (131 words) - 13:45, 18 December 2017
• Distribution of the sample median
  ...our {{M|\P{M\le r} }} equations above. We must then multiply this reversed polynomial by {{M|x^{m+1} }} I believe and job done! ==Reversing polynomial order==
  5 KB (994 words) - 01:22, 16 March 2018