Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Trigonometric polynomials"”.

  1. Fast Fourier Methods for Trigonometric Polynomials and Bandlimited Functions

    … from given nonequispaced function evaluations of trigonometric polynomials, or even of bandlimited functions. For this reason, this thesis focuses on the presentation of new efficient inversion methods for the NFFT, which can be realized with the complexity of a single NFFT, and on the …

    qucosa-diss

  2. Optimum Monotonic Step Response Filters

    … filters are expanded in terms of finite duration trigonometric polynomials. The coefficients of the trigonometric polynomials are obtained, for arbitrary frequency penalty functions, by solving a generalized eigenvalue problem. Once the trigonometric polynomial is specified the network can be …

    ucf Repository record for Optimum Monotonic Step Response Filters (opens in a new tab)

  3. Nonequispaced Fast Fourier Transform

    … for fast and accurate evaluation of high degree trigonometric polynomials at many scattered points are presented. Both methods rely on highly localized kernels and the Fast Fourier Transform. The first algorithm uses the function values at uniformly distributed grid points and kernels that …

    south-carolina Repository record for Nonequispaced Fast Fourier Transform (opens in a new tab)

  4. Generating Tight Wavelet Frames From Sums of Squares Representations

    … sums of squares representations for nonnegative trigonometric polynomials. This is done by way of two extension principles which allow us to translate the problem of constructing these frames to one of designing collections of trigonometric polynomials satisfying certain orthogonality and …

    jhu Repository record for Generating Tight Wavelet Frames From Sums of Squares Representations (opens in a new tab)

  5. Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling

    … evaluation and reconstruction of multivariate trigonometric polynomials with frequencies supported on arbitrary index sets of finite cardinality is considered, where rank-1 lattices are used as spatial discretizations. The approximation of multivariate smooth periodic functions by trigonometric …

    qucosa-diss

  6. Design of two-dimensional non-separable filters using semi-definite programming

    … is to exploit the LMI characterisations of trigonometric polynomials to parameterise the SI constraints. First, a domain is described by the positivity of first- or second-order trigonometric polynomials. Using the Chebyshev recursion, the moment matrices are efficiently built. As a result, …

    unsw Repository record for Design of two-dimensional non-separable filters using semi-definite programming (opens in a new tab)

  7. High Dimensional Fast Fourier Transform Based on Rank-1 Lattice Sampling

    We consider multivariate trigonometric polynomials with frequencies supported on a fixed but arbitrary frequency index set I, which is a finite set of integer vectors of length d. Naturally, one is interested in spatial discretizations in the d-dimensional torus such that - the sampling values of …

    qucosa-diss

  8. Algorithms for trigonometric polynomial and rational approximation

    … algorithms for approximating functions by trigonometric polynomials and trigonometric rational functions. We begin by reviewing trigonometric polynomial interpolation and the barycentric formula for trigonometric polynomial interpolation in Chapter 1. Another feature of this chapter is the …

    oxford Repository record for Algorithms for trigonometric polynomial and rational approximation (opens in a new tab)

  9. Topological, geometric, and combinatorial aspects of metric thickenings

    … of the centrally-symmetric version of the trigonometric moment curve. Topological information about metric thickenings allows us to give new generalizations of the Borsuk–Ulam theorem and a selection of its corollaries. Finally, we prove a centrally-symmetric analog of a result of Gilbert …

    colostate Repository record for Topological, geometric, and combinatorial aspects of metric thickenings (opens in a new tab)

  10. Functional calculus and coadjoint orbits.

    … Kirillov character formula, valid for noncentral trigonometric polynomials. This generalises work of Cazzaniga, 1992.

    unsw Repository record for Functional calculus and coadjoint orbits. (opens in a new tab)

  11. Transference and Szego's theorem for measure preserving representations

    … Szeg̈o's theorem concerning approximation by polynomials on the unit circle, and Jensen's inequality involving the summability of the logarithm, for functions in generalized Hardy spaces Hp([gamma],[mu]). The latter are defined in terms of strongly continuous, measure preserving …

    missouri Repository record for Transference and Szego's theorem for measure preserving representations (opens in a new tab)

  12. Spectra of Translation-Invariant Function Algebras of Compact Groups

    … group and let Trig(G) denote the algebra of trigonometric polynomials of G. For a translation-invariant subalgebra A of Trig(G), one can consider the completions of A under the uniform norm and the Fourier norm. We show in Chapter 2 using techniques developed by Gichev that both completions …

    waterloo Repository record for Spectra of Translation-Invariant Function Algebras of Compact Groups (opens in a new tab)

  13. Numerical algorithms for differential equations with periodicity

    … using an algorithm based on approximation by trigonometric polynomials and optimization techniques with exact gradient and exact Hessian matrix. New choreographies in spaces of constant curvature are found.</p> <p>Exponential integrators for solving periodic semilinear stiff PDEs in 1D, 2D and …

    oxford Repository record for Numerical algorithms for differential equations with periodicity (opens in a new tab)

  14. Recognizing human gait by model-driven statistical analysis

    … gait modern is modelled by interpolation of trigonometric-polynomials. In addition, the features based on motion parameters are extracted from the sequence of gait signatures. Then, a <i>k-</i>nearest neighbour classifier and an enhanced back-propagation algorithm is employed to recognize the …

    soton Download PDF for Recognizing human gait by model-driven statistical analysis (opens in a new tab)

  15. On some effective results involving zeros of the Riemann zeta function

    … i.e., a possible pole. A brief discussion on trigonometric polynomials is then conducted, since they make recurring appearances throughout the thesis; they are useful in widening zero-free regions, as well as improving upper bounds on 1/ζ(s). Finally, we turn to the summatory Möbius function M …

    unsw Repository record for On some effective results involving zeros of the Riemann zeta function (opens in a new tab)

  16. Algumas experiências algébricas e gráficas com polinômios trigonométricos

    São muitos os desafios que o ensino e, em especial, o ensino de matemática impõe nos dia de hoje. Nosso trabalho foi elaborado na perspectiva de apresentar a professores e alunos do Ensino Médio uma alternativa para o ensino desses temas. Inicialmente foram elaborados algumas considerações sobre o …

    brazil-ufv Repository record for Algumas experiências algébricas e gráficas com polinômios trigonométricos (opens in a new tab)

  17. Landscapes and discriminants of optimization problems

    … problem. We introduce the discriminant of a trigonometric polynomial and argue for its usefulness in the context of landscape perturbation. We provide upper and lower bounds on the distance to the discriminant. Within this framework, we present homotopy continuation as a novel approach to …

    texas Repository record for Landscapes and discriminants of optimization problems (opens in a new tab)