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
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
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
## 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