An improved Newton iteration for the weighted Moore-Penrose inverse (Q2489382): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.05.050 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021695995 / rank | |||
Normal rank | |||
Revision as of 03:14, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved Newton iteration for the weighted Moore-Penrose inverse |
scientific article |
Statements
An improved Newton iteration for the weighted Moore-Penrose inverse (English)
0 references
16 May 2006
0 references
The authors first give a convergence result of the classical Newton iteration for computing the weighted Moore-Penrose pseudoinverse of an arbitrary matrix. Then, they propose two algorithms for accelerating convergence and analyse their efficiency on some numerical experiments.
0 references
Newton iteration
0 references
weighted Moore-Penrose inverse
0 references
weighted singular value decomposition
0 references
convergence acceleration
0 references
algorithms
0 references
numerical experiments
0 references
