Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm

DOI10.1007/BF02252193zbMath0435.65010OpenAlexW359883005MaRDI QIDQ1140398

Ludwig J. Cromme

Publication date: 1978

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02252193

zbMATH Keywords

algorithmsnumerical examplesdirect methodsiterative refinementnumerical instabilitiesaccumulation of round-off errorseffective and inexpensive testslinear approximation problemsrevised dual simplex algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Best approximation, Chebyshev systems (41A50) Roundoff error (65G50) Algorithms for approximation of functions (65D15) Approximation by arbitrary linear expressions (41A45)

Related Items (1)

Clusterwise linear regression

Cites Work

• On alternation numbers in nonlinear Chebyshev approximation
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm