Iterative refinement of least squares solutions computed from normal equations
Mathematica Applicanda (1989)
- Volume: 17, Issue: 31
- ISSN: 1730-2668
Access Full Article
top
Abstract
topHow to cite
topAndrzej Kiełbasiński. "Iterative refinement of least squares solutions computed from normal equations." Mathematica Applicanda 17.31 (1989): null. <http://eudml.org/doc/293170>.
@article{AndrzejKiełbasiński1989,
abstract = {It is shown that iterative refinement (using normal equations and exclusively standard floating point arithmetic with relative precision v) yields almost full accuracy of computed solution to regular linear least squares problem, provided some conditions.},
author = {Andrzej Kiełbasiński},
journal = {Mathematica Applicanda},
keywords = {Iterative methods for linear systems},
language = {eng},
number = {31},
pages = {null},
title = {Iterative refinement of least squares solutions computed from normal equations},
url = {http://eudml.org/doc/293170},
volume = {17},
year = {1989},
}
TY - JOUR
AU - Andrzej Kiełbasiński
TI - Iterative refinement of least squares solutions computed from normal equations
JO - Mathematica Applicanda
PY - 1989
VL - 17
IS - 31
SP - null
AB - It is shown that iterative refinement (using normal equations and exclusively standard floating point arithmetic with relative precision v) yields almost full accuracy of computed solution to regular linear least squares problem, provided some conditions.
LA - eng
KW - Iterative methods for linear systems
UR - http://eudml.org/doc/293170
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.