<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Polynomials / Polynomial / Quadratic formula / Irreducible polynomial / Polynomial greatest common divisor
Date: 2016-02-05 12:38:06
Mathematics
Algebra
Polynomials
Polynomial
Quadratic formula
Irreducible polynomial
Polynomial greatest common divisor

Project 1: Part 1 Project 1 will be to calculate orthogonal polynomials. It will have several parts. Note: The scheme code in this writeup is available in the file project1.scm, available from the course web page. Warmup

Add to Reading List

Source URL: www.math.purdue.edu

Download Document from Source Website

File Size: 65,93 KB

Share Document on Facebook

Similar Documents

Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves ´ Alin Bostan1 , Pierrick Gaudry2 , Eric Schost3

Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves ´ Alin Bostan1 , Pierrick Gaudry2 , Eric Schost3

DocID: 1qMft - View Document

Project 1: Part 1 Project 1 will be to calculate orthogonal polynomials. It will have several parts. Note: The scheme code in this writeup is available in the file project1.scm, available from the course web page. Warmup

Project 1: Part 1 Project 1 will be to calculate orthogonal polynomials. It will have several parts. Note: The scheme code in this writeup is available in the file project1.scm, available from the course web page. Warmup

DocID: 1q8Ma - View Document

JMLR: Workshop and Conference Proceedings vol 40:1–14, 2015  Variable Selection is Hard Dean P. Foster  DEAN @ FOSTER . NET

JMLR: Workshop and Conference Proceedings vol 40:1–14, 2015 Variable Selection is Hard Dean P. Foster DEAN @ FOSTER . NET

DocID: 1pEs6 - View Document

Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech

Fast modular composition in any characteristic Kiran S. Kedlaya∗ MIT Christopher Umans† Caltech

DocID: 1pqIx - View Document

A fast algorithm for computing the p-curvature Alin Bostan Xavier Caruso  Éric Schost

A fast algorithm for computing the p-curvature Alin Bostan Xavier Caruso Éric Schost

DocID: 1p9lJ - View Document