The limit of discretization and weights increasing on nodes

DOI10.1080/00207168508803471zbMATH Open0569.41019OpenAlexW2008127391MaRDI QIDQ3687153FDOQ3687153

Authors: Charles B. Dunham 

Publication date: 1985

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168508803471

Recommendations

• A limit theorem of discretization with weights large on nodes
• Best L 1 -Approximation with Varying Weights
• A Theorem on Weighted L 1 -Approximation
• The limit of approximation with weights large on nodes
• Almost Chebyshev properties for \(L^ 1\)-approximation of continuous functions

zbMATH Keywords

weightweighted approximationChebyshev approximationHaar subspacesLagrange-type interpolation

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by other special function classes (41A30) Best approximation, Chebyshev systems (41A50) Approximation with constraints (41A29)

Cites Work

• A Fortran program for discrete nonlinear Chebyshev approximation
• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
• Title not available (Why is that?)
• The Best Interpolating Approximation is a Limit of Best Weighted Approximations
• A survey of published programs for best approximation

Cited In (5)

• Discretization with interpolating approximation
• Title not available (Why is that?)
• Title not available (Why is that?)
• The limit of approximation with weights large on nodes
• A limit theorem of discretization with weights large on nodes

This page was built for publication: The limit of discretization and weights increasing on nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687153)