Iterative methods to compute weighted normal pseudosolutions with positive definite weights (Q1280950): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q587825 |
||
| Property / reviewed by | |||
| Property / reviewed by: Horst Hollatz / rank | |||
Revision as of 11:17, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative methods to compute weighted normal pseudosolutions with positive definite weights |
scientific article |
Statements
Iterative methods to compute weighted normal pseudosolutions with positive definite weights (English)
0 references
5 May 1999
0 references
Two iterative methods to compute the weighted normal pseudosolution for a linear system with an arbitrary rectangular real matrix are constructed and proved that the convergence is linear. The first process requires finding the maximum and minimum nonzero eigenvalue of a symmetrizable positive semidefinite matrix. The second process requires inverting a symmetrizable positive matrix.
0 references
pseudosolution
0 references
least squares solution
0 references
pseudoinverse matrix
0 references
iterative methods
0 references
convergence
0 references
weighted normal pseudosolution
0 references
