The QR algorithm for unitary Hessenberg matrices
Journal of Computational and Applied Mathematics
Quadrature formulae of the highest trigonometric degree of accuracy
USSR Computational Mathematics and Mathematical Physics
An implementation of a divide and conquer algorithm for the unitary eigen problem
ACM Transactions on Mathematical Software (TOMS)
Journal of Computational and Applied Mathematics - Special issue on computational complex analysis
On the construction of Szegő polynomials
Journal of Computational and Applied Mathematics - Special issue on computational complex analysis
ACM Transactions on Mathematical Software (TOMS)
On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices
SIAM Journal on Matrix Analysis and Applications
A connection between quadrature formulas on the unit circle and the interval [ - 1,1]
Journal of Computational and Applied Mathematics
A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
SIAM Journal on Matrix Analysis and Applications
Gaussian-type Quadrature Rules for Müntz Systems
SIAM Journal on Scientific Computing
An Error Analysis of a Unitary Hessenberg QR Algorithm
SIAM Journal on Matrix Analysis and Applications
Szegő-Lobatto quadrature rules
Journal of Computational and Applied Mathematics
Eigenvalue computation for unitary rank structured matrices
Journal of Computational and Applied Mathematics
A matrix approach to the computation of quadrature formulas on the unit circle
Applied Numerical Mathematics
Hi-index | 0.09 |
Quadrature rules with maximal even trigonometric degree of exactness are considered. We give a brief historical survey on such quadrature rules. Special attention is given on an approach given by Turetzkii [A.H. Turetzkii, On quadrature formulae that are exact for trigonometric polynomials, East J. Approx. 11 (3) (2005) 337-359. Translation in English from Uchenye Zapiski, Vypusk 1 (149). Seria Math. Theory of Functions, Collection of papers, Izdatel'stvo Belgosuniversiteta imeni V.I. Lenina, Minsk, 1959, pp. 31-54]. The main part of the topic is orthogonal trigonometric systems on [0,2@p) (or on [-@p,@p)) with respect to some weight functions w(x). We prove that the so-called orthogonal trigonometric polynomials of semi-integer degree satisfy a five-term recurrence relation. In particular, we study some cases with symmetric weight functions. Also, we present a numerical method for constructing the corresponding quadratures of Gaussian type. Finally, we give some numerical examples. Also, we compare our method with other available methods.