 | 2012 |
| 33 |  | John P. Boyd:
Numerical, perturbative and Chebyshev inversion of the incomplete elliptic integral of the second kind.
Applied Mathematics and Computation 218(13): 7005-7013 (2012) |
| 32 |  | John P. Boyd,
Zhengjie Xu:
Numerical and perturbative computations of solitary waves of the Benjamin-Ono equation with higher order nonlinearity using Christov rational basis functions.
J. Comput. Physics 231(4): 1216-1229 (2012) |
| 2011 |
| 31 |  | John P. Boyd:
One-point pseudospectral collocation for the one-dimensional Bratu equation.
Applied Mathematics and Computation 217(12): 5553-5565 (2011) |
| 30 |  | John P. Boyd:
The near-equivalence of five species of spectrally-accurate radial basis functions (RBFs): Asymptotic approximations to the RBF cardinal functions on a uniform, unbounded grid.
J. Comput. Physics 230(4): 1304-1318 (2011) |
| 29 |  | John P. Boyd,
Fu Yu:
Comparing seven spectral methods for interpolation and for solving the Poisson equation in a disk: Zernike polynomials, Logan-Shepp ridge polynomials, Chebyshev-Fourier Series, cylindrical Robert functions, Bessel-Fourier expansions, square-to-disk conformal mapping and radial basis functions.
J. Comput. Physics 230(4): 1408-1438 (2011) |
| 28 |  | John P. Boyd:
New series for the cosine lemniscate function and the polynomialization of the lemniscate integral.
J. Computational Applied Mathematics 235(8): 1941-1955 (2011) |
| 2010 |
| 27 |  | John P. Boyd,
Lei Wang:
Asymptotic coefficients for Gaussian radial basis function interpolants.
Applied Mathematics and Computation 216(8): 2394-2407 (2010) |
| 26 |  | John P. Boyd:
The Legendre-Burgers equation: When artificial dissipation fails.
Applied Mathematics and Computation 217(5): 1949-1964 (2010) |
| 25 |  | John P. Boyd:
Six strategies for defeating the Runge Phenomenon in Gaussian radial basis functions on a finite interval.
Computers & Mathematics with Applications 60(12): 3108-3122 (2010) |
| 24 |  | John P. Boyd:
The uselessness of the Fast Gauss Transform for summing Gaussian radial basis function series.
J. Comput. Physics 229(4): 1311-1326 (2010) |
| 23 |  | John P. Boyd:
Error saturation in Gaussian radial basis functions on a finite interval.
J. Computational Applied Mathematics 234(5): 1435-1441 (2010) |
| 2009 |
| 22 |  | John P. Boyd,
Fei Xu:
Divergence (Runge Phenomenon) for least-squares polynomial approximation on an equispaced grid and Mock-Chebyshev subset interpolation.
Applied Mathematics and Computation 210(1): 158-168 (2009) |
| 21 |  | John P. Boyd,
Lei Wang:
An analytic approximation to the cardinal functions of Gaussian radial basis functions on an infinite lattice.
Applied Mathematics and Computation 215(6): 2215-2223 (2009) |
| 20 |  | John P. Boyd,
Cheng Zhou:
Three ways to solve the Poisson equation on a sphere with Gaussian forcing.
J. Comput. Physics 228(13): 4702-4713 (2009) |
| 19 |  | John P. Boyd:
Acceleration of algebraically-converging Fourier series when the coefficients have series in powers of 1/n.
J. Comput. Physics 228(5): 1404-1411 (2009) |
| 2008 |
| 18 |  | John P. Boyd:
Exploiting parity in converting to and from Bernstein polynomials and orthogonal polynomials.
Applied Mathematics and Computation 198(2): 925-929 (2008) |
| 17 |  | John P. Boyd:
Evaluating of Dawson's Integral by solving its differential equation using orthogonal rational Chebyshev functions.
Applied Mathematics and Computation 204(2): 914-919 (2008) |
| 2007 |
| 16 |  | John P. Boyd:
Exponentially accurate Runge-free approximation of non-periodic functions from samples on an evenly spaced grid.
Appl. Math. Lett. 20(9): 971-975 (2007) |
| 15 |  | John P. Boyd:
A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series.
Applied Mathematics and Computation 188(2): 1780-1789 (2007) |
| 14 |  | John P. Boyd:
Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries.
Computers & Mathematics with Applications 54(3): 336-349 (2007) |
| 13 |  | John P. Boyd:
Why Newton's method is hard for travelling waves: Small denominators, KAM theory, Arnold's linear Fourier problem, non-uniqueness, constraints and erratic failure.
Mathematics and Computers in Simulation 74(2-3): 72-81 (2007) |
| 2006 |
| 12 |  | John P. Boyd:
Fourier pseudospectral method with Kepler mapping for travelling waves with discontinuous slope: Application to corner waves of the Ostrovsky-Hunter equation and equatorial Kelvin waves in the four-mode approximation.
Applied Mathematics and Computation 177(1): 289-299 (2006) |
| 11 |  | John P. Boyd,
Robert M. Visser:
Rootfinding through global Newton iteration and Chebyshev polynomials for the amplitude of an electronic oscillator.
Applied Mathematics and Computation 182(1): 166-174 (2006) |
| 10 |  | John P. Boyd:
Asymptotic Fourier Coefficients for a C infinity Bell (Smoothed-"Top-Hat") & the Fourier Extension Problem.
J. Sci. Comput. 29(1): 1-24 (2006) |
| 2005 |
| 9 |  | John P. Boyd:
Algorithm 840: computation of grid points, quadrature weights and derivatives for spectral element methods using prolate spheroidal wave functions - prolate elements.
ACM Trans. Math. Softw. 31(1): 149-165 (2005) |
| 8 |  | John P. Boyd:
Fourier embedded domain methods: extending a function defined on an irregular region to a rectangle so that the extension is spatially periodic and C INFINITY .
Applied Mathematics and Computation 161(2): 591-597 (2005) |
| 7 |  | John P. Boyd:
The cnoidal wave/corner wave/breaking wave scenario: A one-sided infinite-dimension bifurcation.
Mathematics and Computers in Simulation 69(3-4): 235-242 (2005) |
| 6 |  | John P. Boyd:
Chebyshev solution of the nearly-singular one-dimensional Helmholtz equation and related singular perturbation equations: multiple scale series and the boundary layer rule-of-thumb.
Numerical Algorithms 38(1-3): 197-207 (2005) |
| 2002 |
| 5 |  | John P. Boyd:
Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding.
SIAM J. Numerical Analysis 40(5): 1666-1682 (2002) |
| 2001 |
| 4 |  | John P. Boyd:
Additive blending of local approximations into a globally-valid approximation with application to the dilogarithm.
Appl. Math. Lett. 14(4): 477-481 (2001) |
| 2000 |
| 3 |  | William Rodman Shankle,
Benjamin H. Landing,
Michael S. Rafii,
Junko Hara,
James H. Fallon,
A. Kimball Romney,
John P. Boyd:
CYBERCHILD: A database of the microscopic development of the postnatal human cerebral cortex from birth to 72 months.
Neurocomputing 32-33: 1109-1114 (2000) |
| 1993 |
| 2 |  | John P. Boyd:
Chebyshev and Legendre Spectral Methods in Algebraic Manipulation Languages.
J. Symb. Comput. 16(4): 377-399 (1993) |
| 1988 |
| 1 |  | John P. Boyd:
Chebyshev domain truncation is inferior to fourier domain truncation for solving problems on an infinite interval.
J. Sci. Comput. 3(2): 109-120 (1988) |