Iterative methods to compute weighted normal pseudosolutions with positive definite weights (Q1280950)
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: Iterative methods to compute weighted normal pseudosolutions with positive definite weights |
scientific article; zbMATH DE number 1262998
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative methods to compute weighted normal pseudosolutions with positive definite weights |
scientific article; zbMATH DE number 1262998 |
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
0 references
0 references
