Spectral method Created 2026-09-29 Updated 2026-11-05
A spectral method approximates an unknown function by a finite expansion in global basis functions, such as Fourier modes or orthogonal polynomials. A Galerkin method makes the residual orthogonal to the retained trial space; a collocation method instead makes it vanish at selected nodes. The expansion coefficients are the numerical unknowns.
For the -periodic heat equation, a Fourier series truncationgives under Fourier–Galerkin method projection. Each retained mode decays independently, and differentiation becomes multiplication of its coefficient by . This turns a partial differential equation into finitely many ordinary differential equations.
Rapid convergence comes from rapid coefficient decay. If with , the omitted tail has an exponentially small uniform norm bound by a geometric series. Limited smoothness or discontinuities can prevent that rate. A large number of retained modes cannot justify exponential convergence without the needed solution regularity.
Tom H. Koornwinder Created 2026-10-18 Updated 2026-10-24
Institutional biography: dlmf.nist.gov/about/bio/THKoornwinder
Two-node Gaussian quadrature with sine weight Created 2026-10-06 Updated 2026-10-07
For integration against on , the monic quadratic orthogonal polynomial is . Its two roots are the Gaussian quadrature nodes , with weights one. The rule integrates every cubic exactly: divide it by the orthogonal quadratic and integrate the degree-one remainder.
Vandermonde determinant invariance under monic basis change Created 2026-10-07 Updated 2026-11-05
Evaluating arbitrary monic polynomials of successive degrees gives the same determinant as evaluating the monomials of those degrees. The basis-change matrix is triangular with diagonal entries one, so its determinant is one. This permits an orthogonal polynomial basis to replace the monomials in eigenvalue densities.
William P. Reinhardt Created 2026-10-13 Updated 2026-11-05
A credited contributor to Chapters 1 and 18 of the NIST Digital Library of Mathematical Functions, treating algebraic and analytic methods and orthogonal polynomials. These credits refer to the named chapters, rather than the whole reference.[ref]
1 Algebraic and Analytic Methods. author attribution and the named work’s subject
Zernike polynomials 2026-10-14
The real Zernike polynomials form an orthogonal polynomial basis on the unit Euclidean disk, with radial factor and angular factor or . Here and is even. They decompose wavefront errors into modes useful for optical correction. Normalizations differ, so coefficients should specify the chosen convention.
Zeros of orthogonal polynomials Created 2026-09-24 Updated 2026-11-05
A real degree- orthogonal polynomial for a positive weight on an interval, with the required finite moments, has exactly distinct simple zeros in the interval's interior. This places the quadrature nodes of Gaussian quadrature inside its integration domain.[ref]
To prove it, list the distinct interior roots where the polynomial changes sign, and let be the product of their linear factors. Then has one constant sign on the interval and is not identically zero. If there were fewer than sign-changing roots, would have lower polynomial degree, so orthogonality would give , contradicting positivity of the integral after a choice of sign. There must therefore be such roots. They exhaust the polynomial degree, proving both simplicity and the absence of additional roots.
