Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem (Q2571978)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem |
scientific article; zbMATH DE number 2228853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem |
scientific article; zbMATH DE number 2228853 |
Statements
Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem (English)
0 references
14 November 2005
0 references
Symmetric successive overrelaxation methods (SSOR) are introduced to compute the least squares solution bf minimum norm to linear systems of algebraic equations. The problem is first augmented to a block \(4\times 4\) consistent system, and then subproper SSOR splitting is used. It is shown that the iteration is semiconvergent in an interval of the relaxation parameter. A numerical example is presented to illustrate the procedure.
0 references
SSOR method
0 references
Subproper splitting
0 references
Least squares solution of minimal norm
0 references
iterative method
0 references
semiconvergence
0 references
symmetric successive overrelaxation
0 references
numerical example
0 references
0 references
0 references
0.9552201628684998
0 references
0.9203335046768188
0 references
0.9040138721466064
0 references
0.892169177532196
0 references