try updating docs for Documenter & 0.6

Author: MikaelSlevinsky

.gitignore

@@ -1,4 +1,2 @@
-*.jl.cov
-*.jl.*.cov
-*.jl.mem
-site
+docs/build/
+docs/site/

.travis.yml

@@ -8,6 +8,10 @@ julia:
   - nightly
 notifications:
   email: false
+after_success:
+  - julia -e 'Pkg.add("Documenter")'
+  - julia -e 'cd(Pkg.dir("FastTransforms")); include(joinpath("docs", "make.jl"))'
+
 # uncomment the following lines to override the default test script
 #script:
 #  - if [[ -a .git/shallow ]]; then git fetch --unshallow; fi

LICENSE.md

@@ -1,6 +1,6 @@
 The FastTransforms.jl package is licensed under the MIT "Expat" License:
 
-> Copyright (c) 2016: Richard Mikael Slevinsky.
+> Copyright (c) 2017: Richard Mikael Slevinsky.
 >
 > Permission is hereby granted, free of charge, to any person obtaining
 > a copy of this software and associated documentation files (the

README.md

@@ -1,11 +1,13 @@
 # FastTransforms.jl
 
-[![Build Status](https://travis-ci.org/MikaelSlevinsky/FastTransforms.jl.svg?branch=master)](https://travis-ci.org/MikaelSlevinsky/FastTransforms.jl) [![Documentation Status](https://readthedocs.org/projects/fasttransformsjl/badge/?version=latest)](http://fasttransformsjl.readthedocs.org/en/latest/?badge=latest)
-
-The aim of this package is to provide a new class of fast transforms
-based on the use of asymptotic formulae to relate the transforms to a small
-number of fast Fourier transforms. This new class of fast transforms does not
-require large pre-computation for fast execution, and they are designed
+[![Build Status](https://travis-ci.org/MikaelSlevinsky/FastTransforms.jl.svg?branch=master)](https://travis-ci.org/MikaelSlevinsky/FastTransforms.jl) [![](https://img.shields.io/badge/docs-stable-blue.svg)](https://MikaelSlevinsky.github.io/FastTransforms.jl/stable) [![](https://img.shields.io/badge/docs-latest-blue.svg)](https://MikaelSlevinsky.github.io/FastTransforms.jl/latest)
+
+The aim of this package is to provide new classes of fast transforms with low
+pre-computation. One approach is based on the use of asymptotic formulae to
+relate the transforms to a small number of fast Fourier transforms. Another
+approach is based on a Toeplitz-dot-Hankel decomposition of the matrix of
+connection coefficients. Both new classes of fast transforms do not
+require large pre-computation for fast execution and they are designed
 to work on expansions of functions with any degree of regularity.
 
 The Chebyshev—Jacobi transform and its inverse are implemented. This
@@ -41,6 +43,11 @@ is valid for the half-open square `(α,β) ∈ (-1/2,1/2]^2`. Therefore, the fas
 when the parameters are inside. If the parameters `(α,β)` are not exceptionally beyond the square,
 then increment/decrement operators are used with linear complexity (and linear conditioning) in the degree.
 
+The Padua transform and its inverse are also implemented thanks to
+[Michael Clarke](https://github.com/MikeAClarke). These are optimized methods
+designed for computing the bivariate Chebyshev coefficients by interpolating a
+bivariate function at the Padua points on `[-1,1]^2`.
+
 # References:
 
    1.	N. Hale and A. Townsend. <a href="http://dx.doi.org/10.1137/130932223">A fast, simple, and stable Chebyshev—Legendre transform using and asymptotic formula</a>, SIAM J. Sci. Comput., 36:A148—A167, 2014.