Results 41 to 50 of about 31,688 (173)
Identities Involving Zeros of Ramanujan and Shanks Cubic Polynomials [PDF]
, 2014 In this paper we highlight the connection between Ramanujan cubic polynomials (RCPs) and a class of polynomials, the Shanks cubic polynomials (SCPs), which generate cyclic cubic fields.
Abrate, Marco +3 more
core
A Simple Proof of the Classification of Normal Toeplitz Matrices
, 2002 We give an easy proof to show that every complex normal Toeplitz matrix is classified as either of type I or of type II. Instead of difference equations on elements in the matrix used in past studies, polynomial equations with coefficients of elements ...
Arimoto, Akio
core +1 more source
Piecewise quadratic trigonometric polynomial curves [PDF]
Mathematics of Computation, 2003 Summary: Analogous to the quadratic B-spline curve, a piecewise quadratic trigonometric polynomial curve is presented. The quadratic trigonometric polynomial curve has \(C^2\) continuity, while the quadratic B-spline curve has \(C^1\) continuity. The quadratic trigonometric polynomial curve is closer to the given control polygon than the quadratic B ...
openaire +1 more source
, 2005 The analytic solutions of the one-dimensional Schroedinger equation for the trigonometric Rosen-Morse potential reported in the literature rely upon the Jacobi polynomials with complex indices and complex arguments.
+14 more
core +1 more source
On osculatory interpolation by trigonometric polynomials
International Journal of Mathematics and Mathematical Sciences, 1979 A short and simple proof is given that osculatory interpolation by trigonometric polynomials is always possible.
D. J. Newman, L. A. Rubel
doaj +1 more source
Alternating trigonometric polynomials
Journal of Approximation Theory, 1987 Set \(t_ k=h_ n+\{k\pi /(n+1)\}\), \(k=0,1,...,2n+1\), \(0\leq h_ ...
openaire +2 more sources
Quantifier Elimination for Trigonometric Polynomials by Cylindrical Trigonometric Decomposition
Journal of Symbolic Computation, 2000 The authors present a quantifier elimination algorithm for some first-order formulas involving the trigonometric functions sine and cosine based on the cylindrical algebraic decomposition of semi-algebraic sets due to Collin (see \textit{G. E. Collins}, Lect. Notes Comput. Sci. 33, 134-183 (1975; Zbl 0318.02051)).
Pau, Petru, Schicho, Josef
openaire +2 more sources
Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions [PDF]
Polynomials, trigonometric polynomials, and rational functions are widely used for the discrete approximation of functions or simulation models.Often, it is known beforehand, that the underlying unknown function has certain properties, e.g.
Hertog, D. den +2 more
core +1 more source
Bounding Multivariate Trigonometric Polynomials
IEEE Transactions on Signal Processing, 2019 The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop simple and efficiently computable estimates of the extremal values of a multivariate trigonometric polynomial directly ...
Luke Pfister, Yoram Bresler
openaire +1 more source
Inequalities for trigonometric polynomials
Journal of Approximation Theory, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Department of Mathematics, University of Florida, Gainesville, Florida 32611, U.S.A. ( host institution ) +1 more
openaire +2 more sources