Chebyshev-Weighted Collocation Scheme

• Chebyshev-weighted collocation is a numerical method that uses Chebyshev polynomial bases and associated weight functions to approximate functions and solve differential equations.
• It employs a deterministic Weil grid that clusters nodes optimally near domain endpoints, ensuring spectral (exponential) accuracy and robust convergence.
• The framework adapts to various measures via weighted least squares, providing well-conditioned, stable solutions ideal for high-dimensional surrogate modeling and parametric PDEs.

A Chebyshev-weighted collocation scheme is a class of numerical methods for function approximation, interpolation, and the solution of differential equations, which leverage Chebyshev polynomial bases along with an associated Chebyshev weight function in the design of discrete collocation or projection schemes. Such methods ensure spectral (exponential) accuracy for analytic problems, optimal node clustering near domain endpoints, and improved conditioning. The distinguishing feature is the use of discretizations, quadrature, and norm weightings naturally aligned with the Chebyshev measure, allowing both deterministic and weighted least-squares collocation frameworks. A key example is the deterministic Weil grid collocation developed for multivariate discrete least-squares approximation with rigorous stability and optimal convergence guarantees (Zhou et al., 2014).

1. Chebyshev Polynomial Spaces and Weighted Collocation

Chebyshev-weighted collocation schemes utilize polynomial spaces defined by Chebyshev polynomials $T_k(x)=\cos(k\,\arccos\,x)$ with domain $x\in[-1,1]$, and are orthogonal with respect to the Chebyshev density $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$. In the multivariate case over $\Gamma = [-1,1]^d$, the tensor-product density $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$ is used, with the polynomial basis $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$.

Given a function $f$, the best $L^2_{\rho_c}$-approximation in some finite-dimensional space $$P^\Lambda = \mathrm{span}\{T_\alpha\}_{\alpha\in\Lambda}$$ ($|\Lambda|=N$), is defined by

$x\in[-1,1]$0

In the discrete collocation approach, this $x\in[-1,1]$1 minimization is replaced by weighted or unweighted discrete least squares using carefully chosen collocation nodes $x\in[-1,1]$2, forming the surrogate

$x\in[-1,1]$3

This formulation naturally extends to a weighted least-squares version for general target density $x\in[-1,1]$4 via

$x\in[-1,1]$5

where the weights satisfy $x\in[-1,1]$6 (Zhou et al., 2014).

2. Deterministic Collocation Grids and Weil Construction

An essential advance is the deterministic construction of collocation nodes ($x\in[-1,1]$7 or the "Weil grid") that achieve stability and asymptotic equidistribution with respect to the Chebyshev measure. For a given maximal polynomial degree $x\in[-1,1]$8 and dimension $x\in[-1,1]$9, consider a prime $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$0:

• Set $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$1.
• For $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$2,

$\rho_c(x) = 1/(\pi\sqrt{1-x^2})$3

• The grid $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$4 deterministically samples the Chebyshev measure in $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$5 dimensions (Zhou et al., 2014).

To ensure stability, the number of collocation points must scale quadratically in the basis dimension: $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$6, thus $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$7. This scaling guarantees that the discrete normal matrix $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$8 (where $\rho_c(x) = 1/(\pi\sqrt{1-x^2})$9) is well-conditioned and the normal equations are uniquely solvable.

3. Weighted Least Squares and Measure Correction

The deterministic grid $\Gamma = [-1,1]^d$0 equidistributes asymptotically to the product Chebyshev measure as $\Gamma = [-1,1]^d$1. For density $\Gamma = [-1,1]^d$2 absolutely continuous with respect to $\Gamma = [-1,1]^d$3, the weighted least-squares approach corrects for the difference between desired and Chebyshev measures:

• Weights: $\Gamma = [-1,1]^d$4.
• In particular, for uniform measure $\Gamma = [-1,1]^d$5, $\Gamma = [-1,1]^d$6.

Asymptotic equidistribution (via Weyl's criterion and Weil's estimate) legitimizes this approach: unweighted least squares approximates integration with respect to $\Gamma = [-1,1]^d$7; for any other $\Gamma = [-1,1]^d$8, discrete weights $\Gamma = [-1,1]^d$9 correct the quadrature (Zhou et al., 2014).

4. Stability, Convergence, and Conditioning

The scheme's theoretical foundation is rigorous:

• If $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$0, then the normalized matrix $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$1 satisfies $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$2.
• Therefore, $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$3 is uniformly well-conditioned, guaranteeing robust numerical solvability.
• Convergence: For the continuous Chebyshev projection $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$4 and its discrete surrogate $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$5,

$\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$6

• Extension to more general $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$7 with $\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$8 ensures

$\rho_c(x) = \prod_{j=1}^d \rho_c^j(x_j)$9

These properties remove dependence on probabilistic qualifiers commonly seen in Monte Carlo or random grid approaches (Zhou et al., 2014).

5. Algorithmic Realization

The practical implementation follows these steps:

1. Choose $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$0 smallest prime $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$1.
2. Compute $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$2.
3. For $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$3, evaluate $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$4, $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$5, and weights $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$6 (if necessary).
4. Form the design matrix $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$7 with $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$8 for all multi-indices $T_\alpha(x) = \prod_{j=1}^d T_{\alpha_j}(x_j)$9.
5. Solve the (possibly weighted) normal equations: $f$0; $f$1 is diagonal with $f$2 (or $f$3 if unweighted).
6. Construct the polynomial surrogate $f$4.

The assembly of $f$5 requires $f$6 operations; solving the linear system is $f$7 (Zhou et al., 2014).

6. Extensions and Generalization

The framework naturally generalizes to other orthogonal polynomial bases and measures:

• Any orthonormal system $f$8 under measure $f$9 can be incorporated by using the same deterministic grid $L^2_{\rho_c}$0 and re-weighting via $L^2_{\rho_c}$1.
• The essential property is asymptotic equidistribution of the grid with respect to the desired measure; this forms the basis for weighted least squares in arbitrary orthogonal polynomial spaces.
• For example, Legendre polynomials (uniform $L^2_{\rho_c}$2) use the same collocation nodes with appropriate weights, and convergence estimates analogous to those for Chebyshev bases follow.

The deterministic construction avoids the variability of random sampling, yielding guarantees on conditioning and convergence that are fully deterministic (Zhou et al., 2014).

7. Significance, Limitations, and Applications

The Chebyshev-weighted collocation scheme provides a robust approach for high-dimensional approximation in uncertainty quantification, parametric PDEs, and other multivariate settings where polynomial surrogates are used. Its main advantage is the deterministic, theoretically well-founded construction:

• Avoids probabilistic convergence language and ensures stability for polynomial degrees scaling as $L^2_{\rho_c}$3, with practical algorithms for high-dimensional projection.
• Key applications include surrogate modeling in stochastic problems, sparse grids, and well-conditioned discrete projections for function approximation.
• While the number-theoretic construction leads to a quadratic scaling of collocation points with respect to the basis size, this suggests a tradeoff between stability and sample complexity. Other deterministic grids may further optimize this balance if they also asymptotically equidistribute to the target measure.

These advances, as detailed by Zhou–Narayan–Xu, establish a rigorous, practical, and highly extensible method for polynomial discrete least-squares approximation with Chebyshev-weighted collocation (Zhou et al., 2014).