In the first part of this paper we apply a saddle point theorem from convex analysis to show that various constrained minimization problems are equivalent to the problem of smoothing by spline functions. In particular, we show that near-interpolants are smoothing splines with weights that arise as Lagrange multipliers corresponding to the constraints in the problem of near-interpolation. In the second part of this paper we apply certain fixed point iterations to compute these weights. A similar iteration is applied to the computation of the smoothing parameter in the problem of smoothing.
This journal, begun in 1943 as Mathematical Tables and Other Aids to Computation, publishes original articles on all aspects of numerical mathematics, book reviews, mathematical tables, and technical notes. It is devoted to advances in numerical analysis, the application of computational methods, high speed calculating, and other aids to computation.
Founded in 1888, to further mathematical research and scholarship, the 30,000-member American Mathematical Society provides programs and services that promote mathematical research and its uses, strengthen mathematical education, and foster awareness and appreciation of mathematics and its connections to other disciplines and everyday life. The headquarters of the AMS are in Providence, Rhode Island. The Society also maintains a government relations office in Washington, D.C., the Mathematical Reviews editorial office in Ann Arbor, Michigan, and a warehouse and distribution facility in Pawtucket, Rhode Island. The Society has approximately 240 employees.
This item is part of a JSTOR Collection.
For terms and use, please refer to our
Mathematics of Computation
© 2003 American Mathematical Society
