Search Results for author: Sheehan Olver

Found 7 papers, 6 papers with code

Sparse spectral methods for partial differential equations on spherical caps

no code implementations21 Dec 2020 Ben Snowball, Sheehan Olver

In recent years, sparse spectral methods for solving partial differential equations have been derived using hierarchies of classical orthogonal polynomials on intervals, disks, disk-slices and triangles.

Numerical Analysis Numerical Analysis 65N35

Orthogonal polynomials in and on a quadratic surface of revolution

1 code implementation25 Jun 2019 Sheehan Olver, Yuan Xu

We present explicit constructions of orthogonal polynomials inside quadratic bodies of revolution, including cones, hyperboloids, and paraboloids.

Classical Analysis and ODEs Numerical Analysis Numerical Analysis 42C05, 42C10, 65D15, 65D32

A sparse spectral method on triangles

1 code implementation13 Feb 2019 Sheehan Olver, Alex Townsend, Geoff Vasil

In this paper, we demonstrate that many of the computational tools for univariate orthogonal polynomials have analogues for a family of bivariate orthogonal polynomials on the triangle, including Clenshaw's algorithm and sparse differentiation operators.

Numerical Analysis 65N35

Tensor calculus in polar coordinates using Jacobi polynomials

1 code implementation25 Sep 2015 Geoffrey M. Vasil, Keaton J. Burns, Daniel Lecoanet, Sheehan Olver, Benjamin P. Brown, Jeffrey S. Oishi

In this paper we describe a set of bases built out of Jacobi polynomials, and associated operators for solving scalar, vector, and tensor partial differential equations in polar coordinates on a unit disk.

Numerical Analysis Instrumentation and Methods for Astrophysics

A fast and well-conditioned spectral method for singular integral equations

3 code implementations2 Jul 2015 Richard Mikael Slevinsky, Sheehan Olver

The resulting system can be solved in ${\cal O}(m^2n)$ operations using an adaptive QR factorization, where $m$ is the bandwidth and $n$ is the optimal number of unknowns needed to resolve the true solution.

Numerical Analysis 65N35, 65R20, 33C45, 31A10

Fast computation of Gauss quadrature nodes and weights on the whole real line

1 code implementation20 Oct 2014 Alex Townsend, Thomas Trogdon, Sheehan Olver

The algorithm is based on Newton's method with carefully selected initial guesses for the nodes and a fast evaluation scheme for the associated orthogonal polynomial.

Numerical Analysis

On the use of conformal maps for the acceleration of convergence of the trapezoidal rule and Sinc numerical methods

2 code implementations12 Jun 2014 Richard Mikael Slevinsky, Sheehan Olver

We investigate the use of conformal maps for the acceleration of convergence of the trapezoidal rule and Sinc numerical methods.

Numerical Analysis 30C30, 41A30, 65D30, 65L10

Cannot find the paper you are looking for? You can Submit a new open access paper.