Pages that link to "Item:Q3127329"

The following pages link to On numerical methods for discrete least-squares approximation by trigonometric polynomials (Q3127329):

Displaying 7 items.

• Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions (Q373942) (← links)
• A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing (Q861809) (← links)
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method (Q1307194) (← links)
• Fast scattered data approximation with Neumann and other boundary conditions (Q1888340) (← links)
• A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations (Q1960252) (← links)
• Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices (Q2253084) (← links)
• Fast QR iterations for unitary plus low rank matrices (Q2288368) (← links)