๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Numerical methods for generalized least squares problems

โœ Scribed by Jin Yun Yuan


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
606 KB
Volume
66
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


LEAST-SQUARES SOLUTIONS OF A GENERAL NUM
โœ ROY S. BATY; WALTER P. WOLFE ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 338 KB ๐Ÿ‘ 3 views

This article describes a computational method to calculate solutions of elliptic boundary value problems using arbitrary irregular grids. The main feature of the numerical method is its ability to approximate solutions of differential equations without co-ordinate mapping or metric tensor informatio

Symmetric block-SOR methods for rank-def
โœ M.T. Darvishi; F. Khani; S. Hamedi-Nezhad; B. Zheng ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

In this article, we develop symmetric block successive overrelaxation (S-block-SOR) methods for finding the solution of the rank-deficient least squares problems. We propose an S2-block-SOR and an S3-block-SOR method for solving such problems and the convergence of these two methods is studied. The

Preconditioned GAOR methods for solving
โœ Xiaoxia Zhou; Yongzhong Song; Li Wang; Qingsheng Liu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 462 KB

## a b s t r a c t In this paper, we present the preconditioned generalized accelerated overrelaxation (GAOR) method for solving linear systems based on a class of weighted linear least square problems. Two kinds of preconditioning are proposed, and each one contains three preconditioners. We comp