CXFTV2: a Fortran subroutine for the discrete least squares convex approximation. A Fortran subroutine calculates the least squares approximation to n data values containing random errors subject to nonnegative second divided differences (convexity). The method employs a dual active set quadratic programming technique that allows several concavities of an iterate to be corrected simultaneously, which is a distinctive feature of this calculation. A B-spline representation of the iterates reduces each active set calculation to an unconstrained minimization with fewer variables that requires only O(n) computer operations. Details of these techniques including the data structure that establishes the implementation of the method are specified. Numerical testing on a variety of data sets indicates that the subroutine is particularly efficient, terminating after a small number of active set changes, the subroutine being suitable for large numbers of data. A numerical example and its output is provided to help the use of the software. (Source: http://cpc.cs.qub.ac.uk/summaries/)
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Demetriou, I.C.: L2CXCV: a Fortran 77 package for least squares convex/concave data smoothing (2006) ioport
- Demetriou, I.C.: Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity (2002)
- Demetriou, I.C.: CXFTV2: A Fortran subroutine for the discrete least squares convex approximation (1997)