liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Methods for large scale total least squares problems
Linköpings universitet, Matematiska institutionen, Beräkningsvetenskap. Linköpings universitet, Tekniska högskolan.
Department of Informatics, University of Bergen, NO-5020 Bergen, Norway.
2001 (engelsk)Inngår i: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 22, nr 2, s. 413-429Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

The solution of the total least squares (TLS) problems, minE,f ?(E,f)?F subject to (A + E)x = b + f, can in the generic case be obtained from the right singular vector corresponding to the smallest singular value sn+1 of (A, b). When A is large and sparse (or structured) a method based on Rayleigh quotient iteration (RQI) has been suggested by Björck. In this method the problem is reduced to the solution of a sequence of symmetric, positive definite linear systems of the form (ATA - s¯2I)z = g, where s¯ is an approximation to sn+1. These linear systems are then solved by a preconditioned conjugate gradient method (PCGTLS). For TLS problems where A is large and sparse a (possibly incomplete) Cholesky factor of AT A can usually be computed, and this provides a very efficient preconditioner. The resulting method can be used to solve a much wider range of problems than it is possible to solve by using Lanczos-type algorithms directly for the singular value problem. In this paper the RQI-PCGTLS method is further developed, and the choice of initial approximation and termination criteria are discussed. Numerical results confirm that the given algorithm achieves rapid convergence and good accuracy.

sted, utgiver, år, opplag, sider
2001. Vol. 22, nr 2, s. 413-429
Emneord [en]
Conjugate gradient method, Rayleigh quotient iteration, Singular values, Total least squares
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-47174DOI: 10.1137/S0895479899355414OAI: oai:DiVA.org:liu-47174DiVA, id: diva2:268070
Tilgjengelig fra: 2009-10-11 Laget: 2009-10-11 Sist oppdatert: 2017-12-13

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Björck, Åke

Søk i DiVA

Av forfatter/redaktør
Björck, Åke
Av organisasjonen
I samme tidsskrift
SIAM Journal on Matrix Analysis and Applications

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 366 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf