John C. Mason

According to our database, John C. Mason authored at least 9 papers between 1967 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of six.

2005

Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part II: Clenshaw-Lord type approximants.

John C. Mason, Andrew Crampton

Numer. Algorithms, 2005

Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part I. Maehly type approximants.

John C. Mason, Andrew Crampton

Numer. Algorithms, 2005

The minimality properties of chebyshev polynomials and their lacunary series.

John C. Mason

Numer. Algorithms, 2005

Detecting and approximating fault lines from randomly scattered data.

Andrew Crampton, John C. Mason

Numer. Algorithms, 2005

2004

Minimax approximation from a least squares solution.

Dongdong Lei, John C. Mason

Optim. Methods Softw., 2004

1999

A Chebyshev polynomial method for line integrals with singularities.

John C. Mason, Ezio Venturino

Adv. Comput. Math., 1999

1995

Constrained near-minimax approximation by weighted expansion and interpolation using Chebyshev polynomials of the second, third, and fourth kinds.

John C. Mason, G. H. Elliott

Numer. Algorithms, 1995

1968

Chebyshev methods for separable partial differential equations.

John C. Mason

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1967

A Chebyshev method for the numerical solution of the one-dimensional heat equation.

John C. Mason

Proceedings of the 22nd national conference, 1967