David Terr

Raytheon

Attivo dal 2004

Followers: 1 Following: 0

Messaggio

I received a Ph.D. in number theory from UC Berkeley in 1997. I also enjoy other areas of math, as well as physics and computer programming. I live in Goleta, CA, near Santa Barbara and work at Raytheon in Goleta.

Statistica

Visualizza badge

Feeds

Inviato

Pell.m
Pell(d,s,n) returns the first n positive integer solution to the modified Pell's equation x^2-dy^2=+

circa 17 anni fa | 1 download |

4.0 / 5

Inviato

LaguerrePoly.m
This program returns the coefficients of the Laguerre polynomial L_n, given n.

circa 17 anni fa | 1 download |

4.8 / 5

Inviato

numerical.zip
Archive containing numerical function files.

circa 21 anni fa | 1 download |

0.0 / 5

Inviato

Lucas.m
Given a nonnegative integer n, return the nth Lucas number.

circa 21 anni fa | 2 download |

5.0 / 5

Inviato

rqf.m
Reduce a binary quadratic form, given as a row vector of length 3.

circa 21 anni fa | 1 download |

0.0 / 5

Inviato

qftimes.m
This function composes two quadratic forms.

circa 21 anni fa | 0 download |

0.0 / 5

Inviato

Physics.zip
Archive containing various files pertaining to physics.

circa 21 anni fa | 1 download |

3.66667 / 5

Inviato

ClebschGordan.m
ClebschGordan(j1,j2,j,m1,m2,m) is the Clebsch-Gordan coefficient <j1,j2,m1,m2|j1,j2,j,m>.

circa 21 anni fa | 5 download |

5.0 / 5

Inviato

GeneralizedLucas.m
GeneralizedLucas(n,a,b) returns the generalized Lucas number with index n and parameters a and b.

circa 21 anni fa | 1 download |

0.0 / 5

Inviato

GeneralizedFibonacci.m
GeneralizedFibonacci(n,a,b) returns the generalized Fibonacci number.

circa 21 anni fa | 1 download |

5.0 / 5

Inviato

RoundQCF.m
RoundQCF(d,u,v) returns the "round" continued fraction expansion of (u+sqrt(d))/v.

circa 21 anni fa | 1 download |

0.0 / 5

Inviato

harmonic.m
Harmonic(n) is an estimate of the nth harmonic number.

oltre 21 anni fa | 1 download |

3.0 / 5

Inviato

fromcfrac.m
Returns the number with the given continued fraction expansion.

oltre 21 anni fa | 2 download |

0.0 / 5

Inviato

QCF.m
QCF(d,u,v,quiet) returns the continued fraction expansion of (u+sqrt(d))/v.

oltre 21 anni fa | 2 download |

0.0 / 5

Inviato

roundcfrac.m
Computes the "round continued fraction" of a given complex number.

oltre 21 anni fa | 1 download |

0.0 / 5

Inviato

cfrac.m
cfrax(x,n) returns the first n terms in the contined fraction expansion of x.

oltre 21 anni fa | 2 download |

5.0 / 5

Inviato

SpecialFunctions.zip
Special functions archive.

oltre 21 anni fa | 1 download |

0.0 / 5

Inviato

Wigner3j.m
Wigner3j(j1,j2,j,m1,m2,m) returns the Wigner 3j-symbol.

oltre 21 anni fa | 4 download |

3.4 / 5

Inviato

AssociatedLaguerrePoly.m
This program returns the coefficients of the Associated Laguerre polynomial L_{n,m}, given n and m.

oltre 21 anni fa | 1 download |

4.5 / 5

Inviato

HermitePoly.m
This program returns the coefficients of the Hermite polynomial H_n, given n.

oltre 21 anni fa | 2 download |

4.75 / 5

Inviato

LegendrePoly
This program returns the coefficients of the Legendre polynomial P_n, given n.

oltre 21 anni fa | 2 download |

3.83333 / 5

Inviato

ChebyshevPoly.m
This program returns the coefficients of the Chebyshev polynomial T_n, given n.

oltre 21 anni fa | 2 download |

3.57143 / 5

Inviato

partitiontable.m
Given a nonnegative integer n, compute a table of the unrestricted partition function p(m) for m<=n.

oltre 21 anni fa | 1 download |

5.0 / 5

Inviato

Fibonacci.m
Given an integer n, return the nth Fibonacci number.

oltre 21 anni fa | 1 download |

3.6 / 5

Inviato

binomial.m
This program computes the binomial coefficient C(n,m).

oltre 21 anni fa | 1 download |

2.0 / 5

Inviato

MinkowskiQM.m
Given x from 0 to 1, compute ?(x), where ? is the Minkowski question mark function.

oltre 21 anni fa | 1 download |

0.0 / 5

Inviato

ChebyshevExpansion.m
Given a polynomial f(x) expressed as a column vector, compute the coefficients of the expansion ...

oltre 21 anni fa | 2 download |

4.0 / 5

Inviato

LegendreExpansion.m
Given a polynomial f(x) expressed as a column vector, compute the coefficients of the expansion ...

oltre 21 anni fa | 2 download |

0.0 / 5

Inviato

tau.m
Given a nonnegative integer n, tau(n) is the Ramanujan tau function of n.

oltre 21 anni fa | 2 download |

0.0 / 5

Inviato

sigma.m
Given nonnegative integers k and n, sigma(k,n) is the sum of the kth powers of the divisors of n.

oltre 21 anni fa | 1 download |

0.0 / 5

Carica altro