The best least squares fit L_A to a matrix A in a space L can be useful to improve the rate of convergence of the conjugate gradient method in solving systems Ax=b as well as to define low complexity quasi-Newton algorithms in unconstrained minimization. This is shown in the present paper with new important applications and ideas. Moreover, some theoretical results on the representation and on the computation of L_A are investigated.
DI FIORE, C., Fanelli, S., Zellini, P. (2007). On the best least squares fit to a matrix and its applications. In Ched E. Stedman (a cura di), Algebra and Algebraic Topology (pp. 73-109). Nova Science Publishers, Inc..
On the best least squares fit to a matrix and its applications
DI FIORE, CARMINE;FANELLI, STEFANO;ZELLINI, PAOLO
2007-01-01
Abstract
The best least squares fit L_A to a matrix A in a space L can be useful to improve the rate of convergence of the conjugate gradient method in solving systems Ax=b as well as to define low complexity quasi-Newton algorithms in unconstrained minimization. This is shown in the present paper with new important applications and ideas. Moreover, some theoretical results on the representation and on the computation of L_A are investigated.| File | Dimensione | Formato | |
|---|---|---|---|
|
nova_science.pdf
accesso aperto
Descrizione: Articolo
Dimensione
306.31 kB
Formato
Adobe PDF
|
306.31 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
