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

Résultats de recherche: Contribution à un journalArticleRevue par des pairs

Résumé

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.

langue originaleAnglais
Pages (de - à)48-51
Nombre de pages4
journalJournal of Computational and Applied Mathematics
Volume278
Les DOIs
étatPublié - 15 avr. 2015

Empreinte digitale

Examiner les sujets de recherche de « Equivalence of QN-LS and BQN-LS for affine problems ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation