Nonlinear approximation problems in vector norms

Anderson, D H and M R Osborne (1976). Discrete, linear approximation problems in polyhedral norms, Num. Math. 26, 179–189.
Article MathSciNet MATH Google Scholar
Anderson, D H and M R Osborne (1977a). Discrete, non-linear approximation problems in polyhedral norms, Num. Math. 28, 143–156.
Article MathSciNet MATH Google Scholar
Anderson, D H and M R Osborne (1977b). Discrete, non-linear approximation problems in polyhedral norms: a Levenberg-like algorithm. Num. Math. 28, 157–170.
Article MathSciNet MATH Google Scholar
Barrodale, I and F D K Roberts (1973). An improved algorithm for discrete ℓ₁ linear approximation, SIAMJ Num. Anal. 10, 839–848.
Article MathSciNet MATH Google Scholar
Bartels, R H, A R Conn and J W Sinclair (1977). Minimisation techniques for piecewise differentiable functions — the ℓ₁ solution to an over-determined linear system, SIAMJ Num. Anal. (to appear).
Google Scholar
Cheney, E W (1966). Introduction to Approximation Theory, McGraw-Hill, New York.
MATH Google Scholar
Cline, A K (1976). A descent method for the uniform solution to overdetermined systems of linear equations, SIAMJ Num. Anal. 13, 293–309.
Article MathSciNet MATH Google Scholar
Fletcher, R, J A Grant and M D Hebden (1971). The calculation of linear best L_p approximations, Computer J. 14, 276–279.
Article MathSciNet MATH Google Scholar
Kelley, J E (Jr) (1958). An application of linear programming to curve fitting, SIAMJ 6, 15–22.
MathSciNet MATH Google Scholar
Madsen, K (1975). An algorithm for minimax solutions of overdetermined systems of non-linear equations, JIMA 16, 321–328.
MathSciNet MATH Google Scholar
Osborne, M R (1972). An algorithm for discrete, non-linear best approximation Problems: In: Numerische Methoden der Approximationstheorie, Band 1, eds. L Collatz and G Meinardus. Birkhauser-Verlag.
Google Scholar
Osborne, M R (1977). Nonlinear least squares — the Levenberg algorithm revisited, J. Aust. Math. Soc., Series B (to appear).
Google Scholar
Osborne, M R and G A Watson (1969). An algorithm for minimax approximation in the non-linear case, Computer J. 12, 64–69.
MathSciNet MATH Google Scholar
Osborne, M R and G A Watson (1971). On an algorithm for non-linear L₁ approximation, Computer J. 14, 184–188.
Article MathSciNet MATH Google Scholar
Rockafellar, R T (1970). Convex Analysis, Princeton, New Jersey. Princeton Univ. Press.
Book MATH Google Scholar
Stiefel, E L (1959). Über diskrete und lineare Tschebyscheff-Approximationen, Num. Math. 1, 1–28.
Article MathSciNet MATH Google Scholar
Watson, G A (1974). The calculation of best restricted approximations, SIAMJ Num. Anal. 11, 693–699.
Article MathSciNet MATH Google Scholar

Download references

Authors

M R Osborne
View author publications
You can also search for this author in PubMed Google Scholar
G A Watson
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

G. A. Watson

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Osborne, M.R., Watson, G.A. (1978). Nonlinear approximation problems in vector norms. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067701

Download citation

DOI: https://doi.org/10.1007/BFb0067701
Published: 27 August 2006
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08538-6
Online ISBN: 978-3-540-35972-2
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Nonlinear approximation problems in vector norms

Access this chapter

Preview

References