#### Filter Results:

- Full text PDF available (67)

#### Publication Year

1964

2018

- This year (4)
- Last 5 years (20)
- Last 10 years (48)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jens Keiner, Stefan Kunis, Daniel Potts
- ACM Trans. Math. Softw.
- 2009

NFFT 3 is a software library that implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier transforms on the sphere andâ€¦ (More)

- Ben Leslie, Peter Chubb, +7 authors Gernot Heiser
- Journal of Computer Science and Technology
- 2005

Running device drivers as unprivileged user-level code, encapsulated into their own process, has often been proposed as a technique for increasing system robustness. However, in the past, systemsâ€¦ (More)

- Lisa Patrick, Jessica M. Cable, +10 authors David T Tissue
- Oecologia
- 2006

Global climate models predict that in the next century precipitation in desert regions of the USA will increase, which is anticipated to affect biosphere/atmosphere exchanges of both CO2 and H2O. Inâ€¦ (More)

- Daniel Potts, Gabriele Steidl
- SIAM J. Scientific Computing
- 2003

- Stefan Kunis, Daniel Potts
- SIAM J. Scientific Computing
- 2007

A fast and reliable algorithm for the optimal interpolation of scattered data on the torus Td by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of theâ€¦ (More)

This paper is concerned with the solution of systems of linear equations ANx = b, where fANg N2N denotes a sequence of positive deenite Hermitian ill{conditioned Toeplitz matrices arising from aâ€¦ (More)

- Daniel Potts, Gabriele Steidl, Manfred Tasche
- Math. Comput.
- 1998

Consider the Vandermonde-like matrix P := (Pk(cos jÏ€ N ))j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk , then P coincides with CN+1â€¦ (More)

We show that the polar as well as the pseudo-polar FFT can be computed very accurately and efficiently by the well known nonequispaced FFT. Furthermore, we discuss the reconstruction of a 2d signalâ€¦ (More)

- Daniel Potts, Manfred Tasche
- Signal Processing
- 2010

The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem: Let f be aâ€¦ (More)

Let zj := e fj with fj âˆˆ C and 0 < |zj | â‰¤ 1 be distinct nodes for j = 1, . . . ,M . Let h(x) := c1 e f1 x + . . . + cM e fM x (x â‰¥ 0) be a nonincreasing exponential sum with complex coefficients cjâ€¦ (More)