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

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)48-51
Number of pages4
JournalJournal of Computational and Applied Mathematics
Volume278
DOIs
Publication statusPublished - 15 Apr 2015

Keywords

  • Iterative method
  • Least squares
  • Quasi-Newton method

Fingerprint

Dive into the research topics of 'Equivalence of QN-LS and BQN-LS for affine problems'. Together they form a unique fingerprint.

Cite this