recently, in order to increase the efficiency of least squares method in numerical solution of ill-posed problems, the chain least squares method is presented in a recurrent process by babolian et al. despite the fact that the given method has many advantages in terms of accuracy and stability, it does not have any stopping criterion and has high computational cost. in this article, the attempt...

Latin squares of order n exist for each n ≥ 1. There are severalways of constructing Latin squares. Also for n≥ 2, if the number of reduced Latin squares isknown, then the number of general Latin squares canbecalculated. This paperproposed a generalmethod to constructsymmetric Latin squares of orderq by using blocks of order q which have the basic property of a recursivealgorithmwith the use of...

In this note, we present two results on the scaled total least squares problem. First, we discuss the relation between the scaled total least squares and the least squares problems. We derive an upper bound for the difference between the scaled total least squares solution and the least squares solution and establish a quantitative relation between the scaled total least squares residual and th...