Back to Search
Start Over
A Newton-type algorithm for solving an extremal constrained interpolation problem.
- Source :
- Numerical Linear Algebra with Applications; Apr/May2000, Vol. 7 Issue 3, p133-146, 14p
- Publication Year :
- 2000
-
Abstract
- Given convex scattered data in R<superscript>3</superscript> we consider the constrained interpolation problem of finding a smooth, minimal L<subscript>p</subscript>-norm (1 < p < ∞) interpolation network that is convex along the edges of an associated triangulation. In previous work the problem has been reduced to the solution of a nonlinear system of equations. In this paper we formulate and analyse a Newton-type algorithm for solving the corresponding type of systems. The correctness of the application of the proposed method is proved and its superlinear (in some cases quadratic) convergence is shown. Copyright © 2000 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10705325
- Volume :
- 7
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Numerical Linear Algebra with Applications
- Publication Type :
- Academic Journal
- Accession number :
- 13440689
- Full Text :
- https://doi.org/10.1002/(SICI)1099-1506(200004/05)7:3<133::AID-NLA190>3.0.CO;2-Y