Skip to main content
Log in

Block SOR methods for the solution of indefinite least squares problems

  • Published:
Calcolo Aims and scope Submit manuscript

Abstract

This paper describes a technique for constructing block SOR methods for the solution of the large and sparse indefinite least squares problem which involves minimizing a certain type of indefinite quadratic form. Two block SOR-based algorithms and convergence results are presented. The optimum parameters for the methods are also given. It has been shown both theoretically and numerically that the optimum block SOR methods have a faster convergence than block Jacobi and Gauss–Seidel methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Bojanczyk, A., Higham, N.J.: SIAM J. Matrix Anal. Appl. Solving the indefinite least squares problem by hyperbolic QR factorization 24(4), 914–931 (2003)

    MATH  MathSciNet  Google Scholar 

  2. Björck, Å.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)

  3. Chandrasekaran, S., Gu, M., Sayed, A.H.: A stable and efficient algorithm for solving the indefinite linear least-squares problem. SIAM J. Matrix Anal. Appl. 20(2), 354–362 (1998)

    Google Scholar 

  4. Darvishi, M.T., Khani, F., Hamedi-Nezhad, S., Zheng, B.: Symmetric block-SOR methods for rank-deficient least squares problems. J. Comput. Appl. Math. 215, 14–27 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)

  6. Freund, R.: A note on two block SOR methods for sparse least-squares problems. Linear Algebra Appl. 88/89, 211–221 (1987)

    Google Scholar 

  7. Miller, V.A., Neumann, M.: Sucessive overrelaxation methods for solving the rank-deficient least squares problem. Linear Algebra Appl. 88/89, 533–557 (1987)

    Google Scholar 

  8. Niethammer, W., de Pillis, J., Varga, R.S.: Convergence of block iterative methods applied to sparse least squares problems. Linear Algebra Appl. 58, 327–341 (1984)

    Google Scholar 

  9. Santos, C.H., Silva, B.P.B., Yuan, J.Y.: Block SOR methods for rank-deficient least-squares problems. J. Comput. Appl. Math. 100, 1–9 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Zheng, B., Wang, K.: Symmetric successive overrelaxation method for solving the rank deficient linear least squares problem. Appl. Math. Comput. 169, 1305–1323 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)

  12. Young, D.M.: Iterative Solution of Large Linear System. Academic Press New York (1971)

Download references

Acknowledgments

The author would like to thank the anonymous referees for their valuable comments, which greatly improved the exposition of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qiaohua Liu.

Additional information

This work was partially supported by the National Natural Science Foundation of China under grant no. 11001167 and the Key Program of Shanghai Municipal Education Commission under grant no. 12ZZ084.

The research was also supported by a grant of The First-class Discipline of Universities in Shanghai.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Q., Liu, A. Block SOR methods for the solution of indefinite least squares problems. Calcolo 51, 367–379 (2014). https://doi.org/10.1007/s10092-013-0090-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10092-013-0090-8

Keywords

Mathematics Subject Classification

Navigation