Piece wise linear least–squares approximation of planar curves
From MaRDI portal
Publication:3200454
DOI10.1080/00207729008910460zbMath0714.65012OpenAlexW2016505989MaRDI QIDQ3200454
Publication date: 1990
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729008910460
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cites Work
- Unnamed Item
- Numerical methods for solving linear least squares problems
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Characteristic properties of the segmented rational minmax approximation problem
- On the approximation of curves by line segments using dynamic programming
- Polygonal approximation by the minimax method
- A Geometric Method for Approximating Convex Arcs
- Optimal Piecewise Polynomial L2Approximation of Functions of One and Two Variables
- The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
- Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable
- The least squares problem and pseudo-inverses
- Optimal Curve Fitting With Piecewise Linear Functions
This page was built for publication: Piece wise linear least–squares approximation of planar curves