{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:35:05Z","timestamp":1776868505546,"version":"3.51.2"},"reference-count":20,"publisher":"American Mathematical Society (AMS)","issue":"230","license":[{"start":{"date-parts":[[2000,5,19]],"date-time":"2000-05-19T00:00:00Z","timestamp":958694400000},"content-version":"am","delay-in-days":366,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    This paper provides a framework for developing computationally efficient multilevel preconditioners and representations for Sobolev norms. Specifically, given a Hilbert space\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper V\">\n                        <mml:semantics>\n                          <mml:mi>V<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">V<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    and a nested sequence of subspaces\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper V 1 subset-of upper V 2 subset-of ellipsis subset-of upper V\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>V<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:msub>\n                            <mml:mo>\n                              \u2282\n                              \n                            <\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>V<\/mml:mi>\n                              <mml:mn>2<\/mml:mn>\n                            <\/mml:msub>\n                            <mml:mo>\n                              \u2282\n                              \n                            <\/mml:mo>\n                            <mml:mo>\n                              \u2026\n                              \n                            <\/mml:mo>\n                            <mml:mo>\n                              \u2282\n                              \n                            <\/mml:mo>\n                            <mml:mi>V<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">V_1 \\subset V_2 \\subset \\ldots \\subset V<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , we construct operators which are spectrally equivalent to those of the form\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"script upper A equals sigma-summation Underscript k Endscripts mu Subscript k Baseline left-parenthesis upper Q Subscript k Baseline minus upper Q Subscript k minus 1 Baseline right-parenthesis\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                              <mml:mi class=\"MJX-tex-caligraphic\" mathvariant=\"script\">A<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:munder>\n                              <mml:mo>\n                                \u2211\n                                \n                              <\/mml:mo>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:munder>\n                            <mml:msub>\n                              <mml:mi>\n                                \u03bc\n                                \n                              <\/mml:mi>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mo stretchy=\"false\">(<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>Q<\/mml:mi>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mo>\n                              \u2212\n                              \n                            <\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>Q<\/mml:mi>\n                              <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                <mml:mi>k<\/mml:mi>\n                                <mml:mo>\n                                  \u2212\n                                  \n                                <\/mml:mo>\n                                <mml:mn>1<\/mml:mn>\n                              <\/mml:mrow>\n                            <\/mml:msub>\n                            <mml:mo stretchy=\"false\">)<\/mml:mo>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">\\mathcal {A}= \\sum _k \\mu _k (Q_k-Q_{k-1})<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . Here\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"mu Subscript k\">\n                        <mml:semantics>\n                          <mml:msub>\n                            <mml:mi>\n                              \u03bc\n                              \n                            <\/mml:mi>\n                            <mml:mi>k<\/mml:mi>\n                          <\/mml:msub>\n                          <mml:annotation encoding=\"application\/x-tex\">\\mu _k<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ,\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"k equals 1 comma 2 comma ellipsis\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>k<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>1<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mo>\n                              \u2026\n                              \n                            <\/mml:mo>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">k=1,2,\\ldots<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , are positive numbers and\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper Q Subscript k\">\n                        <mml:semantics>\n                          <mml:msub>\n                            <mml:mi>Q<\/mml:mi>\n                            <mml:mi>k<\/mml:mi>\n                          <\/mml:msub>\n                          <mml:annotation encoding=\"application\/x-tex\">Q_k<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    is the orthogonal projector onto\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper V Subscript k\">\n                        <mml:semantics>\n                          <mml:msub>\n                            <mml:mi>V<\/mml:mi>\n                            <mml:mi>k<\/mml:mi>\n                          <\/mml:msub>\n                          <mml:annotation encoding=\"application\/x-tex\">V_k<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    with\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper Q 0 equals 0\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>Q<\/mml:mi>\n                              <mml:mn>0<\/mml:mn>\n                            <\/mml:msub>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>0<\/mml:mn>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">Q_0=0<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . We first present abstract results which show when\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"script upper A\">\n                        <mml:semantics>\n                          <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                            <mml:mi class=\"MJX-tex-caligraphic\" mathvariant=\"script\">A<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">\\mathcal {A}<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    is spectrally equivalent to a similarly constructed operator\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"script upper A overTilde\">\n                        <mml:semantics>\n                          <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                            <mml:mover>\n                              <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                <mml:mi class=\"MJX-tex-caligraphic\" mathvariant=\"script\">A<\/mml:mi>\n                              <\/mml:mrow>\n                              <mml:mo>\n                                ~\n                                \n                              <\/mml:mo>\n                            <\/mml:mover>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">\\widetilde {\\mathcal {A}}<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    defined in terms of an approximation\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper Q overTilde Subscript k\">\n                        <mml:semantics>\n                          <mml:msub>\n                            <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                              <mml:mover>\n                                <mml:mi>Q<\/mml:mi>\n                                <mml:mo>\n                                  ~\n                                  \n                                <\/mml:mo>\n                              <\/mml:mover>\n                            <\/mml:mrow>\n                            <mml:mi>k<\/mml:mi>\n                          <\/mml:msub>\n                          <mml:annotation encoding=\"application\/x-tex\">\\widetilde Q_k<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    of\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper Q Subscript k\">\n                        <mml:semantics>\n                          <mml:msub>\n                            <mml:mi>Q<\/mml:mi>\n                            <mml:mi>k<\/mml:mi>\n                          <\/mml:msub>\n                          <mml:annotation encoding=\"application\/x-tex\">Q_k<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , for\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"k equals 1 comma 2 comma ellipsis\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>k<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>1<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mo>\n                              \u2026\n                              \n                            <\/mml:mo>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">k=1,2, \\ldots<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . We show that these results lead to efficient preconditioners for discretizations of differential and pseudo-differential operators of positive and negative order. These results extend to sums of operators. For example, singularly perturbed problems such as\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper I minus epsilon normal upper Delta\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>I<\/mml:mi>\n                            <mml:mo>\n                              \u2212\n                              \n                            <\/mml:mo>\n                            <mml:mi>\n                              \u03f5\n                              \n                            <\/mml:mi>\n                            <mml:mi mathvariant=\"normal\">\n                              \u0394\n                              \n                            <\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">I-\\epsilon \\Delta<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    can be preconditioned uniformly independently of the parameter\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"epsilon\">\n                        <mml:semantics>\n                          <mml:mi>\n                            \u03f5\n                            \n                          <\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">\\epsilon<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . We also show how to precondition an operator which results from Tikhonov regularization of a problem with noisy data. Finally, we describe how the technique provides computationally efficient bounded discrete extensions which have applications to domain decomposition.\n                  <\/p>","DOI":"10.1090\/s0025-5718-99-01106-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T18:17:31Z","timestamp":1027707451000},"page":"463-480","source":"Crossref","is-referenced-by-count":52,"title":["Computational scales of Sobolev norms with application to preconditioning"],"prefix":"10.1090","volume":"69","author":[{"given":"James","family":"Bramble","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Pasciak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panayot","family":"Vassilevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[1999,5,19]]},"reference":[{"issue":"202","key":"1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.2307\/2153097","article-title":"New estimates for multilevel algorithms including the \ud835\udc49-cycle","volume":"60","author":"Bramble, James H.","year":"1993","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"201","key":"2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2153154","article-title":"Iterative schemes for nonsymmetric and indefinite elliptic boundary value problems","volume":"60","author":"Bramble, James H.","year":"1993","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"191","key":"3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2008789","article-title":"Parallel multilevel preconditioners","volume":"55","author":"Bramble, James H.","year":"1990","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"4","unstructured":"J. H. Bramble and P. S. Vassilevski, Wavelet\u2013like extension operators in interface domain decomposition methods, (unpublished manuscript) 1997."},{"issue":"2","key":"5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1006\/acha.1996.0012","article-title":"Local decomposition of refinable spaces and wavelets","volume":"3","author":"Carnicer, J. M.","year":"1996","journal-title":"Appl. Comput. Harmon. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/1063-5203","issn-type":"print"},{"key":"6","series-title":"Studies in Mathematics and its Applications, Vol. 4","isbn-type":"print","volume-title":"The finite element method for elliptic problems","author":"Ciarlet, Philippe G.","year":"1978","ISBN":"https:\/\/id.crossref.org\/isbn\/0444850287"},{"issue":"18","key":"7","first-page":"927","article-title":"Non-unicit\u00e9 pour certains probl\u00e8mes de Cauchy complexes non lin\u00e9aires du premier ordre","volume":"299","author":"Saint Raymond, Xavier","year":"1984","journal-title":"C. R. Acad. Sci. Paris S\\'{e}r. I Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0249-6291","issn-type":"print"},{"issue":"3","key":"8","first-page":"173","article-title":"Hierarchical extension operators and local multigrid methods in domain decomposition preconditioners","volume":"2","author":"Haase, G.","year":"1994","journal-title":"East-West J. Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0928-0200","issn-type":"print"},{"key":"9","isbn-type":"print","first-page":"235","article-title":"Piecewise linear prewavelets of small support","author":"Kotyczka, Uwe","year":"1995","ISBN":"https:\/\/id.crossref.org\/isbn\/9810229720"},{"key":"10","unstructured":"R. Lorentz and P. Oswald, Constructing economical Riesz bases for Sobolev spaces, Proceedings of the Domain Decomposition Conference held in Bergen, Norway, June 3\u20138, 1996."},{"issue":"1-2","key":"11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/00036818408839508","article-title":"Error bounds for Tikhonov regularization in Hilbert scales","volume":"18","author":"Natterer, Frank","year":"1984","journal-title":"Applicable Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0003-6811","issn-type":"print"},{"key":"12","unstructured":"S. V. Nepomnyaschikh, Optimal multilevel extension operators, Report SPC 95\u20133, Jan, 1995, Technische Universit\u00e4t Chemnitz\u2013Zwickau, Germany."},{"key":"13","unstructured":"P. Oswald, On discrete norm estimates related to multilevel preconditioners in the finite element method,  Constructive Theory of Functions, Proc. Int. Conf. Varna 1992, Bulg. Acad. Sci., Sofia, 1992, 203\u2013214."},{"key":"14","series-title":"Teubner Skripten zur Numerik. [Teubner Scripts on Numerical Mathematics]","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-91215-2","volume-title":"Multilevel finite element approximation","author":"Oswald, Peter","year":"1994","ISBN":"https:\/\/id.crossref.org\/isbn\/3519027194"},{"key":"15","doi-asserted-by":"crossref","unstructured":"R. Stevenson, A robust hierarchical basis preconditioner on general meshes, Numer. Math. 78 (1997), 269\u2013303.","DOI":"10.1007\/s002110050313"},{"key":"16","doi-asserted-by":"crossref","unstructured":"R. Stevenson, Piecewise linear (pre-) wavelets on non\u2013uniform meshes, Report # 9701, Department of Mathematics, University of Nijmegen, Nijmegen, The Netherlands, 1997.","DOI":"10.1007\/978-3-642-58734-4_18"},{"key":"17","doi-asserted-by":"crossref","unstructured":"U. Tautenhahn, Error estimates for regularization methods in Hilbert scales, SIAM J. Numer. Anal. 33(1996), 2120\u20132130.","DOI":"10.1137\/S0036142994269411"},{"issue":"2","key":"18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/(SICI)1099-1506(199703\/04)4:2<103::AID-NLA101>3.0.CO;2-J","article-title":"Stabilizing the hierarchical basis by approximate wavelets. I. Theory","volume":"4","author":"Vassilevski, Panayot S.","year":"1997","journal-title":"Numer. Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/1070-5325","issn-type":"print"},{"key":"19","doi-asserted-by":"crossref","unstructured":"P. S. Vassilevski and J. Wang, Stabilizing the hierarchical basis by approximate wavelets, II: Implementation and numerical experiments, SIAM J. Sci. Comput. 20 (1999), 490\u2013514.","DOI":"10.1137\/S1064827596300668"},{"key":"20","unstructured":"X. Zhang, Multi-level Additive Schwarz Methods, Courant Inst. Math. Sci., Dept. Comp. Sci. Rep. 1991."}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2000-69-230\/S0025-5718-99-01106-0\/S0025-5718-99-01106-0.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2000-69-230\/S0025-5718-99-01106-0\/S0025-5718-99-01106-0.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T22:16:09Z","timestamp":1776723369000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2000-69-230\/S0025-5718-99-01106-0\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5,19]]},"references-count":20,"journal-issue":{"issue":"230","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0025-5718-99-01106-0"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-99-01106-0","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5,19]]}}}