The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data

Regularization techniques based on the Golub-Kahan iterative bidiagonalization belong among popular approaches for solving large ill-posed problems. First, the original problem is projected onto a lower dimensional subspace using the bidiagonalization algorithm, which by itself represents a form of...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:BIT (Nordisk Tidskrift for Informationsbehandling) Ročník 49; číslo 4; s. 669 - 696
Hlavní autoři: HNETYNKOVA, Iveta, PLESINGER, Martin, STRAKOS, Zdenek
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Netherlands 01.12.2009
Springer
Témata:
ISSN:0006-3835, 1572-9125
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Regularization techniques based on the Golub-Kahan iterative bidiagonalization belong among popular approaches for solving large ill-posed problems. First, the original problem is projected onto a lower dimensional subspace using the bidiagonalization algorithm, which by itself represents a form of regularization by projection. The projected problem, however, inherits a part of the ill-posedness of the original problem, and therefore some form of inner regularization must be applied. Stopping criteria for the whole process are then based on the regularization of the projected (small) problem. In this paper we consider an ill-posed problem with a noisy right-hand side (observation vector), where the noise level is unknown. We show how the information from the Golub-Kahan iterative bidiagonalization can be used for estimating the noise level. Such information can be useful for constructing efficient stopping criteria in solving ill-posed problems.
AbstractList Regularization techniques based on the Golub-Kahan iterative bidiagonalization belong among popular approaches for solving large ill-posed problems. First, the original problem is projected onto a lower dimensional subspace using the bidiagonalization algorithm, which by itself represents a form of regularization by projection. The projected problem, however, inherits a part of the ill-posedness of the original problem, and therefore some form of inner regularization must be applied. Stopping criteria for the whole process are then based on the regularization of the projected (small) problem. In this paper we consider an ill-posed problem with a noisy right-hand side (observation vector), where the noise level is unknown. We show how the information from the Golub-Kahan iterative bidiagonalization can be used for estimating the noise level. Such information can be useful for constructing efficient stopping criteria in solving ill-posed problems.
Author Hnětynková, Iveta
Strakoš, Zdeněk
Plešinger, Martin
Author_xml – sequence: 1
  givenname: Iveta
  surname: HNETYNKOVA
  fullname: HNETYNKOVA, Iveta
  organization: Faculty of Mathematics and Physics, Charles University in Prague, Sokolovská 83, Prague, Czech Republic
– sequence: 2
  givenname: Martin
  surname: PLESINGER
  fullname: PLESINGER, Martin
  organization: Institute of Computer Science, Academy of Sciences, Pod Vodárenskou věží2, Prague, Czech Republic
– sequence: 3
  givenname: Zdenek
  surname: STRAKOS
  fullname: STRAKOS, Zdenek
  organization: Institute of Computer Science, Academy of Sciences, Pod Vodárenskou věží2, Prague, Czech Republic
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22228542$$DView record in Pascal Francis
BookMark eNp9kM1KAzEUhYNUsK0-gLtsXEbz42QmSxGtouBG18NtclMjY0aSaUGfps_SJzO14sJFswmcnO8EvgkZxT4iIaeCnwvO64sseHWpGOeGcakMqw_IWFS1ZEbIakTGnHPNVKOqIzLJ-Y1zabRQY5KeX5EmXCw7SOErxAVF79EOtPd0KE-zvlvO2QO8QqRhwARDWCGdBxdg0UfowldJ-kghujKzwpKUjS0Z-5CRdiXraIibdck2awcDHJNDD13Gk997Sl5ub56v79jj0-z--uqRWSWagdV6bqXWTngunXS11h6V5jVoNI23zoAzrkILvvIWUM2BK22MaEBYqySqKTnb7X5AttD5BNGG3H6k8A7ps5XlNNWlLD2x69nU55zQ_1UEb7dy253ctshtt3LbujD1P8aG4cfEkCB0e0m5I3P5JS4wtW_9MhWTeQ_0Dc7GlCY
CODEN NBITAB
CitedBy_id crossref_primary_10_1137_110832793
crossref_primary_10_1016_j_cam_2020_112786
crossref_primary_10_1088_1361_6420_ab6f42
crossref_primary_10_1002_gamm_202000017
crossref_primary_10_1016_j_cam_2014_06_004
crossref_primary_10_1007_s11228_018_0470_y
crossref_primary_10_1155_2013_129652
crossref_primary_10_1007_s10208_010_9082_0
crossref_primary_10_1137_21M1402066
crossref_primary_10_1002_nbm_3545
crossref_primary_10_1137_140975024
crossref_primary_10_1016_j_apnum_2020_08_021
crossref_primary_10_1016_j_laa_2022_09_020
crossref_primary_10_1016_j_laa_2017_07_031
crossref_primary_10_1007_s11075_019_00865_w
crossref_primary_10_1016_j_apnum_2016_03_006
crossref_primary_10_1007_s11075_012_9612_8
crossref_primary_10_1137_16M1081968
crossref_primary_10_1137_15M1037925
crossref_primary_10_1007_s00211_013_0518_8
crossref_primary_10_1007_s10915_023_02447_4
crossref_primary_10_1137_21M1441420
crossref_primary_10_1088_1361_6420_ab9c45
crossref_primary_10_1137_130945363
crossref_primary_10_1007_s11425_015_0568_4
crossref_primary_10_1016_j_cam_2024_116414
crossref_primary_10_1016_j_laa_2014_07_045
crossref_primary_10_1137_20M1349515
crossref_primary_10_1016_j_jappgeo_2020_103985
crossref_primary_10_4028_www_scientific_net_MSF_952_285
Cites_doi 10.1007/BF01941141
10.1137/0711019
10.1137/S1064827597327309
10.1145/355993.356000
10.1137/S1064827599354147
10.1002/pamm.200610339
10.1017/S096249290626001X
10.1023/A:1021941328858
10.1007/BF02510175
10.1137/0902037
10.1016/j.laa.2004.09.019
10.1007/BF01934265
10.1023/B:NUMA.0000021764.16526.47
10.1016/S0377-0427(00)00414-3
10.1016/0165-1684(90)90158-U
10.1016/j.laa.2006.05.006
10.1023/A:1022383005969
10.1016/0024-3795(80)90167-6
10.1109/83.941854
10.1007/s002110100314
10.2307/2003354
10.1137/040616991
10.1137/S0895479899345960
10.1137/080725167
10.1007/s10543-006-0109-5
10.1137/S1064827594263837
10.1145/355984.355989
10.1137/050645592
10.1002/pamm.200510372
10.1007/s10543-006-0042-7
10.1137/0915028
10.2307/1390722
10.1137/080726021
10.1007/s11075-008-9237-0
10.1137/0702016
10.1007/s00211-007-0078-x
10.6028/jres.049.044
10.1007/978-3-663-11108-5
10.1137/1.9780898719697
10.6028/jres.045.026
10.1088/0266-5611/24/3/034005
10.1007/978-94-017-3552-0_3
10.1090/S0025-5718-1965-0178586-1
10.1007/978-1-4612-5280-1
ContentType Journal Article
Copyright Springer Science + Business Media B.V. 2009
2015 INIST-CNRS
Copyright_xml – notice: Springer Science + Business Media B.V. 2009
– notice: 2015 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1007/s10543-009-0239-7
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Mathematics
Computer Science
EISSN 1572-9125
EndPage 696
ExternalDocumentID 22228542
10_1007_s10543_009_0239_7
GroupedDBID -52
-BR
-~X
1N0
23N
40D
40E
95-
95.
95~
ABDPE
ABMNI
ACIWK
AGWIL
ALMA_UNASSIGNED_HOLDINGS
ASPBG
AVWKF
BBWZM
CAG
COF
CS3
H~9
KOW
N2Q
RHV
SDD
SOJ
TN5
WH7
~EX
AAYXX
CITATION
IQODW
ID FETCH-LOGICAL-c318t-76bc266d1f02d2d766fe3607a6e98fcd9ad9d5ecaf5fcae3ba0369918a1cc32e3
IEDL.DBID RSV
ISICitedReferencesCount 39
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000271948000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0006-3835
IngestDate Wed Apr 02 07:26:55 EDT 2025
Sat Nov 29 03:18:43 EST 2025
Tue Nov 18 22:32:01 EST 2025
Fri Feb 21 02:34:12 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Ill-posed problems
65F10
Noise revealing
15A23
65F22
Lanczos tridiagonalization
15A06
Golub-Kahan iterative bidiagonalization
15A18
Numerical linear algebra
Iterative method
Algorithm
Regularization method
Numerical analysis
ISA06
III-posed problems
Ill posed problem
Regularization
Language English
License http://www.springer.com/tdm
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c318t-76bc266d1f02d2d766fe3607a6e98fcd9ad9d5ecaf5fcae3ba0369918a1cc32e3
PageCount 28
ParticipantIDs pascalfrancis_primary_22228542
crossref_primary_10_1007_s10543_009_0239_7
crossref_citationtrail_10_1007_s10543_009_0239_7
springer_journals_10_1007_s10543_009_0239_7
PublicationCentury 2000
PublicationDate 2009-12-01
PublicationDateYYYYMMDD 2009-12-01
PublicationDate_xml – month: 12
  year: 2009
  text: 2009-12-01
  day: 01
PublicationDecade 2000
PublicationPlace Dordrecht
PublicationPlace_xml – name: Dordrecht
PublicationTitle BIT (Nordisk Tidskrift for Informationsbehandling)
PublicationTitleAbbrev Bit Numer Math
PublicationYear 2009
Publisher Springer Netherlands
Springer
Publisher_xml – name: Springer Netherlands
– name: Springer
References Hnětynková, Strakoš (CR23) 2007; 421
Morozov (CR32) 1966; 7
Fischer (CR11) 1996
Fischer, Freund (CR12) 1994; 15
Calvetti, Reichel, Shuibi (CR6) 2004; 35
Rust (CR46) 2000; 32
Strakoš (CR52) 2009; 51
Hansen, Jensen (CR19) 2008; 31
Cooley, Tukey (CR8) 1965; 19
O’Leary (CR35) 2001; 23
Paige, Saunders (CR42) 1982; 8
Gautschi (CR13) 1981
Meurant, Strakoš (CR31) 2006; 15
Hansen, Kilmer, Kjeldsen (CR20) 2006; 46
Paige (CR38) 1974; 11
Karlin, Shapley (CR26) 1953
Golub, Von Matt (CR15) 1997; 6
Paige, Strakoš (CR43) 2002; 91
Björck, Grimme, Van Dooren (CR2) 1994; 34
Lanczos (CR30) 1950; 45
Calvetti, Golub, Reichel (CR4) 1999; 39
CR47
Hestenes, Stiefel (CR22) 1952; 49
Chung, Nagy, O’Leary (CR7) 2008; 28
Kilmer, O’Leary (CR27) 2001; 22
O’Leary, Simmons (CR36) 1981; 2
Hnětynková, Plešinger, Strakoš (CR24) 2006; 6
Morozov (CR33) 1984
Fierro, Golub, Hansen, O’Leary (CR10) 1997; 18
Hanke (CR16) 2001; 41
Golub, Kahan (CR14) 1965; 2
Kilmer, Hansen, Español (CR28) 2006; 29
Duhamel, Vetterli (CR9) 1990; 19
Jensen, Hansen (CR25) 2007; 47
CR17
Hansen (CR18) 1998
Calvetti, Morigi, Reichel, Sgallari (CR5) 2000; 123
O’Leary, Strakoš, Tichý (CR37) 2007; 107
CR50
Paige, Strakoš, Van Huffel, Lemmerling (CR44) 2002
Saunders (CR48) 1997; 37
Barlow, Bosner, Drmač (CR3) 2005; 397
Hansen, Sørensen, Sükösd, Poulsen (CR21) 2009; 2
Sima, Van Huffel (CR49) 2005; 5
Paige (CR39) 1980; 34
Björck (CR1) 1988; 28
Simon, Zha (CR51) 2000; 21
Nguyen, Milanfar, Golub (CR34) 2001; 10
Paige (CR40) 2009; 31
Paige, Saunders (CR41) 1982; 8
Paige, Strakoš (CR45) 2006; 27
Lanczos (CR29) 1961
D. Calvetti (239_CR6) 2004; 35
C.C. Paige (239_CR41) 1982; 8
Z. Strakoš (239_CR52) 2009; 51
J.W. Cooley (239_CR8) 1965; 19
239_CR47
S. Karlin (239_CR26) 1953
W. Gautschi (239_CR13) 1981
D.P. O’Leary (239_CR36) 1981; 2
D.P. O’Leary (239_CR37) 2007; 107
P.C. Hansen (239_CR18) 1998
C.C. Paige (239_CR43) 2002; 91
M.A. Saunders (239_CR48) 1997; 37
C.C. Paige (239_CR39) 1980; 34
J. Chung (239_CR7) 2008; 28
C.C. Paige (239_CR40) 2009; 31
M.R. Hestenes (239_CR22) 1952; 49
P.C. Hansen (239_CR21) 2009; 2
M.E. Kilmer (239_CR27) 2001; 22
G.H. Golub (239_CR14) 1965; 2
Å. Björck (239_CR2) 1994; 34
T.K. Jensen (239_CR25) 2007; 47
H.D. Simon (239_CR51) 2000; 21
R.D. Fierro (239_CR10) 1997; 18
D. Calvetti (239_CR4) 1999; 39
M. Hanke (239_CR16) 2001; 41
D.P. O’Leary (239_CR35) 2001; 23
C. Lanczos (239_CR30) 1950; 45
B.W. Rust (239_CR46) 2000; 32
D.M. Sima (239_CR49) 2005; 5
M.E. Kilmer (239_CR28) 2006; 29
C.C. Paige (239_CR44) 2002
J.L. Barlow (239_CR3) 2005; 397
Å. Björck (239_CR1) 1988; 28
B. Fischer (239_CR11) 1996
N. Nguyen (239_CR34) 2001; 10
P.C. Hansen (239_CR19) 2008; 31
C.C. Paige (239_CR42) 1982; 8
C.C. Paige (239_CR45) 2006; 27
G.H. Golub (239_CR15) 1997; 6
C.C. Paige (239_CR38) 1974; 11
B. Fischer (239_CR12) 1994; 15
P.C. Hansen (239_CR20) 2006; 46
239_CR50
I. Hnětynková (239_CR24) 2006; 6
P. Duhamel (239_CR9) 1990; 19
239_CR17
D. Calvetti (239_CR5) 2000; 123
V.A. Morozov (239_CR33) 1984
G. Meurant (239_CR31) 2006; 15
I. Hnětynková (239_CR23) 2007; 421
C. Lanczos (239_CR29) 1961
V.A. Morozov (239_CR32) 1966; 7
References_xml – volume: 28
  start-page: 659
  year: 1988
  end-page: 670
  ident: CR1
  article-title: A bidiagonalization algorithm for solving large sparse ill-posed systems of linear equations
  publication-title: BIT
  doi: 10.1007/BF01941141
– year: 1996
  ident: CR11
  publication-title: Polynomial Based Iteration Methods for Symmetric Linear Systems
– volume: 11
  start-page: 197
  year: 1974
  end-page: 209
  ident: CR38
  article-title: Bidiagonalization of matrices and solution of linear equations
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0711019
– year: 1984
  ident: CR33
  publication-title: Methods for Solving Incorrectly Posed Problems
– volume: 31
  start-page: 204
  year: 2008
  end-page: 220
  ident: CR19
  article-title: Noise propagation in regularizing iterations for image deblurring
  publication-title: ETNA
– volume: 7
  start-page: 414
  year: 1966
  end-page: 417
  ident: CR32
  article-title: On the solution of functional equations by the method of regularization (in Russian)
  publication-title: Sov. Math. Dokl.
– volume: 49
  start-page: 409
  year: 1952
  end-page: 435
  ident: CR22
  article-title: Methods of conjugate gradients for solving linear systems
  publication-title: J. Res. Nat. Bur. Stand.
– volume: 45
  start-page: 255
  year: 1950
  end-page: 282
  ident: CR30
  article-title: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
  publication-title: J. Res. Nat. Bur. Stand.
– volume: 21
  start-page: 2257
  year: 2000
  end-page: 2274
  ident: CR51
  article-title: Low-rank matrix approximation using the Lanczos bidiagonalization process with applications
  publication-title: SIAM J. Sci. Stat. Comput.
  doi: 10.1137/S1064827597327309
– year: 1998
  ident: CR18
  publication-title: Rank-Deficient and Discrete Ill-Posed Problems, Numerical Aspects of Linear Inversion
– volume: 8
  start-page: 195
  year: 1982
  end-page: 209
  ident: CR42
  article-title: ALGORITHM 583 LSQR: Sparse Linear equations and least squares problems
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/355993.356000
– volume: 28
  start-page: 149
  year: 2008
  end-page: 167
  ident: CR7
  article-title: A weighted GCV method for Lanczos hybrid regularization
  publication-title: Electron. Trans. Numer. Anal.
– volume: 23
  start-page: 1161
  year: 2001
  end-page: 1171
  ident: CR35
  article-title: Near-optimal parameters for Tikhonov and other regularization methods
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/S1064827599354147
– volume: 6
  start-page: 717
  year: 2006
  end-page: 718
  ident: CR24
  article-title: Lanczos tridiagonalization, Golub-Kahan bidiagonalization and core problem
  publication-title: PAMM
  doi: 10.1002/pamm.200610339
– volume: 15
  start-page: 471
  year: 2006
  end-page: 542
  ident: CR31
  article-title: The Lanczos and conjugate gradient algorithms in finite precision arithmetic
  publication-title: Acta Numer.
  doi: 10.1017/S096249290626001X
– volume: 41
  start-page: 1008
  year: 2001
  end-page: 1018
  ident: CR16
  article-title: On Lanczos based methods for regularization of discrete ill-posed problems
  publication-title: BIT
  doi: 10.1023/A:1021941328858
– volume: 37
  start-page: 96
  year: 1997
  end-page: 104
  ident: CR48
  article-title: Computing projections with LSQR
  publication-title: BIT
  doi: 10.1007/BF02510175
– ident: CR50
– year: 1953
  ident: CR26
  publication-title: Geometry of Moment Spaces
– volume: 2
  start-page: 474
  year: 1981
  end-page: 489
  ident: CR36
  article-title: A bidiagonalization-regularization procedure for large scale discretizations of ill-posed problems
  publication-title: SIAM J. Sci. Stat. Comput.
  doi: 10.1137/0902037
– volume: 397
  start-page: 35
  year: 2005
  end-page: 84
  ident: CR3
  article-title: A new stable bidiagonal reduction algorithm
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2004.09.019
– volume: 34
  start-page: 510
  year: 1994
  end-page: 534
  ident: CR2
  article-title: An implicit shift bidiagonalization algorithm for ill-posed systems
  publication-title: BIT
  doi: 10.1007/BF01934265
– volume: 35
  start-page: 301
  year: 2004
  end-page: 314
  ident: CR6
  article-title: L-curve and curvature bounds for Tikhonov regularization
  publication-title: Numer. Algorithms
  doi: 10.1023/B:NUMA.0000021764.16526.47
– volume: 123
  start-page: 423
  year: 2000
  end-page: 446
  ident: CR5
  article-title: Tikhonov regularization and the L-curve for large discrete ill-posed problems
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/S0377-0427(00)00414-3
– volume: 19
  start-page: 259
  year: 1990
  end-page: 299
  ident: CR9
  article-title: Fast Fourier transforms: A tutorial review and a state of the art
  publication-title: Signal Process.
  doi: 10.1016/0165-1684(90)90158-U
– volume: 421
  start-page: 243
  year: 2007
  end-page: 251
  ident: CR23
  article-title: Lanczos tridiagonalization and core problems
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2006.05.006
– volume: 39
  start-page: 603
  year: 1999
  end-page: 619
  ident: CR4
  article-title: Estimation of the L-curve via Lanczos bidiagonalization
  publication-title: BIT
  doi: 10.1023/A:1022383005969
– volume: 34
  start-page: 235
  year: 1980
  end-page: 258
  ident: CR39
  article-title: Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(80)90167-6
– volume: 10
  start-page: 1299
  year: 2001
  end-page: 1308
  ident: CR34
  article-title: Efficient generalized cross-validation with applications to parametric image restoration and resolution enhancement
  publication-title: IEEE Trans. Image Proces.
  doi: 10.1109/83.941854
– volume: 91
  start-page: 117
  year: 2002
  end-page: 146
  ident: CR43
  article-title: Scaled total least squares fundamentals
  publication-title: Numer. Math.
  doi: 10.1007/s002110100314
– volume: 19
  start-page: 297
  year: 1965
  end-page: 301
  ident: CR8
  article-title: An algorithm for the machine computation of the complex Fourier series
  publication-title: Math. Comput.
  doi: 10.2307/2003354
– volume: 27
  start-page: 861
  year: 2006
  end-page: 875
  ident: CR45
  article-title: Core problem in linear algebraic systems
  publication-title: SIAM J. Matrix Anal. Appl.
  doi: 10.1137/040616991
– ident: CR47
– year: 1961
  ident: CR29
  publication-title: Linear Differential Operators
– volume: 22
  start-page: 1204
  year: 2001
  end-page: 1221
  ident: CR27
  article-title: Choosing regularization parameters in iterative methods for ill-posed problems
  publication-title: SIAM J. Matrix Anal. Appl.
  doi: 10.1137/S0895479899345960
– volume: 31
  start-page: 565
  year: 2009
  end-page: 583
  ident: CR40
  article-title: A useful form of unitary matrix obtained from any sequence of unit 2-norm -vectors
  publication-title: SIAM J. Matrix Anal. Appl.
  doi: 10.1137/080725167
– volume: 47
  start-page: 103
  year: 2007
  end-page: 120
  ident: CR25
  article-title: Iterative regularization with minimum-residual methods
  publication-title: BIT
  doi: 10.1007/s10543-006-0109-5
– volume: 18
  start-page: 1225
  year: 1997
  end-page: 1241
  ident: CR10
  article-title: Regularization by truncated total least squares
  publication-title: SIAM J. Sci. Statist. Comput.
  doi: 10.1137/S1064827594263837
– volume: 8
  start-page: 43
  year: 1982
  end-page: 71
  ident: CR41
  article-title: LSQR: An algorithm for sparse linear equations and sparse least squares
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/355984.355989
– start-page: 72
  year: 1981
  end-page: 147
  ident: CR13
  article-title: Gauss-Christoffel Quadrature Formulae
  publication-title: E.B. Christoffel, Aachen/Monschau, 1979
– volume: 29
  start-page: 315
  year: 2006
  end-page: 330
  ident: CR28
  article-title: A projection-based approach to general form Tikhonov regularization
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/050645592
– start-page: 25
  year: 2002
  end-page: 34
  ident: CR44
  article-title: Unifying least squares, total least squares and data least squares
  publication-title: Total Least Squares and Errors-in-Variables Modeling
– volume: 5
  start-page: 795
  year: 2005
  end-page: 796
  ident: CR49
  article-title: Using core formulations for ill-posed linear systems
  publication-title: PAMM
  doi: 10.1002/pamm.200510372
– volume: 46
  start-page: 41
  year: 2006
  end-page: 59
  ident: CR20
  article-title: Exploiting residual information in the parameter choice for discrete ill-posed problems
  publication-title: BIT
  doi: 10.1007/s10543-006-0042-7
– volume: 15
  start-page: 408
  year: 1994
  end-page: 426
  ident: CR12
  article-title: On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/0915028
– volume: 6
  start-page: 1
  year: 1997
  end-page: 34
  ident: CR15
  article-title: Generalized cross-validation for large scale problems
  publication-title: J. Comput. Graph. Stat.
  doi: 10.2307/1390722
– ident: CR17
– volume: 2
  start-page: 593
  issue: 2
  year: 2009
  end-page: 613
  ident: CR21
  article-title: Reconstruction of single-grain orientation distribution functions for crystalline materials
  publication-title: SIAM J. Image Sci.
  doi: 10.1137/080726021
– volume: 32
  start-page: 333
  year: 2000
  end-page: 347
  ident: CR46
  article-title: Parameter selection for constrained solutions to ill-posed problems
  publication-title: Comput. Sci. Stat.
– volume: 51
  start-page: 363
  year: 2009
  end-page: 376
  ident: CR52
  article-title: Model reduction using the Vorobyev moment problem
  publication-title: Numer. Algorithms
  doi: 10.1007/s11075-008-9237-0
– volume: 2
  start-page: 205
  year: 1965
  end-page: 224
  ident: CR14
  article-title: Calculating the singular values and pseudo-inverse of a matrix
  publication-title: SIAM J. Numer. Anal. Ser. B
  doi: 10.1137/0702016
– volume: 107
  start-page: 147
  year: 2007
  end-page: 174
  ident: CR37
  article-title: On sensitivity of Gauss-Christoffel quadrature
  publication-title: Numer. Math.
  doi: 10.1007/s00211-007-0078-x
– volume: 2
  start-page: 474
  year: 1981
  ident: 239_CR36
  publication-title: SIAM J. Sci. Stat. Comput.
  doi: 10.1137/0902037
– volume: 2
  start-page: 205
  year: 1965
  ident: 239_CR14
  publication-title: SIAM J. Numer. Anal. Ser. B
– volume: 123
  start-page: 423
  year: 2000
  ident: 239_CR5
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/S0377-0427(00)00414-3
– volume: 15
  start-page: 408
  year: 1994
  ident: 239_CR12
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/0915028
– volume: 8
  start-page: 43
  year: 1982
  ident: 239_CR41
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/355984.355989
– volume: 49
  start-page: 409
  year: 1952
  ident: 239_CR22
  publication-title: J. Res. Nat. Bur. Stand.
  doi: 10.6028/jres.049.044
– volume-title: Polynomial Based Iteration Methods for Symmetric Linear Systems
  year: 1996
  ident: 239_CR11
  doi: 10.1007/978-3-663-11108-5
– volume: 39
  start-page: 603
  year: 1999
  ident: 239_CR4
  publication-title: BIT
  doi: 10.1023/A:1022383005969
– volume: 47
  start-page: 103
  year: 2007
  ident: 239_CR25
  publication-title: BIT
  doi: 10.1007/s10543-006-0109-5
– volume-title: Rank-Deficient and Discrete Ill-Posed Problems, Numerical Aspects of Linear Inversion
  year: 1998
  ident: 239_CR18
  doi: 10.1137/1.9780898719697
– volume: 19
  start-page: 259
  year: 1990
  ident: 239_CR9
  publication-title: Signal Process.
  doi: 10.1016/0165-1684(90)90158-U
– volume: 34
  start-page: 235
  year: 1980
  ident: 239_CR39
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(80)90167-6
– volume: 37
  start-page: 96
  year: 1997
  ident: 239_CR48
  publication-title: BIT
  doi: 10.1007/BF02510175
– volume: 45
  start-page: 255
  year: 1950
  ident: 239_CR30
  publication-title: J. Res. Nat. Bur. Stand.
  doi: 10.6028/jres.045.026
– volume: 46
  start-page: 41
  year: 2006
  ident: 239_CR20
  publication-title: BIT
  doi: 10.1007/s10543-006-0042-7
– volume: 28
  start-page: 659
  year: 1988
  ident: 239_CR1
  publication-title: BIT
  doi: 10.1007/BF01941141
– volume: 421
  start-page: 243
  year: 2007
  ident: 239_CR23
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2006.05.006
– volume: 32
  start-page: 333
  year: 2000
  ident: 239_CR46
  publication-title: Comput. Sci. Stat.
– ident: 239_CR47
  doi: 10.1088/0266-5611/24/3/034005
– volume: 11
  start-page: 197
  year: 1974
  ident: 239_CR38
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0711019
– volume: 21
  start-page: 2257
  year: 2000
  ident: 239_CR51
  publication-title: SIAM J. Sci. Stat. Comput.
  doi: 10.1137/S1064827597327309
– start-page: 25
  volume-title: Total Least Squares and Errors-in-Variables Modeling
  year: 2002
  ident: 239_CR44
  doi: 10.1007/978-94-017-3552-0_3
– volume-title: Geometry of Moment Spaces
  year: 1953
  ident: 239_CR26
– volume: 23
  start-page: 1161
  year: 2001
  ident: 239_CR35
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/S1064827599354147
– volume: 397
  start-page: 35
  year: 2005
  ident: 239_CR3
  publication-title: Linear Algebra Appl.
  doi: 10.1016/j.laa.2004.09.019
– volume: 8
  start-page: 195
  year: 1982
  ident: 239_CR42
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/355993.356000
– volume: 2
  start-page: 593
  issue: 2
  year: 2009
  ident: 239_CR21
  publication-title: SIAM J. Image Sci.
  doi: 10.1137/080726021
– ident: 239_CR17
– volume: 91
  start-page: 117
  year: 2002
  ident: 239_CR43
  publication-title: Numer. Math.
  doi: 10.1007/s002110100314
– volume-title: Linear Differential Operators
  year: 1961
  ident: 239_CR29
– volume: 27
  start-page: 861
  year: 2006
  ident: 239_CR45
  publication-title: SIAM J. Matrix Anal. Appl.
  doi: 10.1137/040616991
– volume: 34
  start-page: 510
  year: 1994
  ident: 239_CR2
  publication-title: BIT
  doi: 10.1007/BF01934265
– volume: 29
  start-page: 315
  year: 2006
  ident: 239_CR28
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/050645592
– volume: 31
  start-page: 204
  year: 2008
  ident: 239_CR19
  publication-title: ETNA
– volume: 6
  start-page: 717
  year: 2006
  ident: 239_CR24
  publication-title: PAMM
  doi: 10.1002/pamm.200610339
– volume: 7
  start-page: 414
  year: 1966
  ident: 239_CR32
  publication-title: Sov. Math. Dokl.
– volume: 22
  start-page: 1204
  year: 2001
  ident: 239_CR27
  publication-title: SIAM J. Matrix Anal. Appl.
  doi: 10.1137/S0895479899345960
– volume: 35
  start-page: 301
  year: 2004
  ident: 239_CR6
  publication-title: Numer. Algorithms
  doi: 10.1023/B:NUMA.0000021764.16526.47
– start-page: 72
  volume-title: E.B. Christoffel, Aachen/Monschau, 1979
  year: 1981
  ident: 239_CR13
– volume: 18
  start-page: 1225
  year: 1997
  ident: 239_CR10
  publication-title: SIAM J. Sci. Statist. Comput.
  doi: 10.1137/S1064827594263837
– volume: 28
  start-page: 149
  year: 2008
  ident: 239_CR7
  publication-title: Electron. Trans. Numer. Anal.
– volume: 15
  start-page: 471
  year: 2006
  ident: 239_CR31
  publication-title: Acta Numer.
  doi: 10.1017/S096249290626001X
– ident: 239_CR50
– volume: 6
  start-page: 1
  year: 1997
  ident: 239_CR15
  publication-title: J. Comput. Graph. Stat.
– volume: 10
  start-page: 1299
  year: 2001
  ident: 239_CR34
  publication-title: IEEE Trans. Image Proces.
  doi: 10.1109/83.941854
– volume: 5
  start-page: 795
  year: 2005
  ident: 239_CR49
  publication-title: PAMM
  doi: 10.1002/pamm.200510372
– volume: 107
  start-page: 147
  year: 2007
  ident: 239_CR37
  publication-title: Numer. Math.
  doi: 10.1007/s00211-007-0078-x
– volume: 51
  start-page: 363
  year: 2009
  ident: 239_CR52
  publication-title: Numer. Algorithms
  doi: 10.1007/s11075-008-9237-0
– volume: 31
  start-page: 565
  year: 2009
  ident: 239_CR40
  publication-title: SIAM J. Matrix Anal. Appl.
  doi: 10.1137/080725167
– volume: 19
  start-page: 297
  year: 1965
  ident: 239_CR8
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-1965-0178586-1
– volume-title: Methods for Solving Incorrectly Posed Problems
  year: 1984
  ident: 239_CR33
  doi: 10.1007/978-1-4612-5280-1
– volume: 41
  start-page: 1008
  year: 2001
  ident: 239_CR16
  publication-title: BIT
  doi: 10.1023/A:1021941328858
SSID ssj0029613
ssj0014816
ssj0000615
Score 2.025363
Snippet Regularization techniques based on the Golub-Kahan iterative bidiagonalization belong among popular approaches for solving large ill-posed problems. First, the...
SourceID pascalfrancis
crossref
springer
SourceType Index Database
Enrichment Source
Publisher
StartPage 669
SubjectTerms Computational Mathematics and Numerical Analysis
Exact sciences and technology
Mathematics
Mathematics and Statistics
Numeric Computing
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Sciences and techniques of general use
Title The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
URI https://link.springer.com/article/10.1007/s10543-009-0239-7
Volume 49
WOSCitedRecordID wos000271948000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: Springer Journals
  customDbUrl:
  eissn: 1572-9125
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014816
  issn: 0006-3835
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LTt0wEB0B7YKqgpaCuECRF121shQ7zsPLChWQeAjRh9hFfraRUC5KblnwNXwLX8Y4cW5BfUhla9mOMh7PHNszcwDeMcEMWn5HEyMSKpS3VPvSUIm6JXLuSsb6ROHj4vS0vLiQZzGPuxuj3ccnyd5SP0h2y0RK-8t8nkpaLMIz9HZl4Gs4__ztgfllcwCMWD-gn3j-kjmLxGo5xYNZNj5y_mnyR27q5ZXqUGJ-oLr47c20d0X7q0_6iVewEpEn-TioymtYcM0arEYUSuIe77BpJHoY29bgxcm8uGv3BlpULdL2HPZtfYNfJ0NQCJl6gt3IAWqzpkfqh2rIULQZLSrRNWri9x73D5mfRDWWhAJSKmTE9yObad05chnimEjd3N1i291tiGFdh6_7n77sHdJI3UANGokZLXJt0PVb5hNuuS3y3Ls0TwqVO1l6Y6Wy0mbOKJ95o1yqFXpShKqlYsak3KUbsNRMG7cJBH2rZNYLJjWKTmXaZ5l2iRKpLbTgegLJuFKViXXNA73GZfWrInMQeoVCr4LQq2IC7-dDroaiHv_qvPto-ecjeLg8ywSfwIdxratoALq_T7f1X723YZlHwoqE7cDSrP3p3sJzcz2ru3a3V_x7H2P8uQ
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dThUxEJ4gmKgxoKjxKGIvvNI02Xa7P70kRIRwODGAhrtNf3UTsofsHr3waXgWnszpbvcIUUz0tmm72el05ms78w3AGyaYQcvvaGJEQoXylmpfGipRt0TOXclYnyg8LWaz8uxMfox53N0Y7T4-SfaW-lqyWyZS2l_m81TS4g6sCXRYgTD_-OTzNfPLlgAYsX5AP_H8JXMWC6vlFA9m2fjI-afJb7iphxeqQ4n5odTFb2-mvSva2_ivn3gE6xF5kp1BVR7Dims2YSOiUBL3eIdNY6GHsW0THhwtyV27J9CiapG2r2Hf1j_w62QICiFzT7Ab-YDarOmh-qoaMpA2o0UlukZN_NLj_iHzk6jGkkAgpUJGfD-ymdedI-chjonUzdUltl1dhhjWp_Bp7_3p7j6NpRuoQSOxoEWuDbp-y3zCLbdFnnuX5kmhcidLb6xUVtrMGeUzb5RLtUJPilC1VMyYlLv0Gaw288Y9B4K-VTLrBZMaRacy7bNMu0SJ1BZacD2BZFypykRe81Be47z6xcgchF6h0Ksg9KqYwNvlkIuB1ONvnbdvLP9yBA-XZ5ngE3g3rnUVDUB3-3Qv_qn3a7i3f3o0raYHs8OXcJ_H4hUJ24LVRfvNvYK75vui7trtfhP8BP6f_50
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Jb9QwFH6CghBVRaEUdViKD5xAVmPHWXxEhQHUMqrEot4irzRSlRklA4f-mv6W_rI-J87QikVCXC3bSp6f3-K3fAAvmGAGJb-jiREJFcpbqn1pqETeEjl3JWN9ofBhMZuVx8fyKOKcdmO2-xiSHGoaQpemZrm3sH7vSuFbJlLaP-zzVNLiJtwSIY8-uOufvl4RxWxlDKPdHyyh6IvJnEWQtZyik5aNAc_fbX5NZW0sVIfU8wPsxS_x014tTTf_-4fuw71okZLXAws9gBuu2YLNaJ2SePc7HBoBIMaxLVj_uGr62j2EFlmOtD22fVuf4ZeQIVmEzD3BaeQdcrmmB-pENWRo5oySlugaOfRb7w8MFaFENZaExlIqVMr3K5t53TlyGvKbSN1cnOPYxXnIbd2GL9O3n_ff0wjpQA0KjyUtcm3QJLDMJ9xyW-S5d2meFCp3svTGSmWlzZxRPvNGuVQr1LBowpaKGZNylz6CtWbeuB0gqHMls14wqZF0KtM-y7RLlEhtoQXXE0jGU6tM7HceYDdOq5-dmgPRKyR6FYheFRN4uVqyGJp9_G3y7jVWWK3g4VEtE3wCr8Zzr6Jg6P683eN_mv0c7hy9mVaHH2YHT-Auj5gWCXsKa8v2u3sGt82PZd21u_19uARsxwiQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+regularizing+effect+of+the+Golub-Kahan+iterative+bidiagonalization+and+revealing+the+noise+level+in%C2%A0the%C2%A0data&rft.jtitle=BIT+Numerical+Mathematics&rft.au=Hn%C4%9Btynkov%C3%A1%2C+Iveta&rft.au=Ple%C5%A1inger%2C+Martin&rft.au=Strako%C5%A1%2C+Zden%C4%9Bk&rft.date=2009-12-01&rft.issn=0006-3835&rft.eissn=1572-9125&rft.volume=49&rft.issue=4&rft.spage=669&rft.epage=696&rft_id=info:doi/10.1007%2Fs10543-009-0239-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10543_009_0239_7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0006-3835&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0006-3835&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0006-3835&client=summon