Discrete Least Squares Approximation by Trigonometric Polynomials
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 741186
- On polynomial approximation in the uniform norm by the discrete least squares method
- On numerical methods for discrete least-squares approximation by trigonometric polynomials
- A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials
- Orthonormal polynomial vectors and least squares approximation for a discrete inner product
Cited in
(40)- Inverse eigenvalue problem of unitary Hessenberg matrices
- Downdating of Szegö polynomials and data-fitting applications
- A parallel algorithm for discrete least squares rational approximation
- Perturbation and interlace theorems for the unitary eigenvalue problem
- Algorithms for robust identification in \({\mathcal H}_\infty\) with nonuniformly spaced frequency response data
- A discrete theory of irregular sampling
- Discrete linearized least-squares rational approximation on the unit circle
- Numerical analysis of non-uniform sampling problem
- Orthonormal rational function vectors
- An analogue for Szegő polynomials of the Clenshaw algorithm
- On the construction of Szegő polynomials
- On an inverse eigenvalue problem for unitary Hessenberg matrices
- Fast scattered data approximation with Neumann and other boundary conditions
- Construction of polynomials that are orthogonal with respect to a discrete bilinear form
- Orthonormal polynomial vectors and least squares approximation for a discrete inner product
- A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials
- A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
- Generation of orthogonal rational functions by procedures for structured matrices
- A modified least squares method: approximations on the unit circle and on (-1,1)
- Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
- Eigenvalue computation for unitary rank structured matrices
- Unitary rank structured matrices
- Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification
- A Levinson-Galerkin algorithm for regularized trigonometric approximation
- A discrete trigonometric interpolation method
- On numerical methods for discrete least-squares approximation by trigonometric polynomials
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
- Irregular sampling, Toeplitz matrices, and the approximation of entire functions of exponential type
- scientific article; zbMATH DE number 741186 (Why is no real title available?)
- Optimally conditioned instrumental variable approach for frequency-domain system identification
- Vector Orthogonal Polynomials and Least Squares Approximation
- The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure
- On generating Sobolev orthogonal polynomials
- Piecewise trigonometric Hermite interpolation
- Complexity reduction of least squares problems involving special Vandermonde matrices
- Constructing Sobolev orthonormal rational functions via an updating procedure
- Sensitivity analysis for Szegő polynomials
- Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
- Spectral transformations for Hermitian Toeplitz matrices
- Uniform approximation by discrete least squares polynomials
This page was built for publication: Discrete Least Squares Approximation by Trigonometric Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359714)
