Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?

1989 ◽  
Vol 26 (3) ◽  
pp. 693-726 ◽  
Author(s):  
Richard H. Bartels ◽  
Andrew R. Conn ◽  
Yuying Li
1978 ◽  
Vol 15 (2) ◽  
pp. 255-270 ◽  
Author(s):  
Richard H. Bartels ◽  
Andrew R. Conn ◽  
Christakis Charalambous

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
S. S. Askar ◽  
A. A. Karawia

Many authors have studied numerical algorithms for solving the linear systems of pentadiagonal type. The well-known fast pentadiagonal system solver algorithm is an example of such algorithms. The current paper describes new numerical and symbolic algorithms for solving pentadiagonal linear systems via transformations. The proposed algorithms generalize the algorithms presented in El-Mikkawy and Atlan, 2014. Our symbolic algorithms remove the cases where the numerical algorithms fail. The computational cost of our algorithms is better than those algorithms in literature. Some examples are given in order to illustrate the effectiveness of the proposed algorithms. All experiments are carried out on a computer with the aid of programs written in MATLAB.


2009 ◽  
Vol 1 (2) ◽  
pp. 1-20 ◽  
Author(s):  
Venkatesan Guruswami ◽  
Prasad Raghavendra

2010 ◽  
Vol 07 (04) ◽  
pp. 525-537 ◽  
Author(s):  
PHAM KY ANH ◽  
VU TIEN DUNG

In this paper, we study the performance of some parallel iterative regularization methods for solving large overdetermined systems of linear equations.


Sign in / Sign up

Export Citation Format

Share Document