pdf-file, 2.03 Mbyte - Torsten Schütze

112 Literaturverzeichnis
[Jup75] D. L. B. Jupp. The lethargy theorem – a property of approximation by γ-polynomials.
J. Approx. Theory, 14:204–217, 1975.
[Jup78] D. L. B. Jupp. Approximation to data by splines with free knots. SIAM J. Numer.
Anal., 15(2):328–343, 1978.
[Kau75] L. Kaufman. A variable projection method for solving separable nonlinear least squares
problems. BIT, 15(4):49–57, 1975.
[KP78] L. Kaufman and V. Pereyra. A method for separable nonlinear least squares problems
with separably nonlinear equality constraints. SIAM J. Numer. Anal., 15:12–20, 1978.
[Kra94] R. Kraft. Hierarchical B-splines. Preprint 94-14, Universität Stuttgart, 1994.
[Kro74] F. T. Krogh. Efficient implementation of a variable projection algorithm for nonlinear
least squares problems. Comm. ACM, 17(3):167–169, 1974.
[KS88] A. Kiełbasinski and H. Schwetlick. Numerische Lineare Algebra. Deutscher Verlag der
Wissenschaften, Berlin, 1988.
[KS92] L. Kaufman and G. S. Sylvester. Separable nonlinear least squares with multiple righthand
sides. SIAM J. Matrix Anal. Appl., 13(1):68–89, 1992.
[KSW94] L. Kaufman, G. S. Sylvester, and M. H. Wright. Structured linear least-squares problems
in system identification and separable nonlinear data fitting. SIAM J. Optimization,
4(4):847–871, 1994.
[Kun95] V. Kunert. Ein Algorithmus zur Splineapproximation unter Nebenbedingungen. Manuskript,
1995.
[LH95] C. L. Lawson and R. J. Hanson. Solving Least Squares Problems. SIAM Publications,
Philadelphia, 1995. Reprint of edition by Prentice Hall, 1974.
[LM87] T. Lyche and K. Mørken. Knot removal for parametric B-spline curves and surfaces.
Computer Aided Geometric Design, 4:217–230, 1987.
[LM88] T. Lyche and K. Mørken. A data reduction strategy for splines with applications to
the approximation of functions and data. IMA J. Numer. Anal., 8:185–208, 1988.
[LW91] P. D. Loach and A. J. Wathen. On the best least squares approximation of continuous
functions using linear splines with free knots. IMA J. Numer. Anal., 11(3):393–409,
1991.
[MNSS89] G. Meinardus, G. Nürnberger, M. Sommer, and H. Strauss. Algorithms for piecewise
polynomials and splines with free knots. Math. Comp., 53(187):235–247, 1989.
[MNW96] G. Meinardus, G. Nürnberger, and G. Walz. Bivariate segment approximation and
splines. Adv. in Comput. Math., 6:25–45, 1996.
[MS94] B. Mulansky and J. W. Schmidt. Nonnegative interpolation by biquadratic splines
on refined rectangular grids. In P. J. Laurent, A. Le Méhauté, and L. L. Schumaker,
editors, Wavelets, Images and Surface Fitting, Chamonix 1993, pages 379–386. A K
Peters Wellesley, 1994.
[MSSW85] C. A. Micchelli, P. W. Smith, J. Swetits, and J. D. Ward. Constrained Lp approximation.
Constr. Approx., 1:93–102, 1985.
[MU88] C. A. Micchelli and F. I. Utreras. Smoothing and interpolation in a convex subset of a
Hilbert space. SIAM J. Sci. Stat. Comput., 9(4):728–746, 1988.
[MU91] C. A. Micchelli and F. I. Utreras. Smoothing and interpolation in a convex subset of a
Hilbert space: II. the semi-norm case. Mathematical Modelling and Numerical Analyis,
25(4):425–440, 1991.