NHNicholas Hale

Nicholas Hale

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Nicholas Hale has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Advection, Diffusion, Dispersion and All Things in Between

    by J. A. C. Weideman, Nicholas Hale

    As an example in their complex variables textbook, Mark Ablowitz and Athanassios Fokas apply the method of steepest descent to derive an asymptotic estimate for the solution of the linear Korteweg–de Vries (KdV) equation for large times. Here the analysis is extended to an equation with a fractional dispersion relation that contains this KdV equation (which models dispersion), the heat equation (diffusion), and the one-way wave equation (advection) as special cases.

  • Open Access

    Approximate solutions to a nonlinear functional differential equation

    by Nicholas Hale, Enrique Thomann, J.A.C. Weideman


  • A spectral collocation method for functional and delay differential equations

    by Nicholas Hale

    A framework for Chebyshev spectral collocation methods for the numerical solution of functional and delay differential equations (FDEs and DDEs) is described. The framework combines interpolation via the barycentric resampling matrix with a multidomain approach used to resolve isolated discontinuities propagated by nonsmooth initial data. Geometric convergence in the number of degrees of freedom is demonstrated for several examples of linear and nonlinear FDEs and DDEs with various delay types, including discrete, proportional, continuous and state-dependent delay. The framework is a natural extension of standard spectral collocation methods and can be readily incorporated into existing spectral discretizations, such as in Chebfun/Chebop, allowing the automated and efficient solution of a wide class of nonlinear FDEs and DDEs.


  • Open Access

    Prandtl’s extended mixing length model applied to the two-dimensional turbulent classical far wake

    by Ashleigh J. Hutchinson, Nicholas Hale, Kendall Born, David P. Mason

    Despite its limitations, Prandtl’s mixing length model is widely applied in modelling turbulent free shear flows. Prandtl’s extended model addresses many of the shortfalls of the original model, but is not so widely used, in part due to additional mathematical complexities that arise in its derivation and implementation. Furthermore, in both models, Prandtl neglects the kinematic viscosity on the basis that it is much smaller in magnitude than the turbulent viscosity. Recent work has shown that including the kinematic viscosity in the original model has both mathematical and physical advantages. In the present work, a novel derivation of the extended model is provided, and it is demonstrated that similar advantages are again obtained when the kinematic viscosity is included. Additionally, through the use of scaling techniques, similarity mean velocity profiles of the extended model are derived, resulting in a single nonlinear ordinary differential equation that is solved numerically with a Hermite spectral method. The computed profiles for the normalized similarity mean velocity and shear stress are compared with experimental observations and shown to be in excellent agreement.


  • Open Access

    The ultraspherical spectral element method

    by Daniel Fortunato, Nicholas Hale, Alex Townsend

    We introduce a novel spectral element method based on the ultraspherical spectral method and the hierarchical Poincar\'{e}-Steklov scheme for solving second-order linear partial differential equations on polygonal domains with unstructured quadrilateral or triangular meshes. Properties of the ultraspherical spectral method lead to almost banded linear systems, allowing the element method to be competitive in the high-polynomial regime ($p > 5$). The hierarchical Poincar\'{e}-Steklov scheme enables precomputed solution operators to be reused, allowing for fast elliptic solves in implicit and semi-implicit time-steppers. The resulting spectral element method achieves an overall computational complexity of $\mathcal{O}(p^4/h^3)$ for mesh size $h$ and polynomial order $p$, enabling $hp$-adaptivity to be efficiently performed. We develop an open-source software system, ultraSEM, for flexible, user-friendly spectral element computations in MATLAB.

  • Pricing European-type, early-exercise and discrete barrier options using an algorithm for the convolution of Legendre series

    by Tat Lung (Ron) Chan, Nicholas Hale

    This paper applies an algorithm for the convolution of compactly supported Legendre series (the CONLeg method) (cf. Hale and Townsend, An algorithm for the convolution of Legendre series. SIAM J. Sci. Comput., 2014, 36, A1207–A1220), to pricing European-type, early-exercise and discrete-monitored barrier options under a Lévy process. The paper employs Chebfun (cf. Trefethen et al., Chebfun Guide, 2014 (Pafnuty Publications: Oxford), Available online at: http://www.chebfun.org/) in computational finance and provides a quadrature-free approach by applying the Chebyshev series in financial modelling. A significant advantage of using the CONLeg method is to formulate option pricing and option Greek curves rather than individual prices/values. Moreover, the CONLeg method can yield high accuracy in option pricing when the risk-free smooth probability density function (PDF) is smooth/non-smooth. Finally, we show that our method can accurately price options deep in/out of the money and with very long/short maturities. Compared with existing techniques, the CONLeg method performs either favourably or comparably in numerical experiments.


  • Open Access

    Hedging and Pricing European-type, Early-Exercise and Discrete Barrier Options using Algorithm for the Convolution of Legendre Series

    by Tat Lung Chan, Nicholas Hale

    This paper applies an algorithm for the convolution of compactly supported Legendre series (the CONLeg method) (cf. Hale and Townsend 2014a), to pricing/hedging European-type, early-exercise and discrete-monitored barrier options under a Levy process. The paper employs Chebfun (cf. Trefethen et al. 2014) in computational finance and provides a quadrature-free approach by applying the Chebyshev series in financial modelling. A significant advantage of using the CONLeg method is to formulate option pricing and option Greek curves rather than individual prices/values. Moreover, the CONLeg method can yield high accuracy in option pricing and hedging when the risk-free smooth probability density function (PDF) is smooth/non-smooth. Finally, we show that our method can accurately price/hedge options deep in/out of the money and with very long/short maturities. Compared with existing techniques, the CONLeg method performs either favourably or comparably in numerical experiments.

  • An ultraspherical spectral method for linear Fredholm and Volterra integro-differential equations of convolution type

    by Nicholas Hale

    The Legendre-based ultraspherical spectral method for ordinary differential equations (Olver, S. & Townsend, A. (2013) A fast and well-conditioned spectral method. SIAM Rev., 55, 462–489.) is combined with a formula for the convolution of two Legendre series (Hale, N. & Townsend, A. (2014a) An algorithm for the convolution of Legendre series. SIAM J. Sci. Comput., 36, A1207–A1220.) to produce a new technique for solving linear Fredholm and Volterra integro-differential equations with convolution-type kernels. When the kernel and coefficient functions are sufficiently smooth, then the method is spectrally accurate and the resulting almost-banded linear systems can be solved with linear complexity.


  • A Fast and Spectrally Convergent Algorithm for Rational-Order Fractional Integral and Differential Equations

    by Nicholas Hale, Sheehan Olver

    A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for ODEs [S. Olver and A. Townsend, SIAM Rev., 55 (2013), pp. 462--489] and involves constructing two different bases, one for the domain of the operator and one for the range of the operator. The bases are constructed from direct sums of suitably weighted ultraspherical or Jacobi polynomial expansions, for which explicit representations of fractional integrals and derivatives are known, and are carefully chosen so that the resulting operators are banded or almost banded. Geometric convergence is demonstrated for numerous model problems when the variable coefficients and right-hand side are sufficiently smooth.


  • A fast FFT-based discrete Legendre transform

    by Nicholas Hale, Alex Townsend

    An ${\mathcal O}(N(\log N)^2/\log \log N)$ algorithm for the computation of the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev coefficients with a Taylor series expansion for Chebyshev polynomials about equally spaced points in the frequency domain. Both components are based on the fast Fourier transform, and as an intermediate step we obtain an ${\mathcal O}(N\log N)$ algorithm for evaluating a degree-$(N-1)$ Chebyshev expansion on an $N$-point Legendre grid. Numerical results are given to demonstrate performance and accuracy.