A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight (Q808624): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02481151 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995750471 / rank | |||
Normal rank | |||
Latest revision as of 10:52, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight |
scientific article |
Statements
A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight (English)
0 references
1990
0 references
The authors investigate a class of algorithms for solving a least squares problem with some weight. The presented CR-WLS(k) algorithm is a generalization of the Orthomin(k)-method of conjugate residual type for the linear least squares problem. This generalization is given by an incorporation of some mapping matrix (denoted by B) into the formulas of the Orthomin(k) method. Necessary and sufficient conditions for the convergence of the CR-WLS(k) algorithm are given and some choices of B are discussed so that the convergence conditions are fulfilled.
0 references
conjugate direction
0 references
least squares problem
0 references
CR-WLS(k) algorithm
0 references
Orthomin(k)-method
0 references
convergence
0 references
0 references
