Deakin University
Browse
beliakov-monsplines-2000.pdf (145.67 kB)

Shape preserving approximation using least squares splines

Download (145.67 kB)
journal contribution
posted on 2000-12-01, 00:00 authored by Gleb BeliakovGleb Beliakov
Least squares polynomial splines are an effective tool for data fitting, but they may fail to preserve essential properties of the underlying function, such as monotonicity or convexity. The shape restrictions are translated into linear inequality conditions on spline coefficients. The basis functions are selected in such a way that these conditions take a simple form, and the problem becomes non-negative least squares problem, for which effecitive and robust methods of solution exist. Multidimensional monotone approximation is achieved by using tensor-product splines with the appropriate restrictions. Additional inter polation conditions can also be introduced. The conversion formulas to traditional B-spline representation are provided.

History

Journal

Analysis in theory and applications

Volume

16

Issue

4

Pagination

80 - 98

Publisher

Editorial Board of Analysis in Theory and Applications, Kluwer Academic Publishers

Location

Dordrecht, The Netherlands

ISSN

1672-4070

eISSN

1573-8175

Language

eng

Notes

The original publication can be found at www.springerlink.com

Publication classification

C1.1 Refereed article in a scholarly journal; C Journal article

Copyright notice

2000, Springer

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC