DC FieldValueLanguage
dc.contributor.authorLampe, Jörg-
dc.contributor.authorVoß, Heinrich-
dc.date.accessioned2019-09-06T10:38:58Z-
dc.date.available2019-09-06T10:38:58Z-
dc.date.issued2012-09-01-
dc.identifier.citationJournal of Computational and Applied Mathematics 1 (238): 95-108 (2013)de_DE
dc.identifier.issn0377-0427de_DE
dc.identifier.urihttp://hdl.handle.net/11420/3324-
dc.description.abstractThe total least squares (TLS) method is a successful approach for linear problems when not only the right-hand side but the system matrix is also contaminated by some noise. For ill-posed TLS problems regularization is necessary to stabilize the computed solution. In this paper we present a new approach for computing an approximate solution of the Tikhonov-regularized large-scale total least-squares problem. An iterative method is proposed which solves a convergent sequence of projected linear systems and thereby builds up a highly suitable search space. The focus is on efficient implementation with particular emphasis on the reuse of information.en
dc.language.isoende_DE
dc.publisherNorth-Hollandde_DE
dc.relation.ispartofJournal of computational and applied mathematicsde_DE
dc.subjectGeneral-form Tikhonov regularizationde_DE
dc.subjectIll-posednessde_DE
dc.subjectTotal least squaresde_DE
dc.subject.ddc510: Mathematikde_DE
dc.titleLarge-scale Tikhonov regularization of total least squaresde_DE
dc.typeArticlede_DE
dc.type.diniarticle-
dc.subject.ddccode510-
dcterms.DCMITypeText-
tuhh.abstract.englishThe total least squares (TLS) method is a successful approach for linear problems when not only the right-hand side but the system matrix is also contaminated by some noise. For ill-posed TLS problems regularization is necessary to stabilize the computed solution. In this paper we present a new approach for computing an approximate solution of the Tikhonov-regularized large-scale total least-squares problem. An iterative method is proposed which solves a convergent sequence of projected linear systems and thereby builds up a highly suitable search space. The focus is on efficient implementation with particular emphasis on the reuse of information.de_DE
tuhh.publisher.doi10.1016/j.cam.2012.08.023-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.type.opus(wissenschaftlicher) Artikel-
tuhh.institute.germanMathematik E-10de
tuhh.institute.englishMathematik E-10de_DE
tuhh.gvk.hasppnfalse-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.issue1de_DE
tuhh.container.volume238de_DE
tuhh.container.startpage95de_DE
tuhh.container.endpage108de_DE
dc.identifier.scopus2-s2.0-84867054471-
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.creatorOrcidLampe, Jörg-
item.creatorOrcidVoß, Heinrich-
item.languageiso639-1en-
item.creatorGNDLampe, Jörg-
item.creatorGNDVoß, Heinrich-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.mappedtypeArticle-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0003-2394-375X-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik (E)-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik (E)-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

183
Last Week
1
Last month
3
checked on Dec 3, 2022

SCOPUSTM   
Citations

24
Last Week
0
Last month
1
checked on Jun 30, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.