#### Filter Results:

- Full text PDF available (0)

#### Publication Year

1967

1976

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- John D. Lipson
- SYMSAC '71
- 1971

This paper is concerned with mathematical, computational, and historical aspects of the Chinese Remainder and Interpolation Theorems of number theory and numerical analysis, with a view to their application to symbolic computation.

- J D Lipson, H E Stephenson
- Archives of surgery
- 1971

- John D. Lipson
- SYMSACC
- 1976

The analytic concepts of approximation, convergence, differentiation, and Taylor series expansion are applied and interpreted in the context of an abstract power series domain. Newton's method is then shown to be applicable to solving for a power series root of a polynomial with power series coefficients, resulting in fast algorithms for a variety of power… (More)

- John D. Lipson, Ellis Horowitz, David R. Musser
- ACM Annual Conference
- 1976

This is the second in a series of two tutorial sessions featuring letures from the 1975-76 SIGSAM Lecture Program. Prof. Lipson's tutorial will discuss the Cooley-Tukey fast Fourier transform, and algorithm which has truly revolutionized large scale time series analysis. Prof. Horowitz presents a taxonomy of algorithms with examples of algorithms in each… (More)

- John D. Lipson
- ACM Annual Conference
- 1976

In the past decade the Cooley-Tukey fast Fourier transform (FFT) [1] has achieved the status of a “super” algorithm. As a numerical (complex field) algorithm, the FFT has revolutionized large scale time series analysis in a way that counts most—economic. (See, e.g., Refs. 3-6.) Since the late sixties, the FFT has also emerged as an… (More)

- John D. Lipson
- IEEE Trans. Information Theory
- 1967

It is possible to construct polynomials a(x), b(r) of the type required (i.e., of degree 4~ 1 with all coeflicients fl) such that f(z) = G&,+,~~, g(s) = @.2pl@z. The construction is illustrated below for the case n= 18. If 2m is the highest power of 2 dividing n, there are at most m + 1 cyclically orthogonal vectors of length n with coordinates fl (without… (More)

- John D. Lipson
- IFIP Congress
- 1974

- E L Lichti, J D Lipson, B E Terry
- The American surgeon
- 1974

- ‹
- 1
- ›