pdf-file, 2.03 Mbyte - Torsten Schütze

Literaturverzeichnis 111
[Eub88] R. L. Eubank. Spline Smoothing and Nonparametric Regression, volume 90 of Statistics,
textbooks and monographs. Marcel Dekker, New York, 1988.
[FF94] D. W. Fausett and C. T. Fulton. Large least squares problems involving Kronecker
products. SIAM J. Matrix Anal. Appl., 15(1):219–227, 1994.
[Fia76] A. V. Fiacco. Sensitivity analysis for nonlinear programming using penalty methods.
Math. Prog., 10:287–311, 1976.
[Fia83] A. V. Fiacco. Introduction to Sensitivity and Stability Analysis in Nonlinear Programming.
Academic Press, 1983.
[FOP91] B. Fischer, G. Opfer, and M. L. Puri. A local algorithm for constructing non-negative
cubic splines. J. Approx. Theory, 64:1–16, 1991.
[GK92] D. M. Gay and L. Kaufman. Tradeoffs in algorithms for separable nonlinear least squares.
In Computational and Applied Mathematics, I. Algorithms and Theory, Selected
Papers IMACS 13th World Congress, Dublin, Ireland, 1991, pages 179–183, 1992.
[GL79] G. H. Golub and R. J. LeVeque. Extensions and uses of the variable projection algorithm
for solving nonlinear least squares problems. In Proc. 1979 Army Numerical Analysis
and Computer Science Conference, Army Research Office, 1979.
[GMSW86] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. User’s guide for NPSOL
(version 4.0): A Fortran package for nonlinear programming. Tech. Report SOL 86-2,
Department of Operations Research, Standford University, 1986.
[GP73] G. H. Golub and V. Pereyra. The differentiation of pseudoinverses and nonlinear least
squares problems whose variables separate. SIAM J. Numer. Anal., 10:413–432, 1973.
[GP76] G. H. Golub and V. Pereyra. Differentiation of pseudoinverses, separable nonlinear
least squares problems and other tales. In M. Nashed, editor, Generalized Inverses and
Applications, pages 303–324. Academic Press, New York, 1976.
[Gra90] A. Grace. Optimization Toolbox User’s Guide. The MathWorks, Inc., 1990.
[Gre91] H. Greiner. A survey on univariate data interploation and approximation by splines of
given shape. Math. Comput. Modelling, 15:97–106, 1991.
[Han92] P. C. Hansen. Analysis of discrete ill-posed problems by means of the L-curve. SIAM
Review, 34(4):561–580, 1992.
[HF79] J. N. Holt and R. Fletcher. An algorithm for constrained nonlinear least squares. J.
Inst. Math. Appl., 23:449–463, 1979.
[HH74] J. G. Hayes and J. Halliday. The least-squares fitting of cubic spline surfaces to general
data sets. J. Inst. Math. Appl., 14:89–103, 1974.
[Hig96] N. J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia,
1996.
[Hor78] U. Hornung. Monotone Spline-Interpolation. In Numerische Methoden der Approximationstheorie,
volume 42 of ISNM, pages 172–191. Birkhäuser, Basel, 1978.
[HS85] C. L. Hu and L. L. Schumaker. Bivariate natural spline smoothing. In G. Meinardus and
G. Nürnberger, editors, Delay Equations, Approximation and Applications, Mannheim
1994, volume 74 of ISNM, pages 165–179. Birkhäuser, 1985.
[HS86] C. L. Hu and L. L. Schumaker. Complete spline smoothing. Numer. Math., 49(1):1–10,
1986.
[Hu93] Y. Hu. An algorithm for data reduction using splines with free knots. IMA J. Numer.
Anal., 13(3):365–381, 1993.