Equivalence of QN-LS and BQN-LS for affine problems

Onderzoeksoutput: Bijdrage aan een tijdschriftArtikelpeer review

Samenvatting

Previously, we studied methods to solve the coupled system of non-linear equations F(g)=p and S(p)=g. In this paper we take a closer look at two of them, the Quasi-Newton method with Least Squares Jacobian (QN-LS) and the Block Quasi-Newton method with Least Squares Jacobian (BQN-LS). We show that both are algebraically equivalent if one of the operators (F or S) is affine. This implies that for this type of problem there is no reason to use BQN-LS, as the results will be the same but for a higher computational cost.

Originele taal-2Engels
Pagina's (van-tot)48-51
Aantal pagina's4
TijdschriftJournal of Computational and Applied Mathematics
Volume278
DOI's
StatusGepubliceerd - 15 apr. 2015

Vingerafdruk

Duik in de onderzoeksthema's van 'Equivalence of QN-LS and BQN-LS for affine problems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit