Discrete Chebyshev Approximation with Linear Constraints
Copyright policy )Discrete Chebyshev Approximation with Linear Constraints
For overdetermined systems of linear equations subject to linear constraints, the minimum norm solution with respect to the Chebyshev norm is considered. Using the concept of H-sets, characterizations for the solutions are obtained. A Remez-type ascent exchange algorithm is described and analyzed. Numerical examples are given.
overdetermined systems, Numerical solutions to overdetermined systems, pseudoinverses, minimum norm solution, Numerical examples, linear constraints, Best approximation, Chebyshev systems, Approximation with constraints, Chebyshev approximation, H-sets, Remez-type ascent exchange algorithm
overdetermined systems, Numerical solutions to overdetermined systems, pseudoinverses, minimum norm solution, Numerical examples, linear constraints, Best approximation, Chebyshev systems, Approximation with constraints, Chebyshev approximation, H-sets, Remez-type ascent exchange algorithm
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!