{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T13:41:28Z","timestamp":1680270088827},"reference-count":32,"publisher":"Walter de Gruyter GmbH","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We give a factorization formula to least-squares projection schemes, from which new convergence conditions together with formulas estimating the rate of convergence can be derived.\nWe prove that the convergence of the method (including the rate of convergence) can be completely determined by the principal angles between <jats:inline-formula id=\"j_cmam-2019-0173_ineq_9999\">\n                     <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                           <m:mrow>\n                              <m:msup>\n                                 <m:mi>T<\/m:mi>\n                                 <m:mo>\u2020<\/m:mo>\n                              <\/m:msup>\n                              <m:mo>\u2062<\/m:mo>\n                              <m:mi>T<\/m:mi>\n                              <m:mo>\u2062<\/m:mo>\n                              <m:mrow>\n                                 <m:mo stretchy=\"false\">(<\/m:mo>\n                                 <m:msub>\n                                    <m:mi>X<\/m:mi>\n                                    <m:mi>n<\/m:mi>\n                                 <\/m:msub>\n                                 <m:mo stretchy=\"false\">)<\/m:mo>\n                              <\/m:mrow>\n                           <\/m:mrow>\n                        <\/m:math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_cmam-2019-0173_eq_0347.png\" \/>\n                        <jats:tex-math>{T^{\\dagger}T(X_{n})}<\/jats:tex-math>\n                     <\/jats:alternatives>\n                  <\/jats:inline-formula> and <jats:inline-formula id=\"j_cmam-2019-0173_ineq_9998\">\n                     <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                           <m:mrow>\n                              <m:msup>\n                                 <m:mi>T<\/m:mi>\n                                 <m:mo>*<\/m:mo>\n                              <\/m:msup>\n                              <m:mo>\u2062<\/m:mo>\n                              <m:mi>T<\/m:mi>\n                              <m:mo>\u2062<\/m:mo>\n                              <m:mrow>\n                                 <m:mo stretchy=\"false\">(<\/m:mo>\n                                 <m:msub>\n                                    <m:mi>X<\/m:mi>\n                                    <m:mi>n<\/m:mi>\n                                 <\/m:msub>\n                                 <m:mo stretchy=\"false\">)<\/m:mo>\n                              <\/m:mrow>\n                           <\/m:mrow>\n                        <\/m:math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_cmam-2019-0173_eq_0336.png\" \/>\n                        <jats:tex-math>{T^{*}T(X_{n})}<\/jats:tex-math>\n                     <\/jats:alternatives>\n                  <\/jats:inline-formula>, and the principal angles between <jats:inline-formula id=\"j_cmam-2019-0173_ineq_9997\">\n                     <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                           <m:mrow>\n                              <m:msub>\n                                 <m:mi>X<\/m:mi>\n                                 <m:mi>n<\/m:mi>\n                              <\/m:msub>\n                              <m:mo>\u2229<\/m:mo>\n                              <m:msup>\n                                 <m:mrow>\n                                    <m:mo stretchy=\"false\">(<\/m:mo>\n                                    <m:mrow>\n                                       <m:mrow>\n                                          <m:mi mathvariant=\"script\">\ud835\udca9<\/m:mi>\n                                          <m:mo>\u2062<\/m:mo>\n                                          <m:mrow>\n                                             <m:mo stretchy=\"false\">(<\/m:mo>\n                                             <m:mi>T<\/m:mi>\n                                             <m:mo stretchy=\"false\">)<\/m:mo>\n                                          <\/m:mrow>\n                                       <\/m:mrow>\n                                       <m:mo>\u2229<\/m:mo>\n                                       <m:msub>\n                                          <m:mi>X<\/m:mi>\n                                          <m:mi>n<\/m:mi>\n                                       <\/m:msub>\n                                    <\/m:mrow>\n                                    <m:mo stretchy=\"false\">)<\/m:mo>\n                                 <\/m:mrow>\n                                 <m:mo>\u22a5<\/m:mo>\n                              <\/m:msup>\n                           <\/m:mrow>\n                        <\/m:math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_cmam-2019-0173_eq_0368.png\" \/>\n                        <jats:tex-math>{X_{n}\\cap(\\mathcal{N}(T)\\cap X_{n})^{\\perp}}<\/jats:tex-math>\n                     <\/jats:alternatives>\n                  <\/jats:inline-formula> and <jats:inline-formula id=\"j_cmam-2019-0173_ineq_9996\">\n                     <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                           <m:mrow>\n                              <m:mrow>\n                                 <m:mo stretchy=\"false\">(<\/m:mo>\n                                 <m:mrow>\n                                    <m:mrow>\n                                       <m:mi mathvariant=\"script\">\ud835\udca9<\/m:mi>\n                                       <m:mo>\u2062<\/m:mo>\n                                       <m:mrow>\n                                          <m:mo stretchy=\"false\">(<\/m:mo>\n                                          <m:mi>T<\/m:mi>\n                                          <m:mo stretchy=\"false\">)<\/m:mo>\n                                       <\/m:mrow>\n                                    <\/m:mrow>\n                                    <m:mo>+<\/m:mo>\n                                    <m:msub>\n                                       <m:mi>X<\/m:mi>\n                                       <m:mi>n<\/m:mi>\n                                    <\/m:msub>\n                                 <\/m:mrow>\n                                 <m:mo stretchy=\"false\">)<\/m:mo>\n                              <\/m:mrow>\n                              <m:mo>\u2229<\/m:mo>\n                              <m:mrow>\n                                 <m:mi mathvariant=\"script\">\ud835\udca9<\/m:mi>\n                                 <m:mo>\u2062<\/m:mo>\n                                 <m:msup>\n                                    <m:mrow>\n                                       <m:mo stretchy=\"false\">(<\/m:mo>\n                                       <m:mi>T<\/m:mi>\n                                       <m:mo stretchy=\"false\">)<\/m:mo>\n                                    <\/m:mrow>\n                                    <m:mo>\u22a5<\/m:mo>\n                                 <\/m:msup>\n                              <\/m:mrow>\n                           <\/m:mrow>\n                        <\/m:math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_cmam-2019-0173_eq_0286.png\" \/>\n                        <jats:tex-math>{(\\mathcal{N}(T)+X_{n})\\cap\\mathcal{N}(T)^{\\perp}}<\/jats:tex-math>\n                     <\/jats:alternatives>\n                  <\/jats:inline-formula>.\nAt the end, we consider several specific cases and examples to further illustrate our theorems.<\/jats:p>","DOI":"10.1515\/cmam-2019-0173","type":"journal-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T16:32:59Z","timestamp":1590510779000},"page":"783-798","source":"Crossref","is-referenced-by-count":0,"title":["A Factorization of Least-Squares Projection Schemes for Ill-Posed Problems"],"prefix":"10.1515","volume":"20","author":[{"given":"Shukai","family":"Du","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences , University of Delaware , Newark , USA"}]},{"given":"Nailin","family":"Du","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics , Wuhan University , Wuhan , P. R. China"}]}],"member":"374","published-online":{"date-parts":[[2020,4,15]]},"reference":[{"key":"2023033110450936695_j_cmam-2019-0173_ref_001","unstructured":"A.  Ben-Israel and T. N. E.  Greville,\nGeneralized Inverses: Theory and Applications,\nRobert E. Krieger, Huntington, 1980."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_002","doi-asserted-by":"crossref","unstructured":"G.  Bruckner and S.  Pereverzev,\nSelf-regularization of projection methods with a posteriori discretization level choice for severely ill-posed problems,\nInverse Problems 19 (2003), no. 1, 147\u2013156.","DOI":"10.1088\/0266-5611\/19\/1\/308"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_003","doi-asserted-by":"crossref","unstructured":"D.  Chu, L.  Lin, R. C. E.  Tan and Y.  Wei,\nCondition numbers and perturbation analysis for the Tikhonov regularization of discrete ill-posed problems,\nNumer. Linear Algebra Appl. 18 (2011), no. 1, 87\u2013103.","DOI":"10.1002\/nla.702"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_004","doi-asserted-by":"crossref","unstructured":"N.  Du,\nFinite-dimensional approximation settings for infinite-dimensional Moore\u2013Penrose inverses,\nSIAM J. Numer. Anal. 46 (2008), no. 3, 1454\u20131482.","DOI":"10.1137\/060661120"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_005","doi-asserted-by":"crossref","unstructured":"H. W.  Engl,\nOn the convergence of regularization methods for ill-posed linear operator equations,\nImproperly Posed Problems and Their Numerical Treatment (Oberwolfach 1982),\nInternat. Schriftenreihe Numer. Math. 63,\nBirkh\u00e4user, Basel (1983), 81\u201395.","DOI":"10.1007\/978-3-0348-5460-3_6"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_006","unstructured":"H. W.  Engl and C. W.  Groetsch,\nProjection-regularization methods for linear operator equations of the first kind,\nSpecial Program on Inverse Problems,\nProc. Centre Math. Anal. Austral. Nat. Univ. 17,\nAustralian National University, Canberra (1988), 17\u201331."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_007","doi-asserted-by":"crossref","unstructured":"H. W.  Engl, M.  Hanke and A.  Neubauer,\nRegularization of Inverse Problems,\nMath. Appl. 375,\nKluwer Academic, Dordrecht, 1996.","DOI":"10.1007\/978-94-009-1740-8"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_008","doi-asserted-by":"crossref","unstructured":"H. W.  Engl and A.  Neubauer,\nAn improved version of Marti\u2019s method for solving ill-posed linear integral equations,\nMath. Comp. 45 (1985), no. 172, 405\u2013416.","DOI":"10.1090\/S0025-5718-1985-0804932-1"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_009","doi-asserted-by":"crossref","unstructured":"A.  Gal\u00e1ntai,\nProjectors and Projection Methods,\nAdv. Math. (Dordrecht) 6,\nKluwer Academic, Boston, 2004.","DOI":"10.1007\/978-1-4419-9180-5"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_010","unstructured":"G. H.  Golub and C. F.  Van Loan,\nMatrix Computations, 3rd ed.,\nJohns Hopkins University, Baltimore, 2012."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_011","unstructured":"C. W.  Groetsch,\nGeneralized Inverses of Linear Operators: Representation and Approximation,\nMarcel Dekker, New York, 1977."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_012","unstructured":"C. W.  Groetsch,\nOn a regularization-Ritz method for Fredholm equations of the first kind,\nJ. Integral Equations 4 (1982), no. 2, 173\u2013182."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_013","unstructured":"C. W.  Groetsch,\nThe Theory of Tikhonov Regularization for Fredholm Equations of the First Kind,\nRes. Notes in Math.105,\nPitman, Boston, 1984."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_014","unstructured":"C. W.  Groetsch and M.  Hanke,\nRegularization by projection for unbounded operators arising in inverse problems,\nInverse Problems and Applications to Geophysics, Industry, Medicine and Technology (Ho Chi Minh City 1995),\nPubl. HoChiMinh City Math. Soc. 2,\nHoChiMinh City Mathematical Society, Ho Chi Minh City (1995), 61\u201370."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_015","doi-asserted-by":"crossref","unstructured":"U.  H\u00e4marik, E.  Avi and A.  Ganina,\nOn the solution of ill-posed problems by projection methods with a posteriori choice of the discretization level,\nMath. Model. Anal. 7 (2002), no. 2, 241\u2013252.","DOI":"10.3846\/13926292.2002.9637196"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_016","doi-asserted-by":"crossref","unstructured":"B.  Kaltenbacher,\nRegularization by projection with a posteriori discretization level choice for linear and nonlinear ill-posed problems,\nInverse Problems 16 (2000), no. 5, 1523\u20131539.","DOI":"10.1088\/0266-5611\/16\/5\/322"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_017","doi-asserted-by":"crossref","unstructured":"T.  Kato,\nPerturbation Theory for Linear Operators,\nClassics Math.,\nSpringer, Berlin, 1995.","DOI":"10.1007\/978-3-642-66282-9"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_018","unstructured":"U.  Khyamarik,\nSelf-regularization in solving ill-posed problems by projection methods,\nTartu Riikl. \u00dcl. Toimetised (1988), no. 833, 91\u201396."},{"key":"2023033110450936695_j_cmam-2019-0173_ref_019","doi-asserted-by":"crossref","unstructured":"S.  Kindermann,\nProjection methods for ill-posed problems revisited,\nComput. Methods Appl. Math. 16 (2016), no. 2, 257\u2013276.","DOI":"10.1515\/cmam-2015-0036"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_020","doi-asserted-by":"crossref","unstructured":"J. T.  King and A.  Neubauer,\nA variant of finite-dimensional Tikhonov regularization with a posteriori parameter choice,\nComputing 40 (1988), no. 2, 91\u2013109.","DOI":"10.1007\/BF02247939"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_021","doi-asserted-by":"crossref","unstructured":"A.  Kirsch,\nAn Introduction to the Mathematical Theory of Inverse Problems,\nAppl. Math. Sci. 120,\nSpringer, New York, 1996.","DOI":"10.1007\/978-1-4612-5338-9"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_022","doi-asserted-by":"crossref","unstructured":"R.  Kress,\nLinear Integral Equations, 2nd ed.,\nAppl. Math. Sci. 82,\nSpringer, New York, 1999.","DOI":"10.1007\/978-1-4612-0559-3"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_023","doi-asserted-by":"crossref","unstructured":"Z.-C.  Li, H.-T.  Huang and Y.  Wei,\nIll-conditioning of the truncated singular value decomposition, Tikhonov regularization and their applications to numerical partial differential equations,\nNumer. Linear Algebra Appl. 18 (2011), no. 2, 205\u2013221.","DOI":"10.1002\/nla.766"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_024","doi-asserted-by":"crossref","unstructured":"D.  Nailin,\nThe basic principles for stable approximations to orthogonal generalized inverses of linear operators in Hilbert spaces,\nNumer. Funct. Anal. Optim. 26 (2005), no. 6, 675\u2013708.","DOI":"10.1080\/01630560500377329"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_025","doi-asserted-by":"crossref","unstructured":"M. T.  Nair,\nLinear Operator Equations. Approximation and Regularization,\nWorld Scientific, Hackensack, 2009.","DOI":"10.1142\/7055"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_026","doi-asserted-by":"crossref","unstructured":"R.  Plato and G.  Vainikko,\nOn the regularization of projection methods for solving ill-posed problems,\nNumer. Math. 57 (1990), no. 1, 63\u201379.","DOI":"10.1007\/BF01386397"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_027","doi-asserted-by":"crossref","unstructured":"T. I.  Seidman,\nNonconvergence results for the application of least-squares estimation to ill-posed problems,\nJ. Optim. Theory Appl. 30 (1980), no. 4, 535\u2013547.","DOI":"10.1007\/BF01686719"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_028","doi-asserted-by":"crossref","unstructured":"R. D.  Spies and K. G.  Temperini,\nArbitrary divergence speed of the least-squares method in infinite-dimensional inverse ill-posed problems,\nInverse Problems 22 (2006), no. 2, 611\u2013626.","DOI":"10.1088\/0266-5611\/22\/2\/014"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_029","doi-asserted-by":"crossref","unstructured":"G.  Wang, Y.  Wei and S.  Qiao,\nGeneralized Inverses: Theory and Computations, 2nd ed.,\nDev. Math. 53,\nSpringer, Singapore, 2018.","DOI":"10.1007\/978-981-13-0146-9"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_030","doi-asserted-by":"crossref","unstructured":"Y.  Wei, P.  Xie and L.  Zhang,\nTikhonov regularization and randomized GSVD,\nSIAM J. Matrix Anal. Appl. 37 (2016), no. 2, 649\u2013675.","DOI":"10.1137\/15M1030200"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_031","doi-asserted-by":"crossref","unstructured":"Q.  Xu, Y.  Wei and Y.  Gu,\nSharp norm-estimations for Moore\u2013Penrose inverses of stable perturbations of Hilbert \n                  \n                     \n                        \n                           C\n                           *\n                        \n                     \n                     \n                     C^{*}\n                  \n               -module operators,\nSIAM J. Numer. Anal. 47 (2010), no. 6, 4735\u20134758.","DOI":"10.1137\/090755576"},{"key":"2023033110450936695_j_cmam-2019-0173_ref_032","unstructured":"K.  Yosida,\nFunctional Analysis, 6th ed.,\nGrundlehren Math. Wiss. 123,\nSpringer, Berlin, 1980."}],"container-title":["Computational Methods in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/cmam\/20\/4\/article-p783.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2019-0173\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2019-0173\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T13:02:16Z","timestamp":1680267736000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2019-0173\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,15]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,8,5]]},"published-print":{"date-parts":[[2020,10,1]]}},"alternative-id":["10.1515\/cmam-2019-0173"],"URL":"https:\/\/doi.org\/10.1515\/cmam-2019-0173","relation":{},"ISSN":["1609-4840","1609-9389"],"issn-type":[{"value":"1609-4840","type":"print"},{"value":"1609-9389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,15]]}}}