Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.88, Iss.1, 2011-01, pp. : 6-20

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On an iterative method for solving the least squares problem of rank-deficient systems

International Journal of Computer Mathematics, Vol. 92, Iss. 3, 2015-03 ,pp. : 532-541

Taylor & Francis Ltd

Access to resources Recommend Favorite

Regularization Methods for Uniformly Rank-Deficient Nonlinear Least-Squares Problems

By Eriksson J. Wedin P. Gulliksson M. Söderkvist I.

Journal of Optimization Theory and Applications, Vol. 127, Iss. 1, 2005-10 ,pp. : 1-26

Springer Publishing Company

Access to resources Recommend Favorite

Chebyshev acceleration for SOR-like method

By Li Zheng

International Journal of Computer Mathematics, Vol. 82, Iss. 5, 2005-05 ,pp. : 583-593

Taylor & Francis Ltd

Access to resources Recommend Favorite

KKT Conditions for Rank-Deficient Nonlinear Least-Square Problems with Rank-Deficient Nonlinear Constraints

By Gulliksson M.

Journal of Optimization Theory and Applications, Vol. 100, Iss. 1, 1999-01 ,pp. : 145-160

Springer Publishing Company

Access to resources Recommend Favorite

The Use of Chebyshev Polynomials in the Space–Time Least-Squares Spectral Element Method

By De Maerschalck Bart Gerritsma Marc

Numerical Algorithms, Vol. 38, Iss. 1, 2005-03 ,pp. : 173-196

Springer Publishing Company

Access to resources Recommend Favorite