scholarly journals Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm

1973 ◽  
Vol 8 (1) ◽  
pp. 46-61 ◽  
Author(s):  
V.P Sreedharan
2010 ◽  
Vol 47 (1) ◽  
pp. 11-22 ◽  
Author(s):  
Krešimir Malarić ◽  
Roman Malarić ◽  
Hrvoje Hegeduš

This paper describes a computer program that finds a function which closely approximates experimental data using the least-squares method. The program finds parameters of the function as well as their corresponding uncertainties. It also has a subroutine for graphical presentation of the input data and the function. The program is used for educational purposes at undergraduate level for students who are learning least-squares fitting, how to solve systems of linear equations and about computer calculation errors.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Xue-Feng Zhang ◽  
Qun-Fa Cui ◽  
Shi-Liang Wu

Three kinds of preconditioners are proposed to accelerate the generalized AOR (GAOR) method for the linear system from the generalized least squares problem. The convergence and comparison results are obtained. The comparison results show that the convergence rate of the preconditioned generalized AOR (PGAOR) methods is better than that of the original GAOR methods. Finally, some numerical results are reported to confirm the validity of the proposed methods.


Sign in / Sign up

Export Citation Format

Share Document