pdf-file, 2.03 Mbyte - Torsten Schütze

Literaturverzeichnis 113
[Mul90] B. Mulansky. Glättung mittels zweidimensionaler Tensorprodukt-Splinefunktionen.
Wiss. Z. Tech. Univ. Dresden, 39:187–190, 1990.
[Mul92] B. Mulansky. Necessary conditions for local best Chebyshev approximations by splines
with free knots. In D. Braess and L. L. Schumaker, editors, Numerical Methods of
Approximation Theory, volume 9 of International Series of Numerical Mathematics,
pages 195–206. Birkhäuser, 1992.
[Mul97] B. Mulansky. Tensor products of convex cones. In G. Nürnberger, J. W. Schmidt,
and G. Walz, editors, Multivariate Approximation and Splines, ISNM, pages 167–176.
Birkhäuser, Basel, 1997.
[Nür96] G. Nürnberger. Bivariate segment approximation and free knot splines: Research problems
96-4. Constr. Approx., 12:555–558, 1996.
[OO88] G. Opfer and H. J. Oberle. The derivation of cubic splines with obstacles by methods
of optimization and optimal control. Numer. Math., 52:17–31, 1988.
[Pai73] C. C. Paige. An error analysis of a method for solving matrix equations. Math. Comp.,
27:355–359, 1973.
[Par85] T. A. Parks. Reducible Nonlinear Programming Problems. PhD thesis, Houston Univ.,
Dept. of Mathematics, Houston, 1985.
[Pig91] T. Pigorsch. Bivariate Quadratmittelapproximation unter Verwendung von Tensorprodukt-B-Splines
im Falle von Rechteckgitterdaten. Diplomarbeit, Martin-Luther-
Universität Halle-Wittenberg, 1991.
[Rei67] C. H. Reinsch. Smoothing by spline functions. Numer. Math., 10:177–183, 1967.
[Rei71] C. H. Reinsch. Smoothing by spline functions II. Numer. Math., 16:451–454, 1971.
[Ric69] J. R. Rice. The Approximation of Functions II. Addison Wesley, Reading, Massachusetts,
1969.
[Rie95] K. S. Riedel. Piecewise convex function estimation and model selection. In C. K. Chui
and L. L. Schumaker, editors, Proc. of Approximation Theory VIII, pages 467–475.
World Scientific Pub., 1995.
[RW80] A. Ruhe and P. Å. Wedin. Algorithms for separable nonlinear least squares problems.
SIAM Rev., 22(3):318–337, 1980.
[Sau72] M. A. Saunders. Large-scale linear programming using the Cholesky factorization.
Technical Report Report No. CS252, Computer Science Dept., Stanford Univ., 1972.
[SB92] Y. W. Soo and D. M. Bates. Loosely coupled nonlinear least squares. Computational
Statistics and Data Analysis, 14:249–259, 1992.
[Sch64] I. J. Schoenberg. On interpolation by spline functions and its minimal properties. In
P. L. Butzer and J. Korevaar, editors, On Approximation Theory, volume 5 of Internat.
Ser. Numer. Math., pages 109–129. Birkhäuser, Basel-Stuttgart, 1964.
[Sch81] L. L. Schumaker. Spline Functions: Basic Theory. John Wiley and Sons, New York,
1981. Reprint Edition by Krieger Publ., 1993.
[Sch90] J. W. Schmidt. Monotone data smoothing by quadratic splines via dualization. Z.
Angew. Math. Mech., 70:299–307, 1990.
[Sch91] H. Schwetlick. Nichtlineare Parameterschätzung: Modelle, Schätzkriterien und numerische
Algorithmen. GAMM-Mitteilungen, 2/91:13–51, 1991.
[Sch92a] J. W. Schmidt. Dual algorithms for solving convex partially separable optimization
problems. Jber. d. Dt. Math.-Verein., 94:40–62, 1992.