Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
type: Item
instance of: scholarly article
title: Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
zbMATH Open document ID: 0287.65031
DOI: 10.1016/0021-9045(73)90030-0
author: V. P. Sreedharan
published in: Journal of Approximation Theory
publication date: 1973-01-01T00:00:00Z
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65D10
zbMATH DE Number: 3451379
MaRDI profile type: Publication
full work available at URL: 0021-9045(73)90030-0
OpenAlex ID: W2076360830
cites work: Q3250836
cites work: Q5543004
cites work: The Lawson Algorithm and Extensions
cites work: Solutions of overdetermined linear equations which minimize error in an abstract norm
cites work: Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
description: scientific article; zbMATH DE number 3451379