{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T13:53:15Z","timestamp":1787061195992,"version":"build-2736575974"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["318024"],"award-info":[{"award-number":["318024"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The Kolmogorov\n                    <jats:italic>N<\/jats:italic>\n                    -width describes the best possible error one can achieve by elements of an\n                    <jats:italic>N<\/jats:italic>\n                    -dimensional linear space. Its decay has extensively been studied in approximation theory and for the solution of partial differential equations (PDEs). Particular interest has occurred within model order reduction (MOR) of parameterized PDEs, e.g., by the reduced basis method (RBM). While it is known that the\n                    <jats:italic>N<\/jats:italic>\n                    -width decays exponentially fast (and thus admits efficient MOR) for certain problems, there are examples of the linear transport and the wave equation, where the decay rate deteriorates to\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$N^{-1\/2}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mi>N<\/mml:mi>\n                            <mml:mrow>\n                              <mml:mo>-<\/mml:mo>\n                              <mml:mn>1<\/mml:mn>\n                              <mml:mo>\/<\/mml:mo>\n                              <mml:mn>2<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . On the other hand, it is widely accepted that a smooth parameter dependence admits a fast decay of the\n                    <jats:italic>N<\/jats:italic>\n                    -width. However, a detailed analysis of the influence of properties of the data (such as regularity or slope) on the rate of the\n                    <jats:italic>N<\/jats:italic>\n                    -width seems to be lacking. In this paper, we state that the optimal linear space is a direct sum of shift-isometric eigenspaces corresponding to the largest eigenvalues, yielding an exact representation of the\n                    <jats:italic>N<\/jats:italic>\n                    -width as their sum. For the linear transport problem, which is modeled by half-wave symmetric initial and boundary conditions\n                    <jats:italic>g<\/jats:italic>\n                    , we obtain such an optimal decomposition by sorted trigonometric functions with eigenvalues that match the Fourier coefficients of\n                    <jats:italic>g<\/jats:italic>\n                    . Further, for normalized\n                    <jats:italic>g<\/jats:italic>\n                    in the Sobolev space\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$H^r$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mi>H<\/mml:mi>\n                            <mml:mi>r<\/mml:mi>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    of broken order\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$r&gt;0$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>r<\/mml:mi>\n                            <mml:mo>&gt;<\/mml:mo>\n                            <mml:mn>0<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , the sorted eigenfunctions give the sharp upper bound of the\n                    <jats:italic>N<\/jats:italic>\n                    -width, which is a reciprocal of a certain power sum. Yet, for ease, we also provide the decay\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$(\\pi N)^{-r}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:mi>\u03c0<\/mml:mi>\n                              <mml:mi>N<\/mml:mi>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                            <mml:mrow>\n                              <mml:mo>-<\/mml:mo>\n                              <mml:mi>r<\/mml:mi>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , obtained by the non-optimal space of ordering the trigonometric functions by frequency rather than by eigenvalue. Our theoretical investigations are complemented by numerical experiments which confirm the sharpness of our bounds and give additional quantitative insight.\n                  <\/jats:p>","DOI":"10.1007\/s10444-025-10224-0","type":"journal-article","created":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:35:01Z","timestamp":1741134901000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The Kolmogorov N-width for linear transport: exact representation and the influence of the data"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4691-9285","authenticated-orcid":false,"given":"Florian","family":"Arbes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3507-5101","authenticated-orcid":false,"given":"Constantin","family":"Greif","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6262-7955","authenticated-orcid":false,"given":"Karsten","family":"Urban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"issue":"1","key":"10224_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.2307\/1968691","volume":"37","author":"A Kolmogorov","year":"1936","unstructured":"Kolmogorov, A.: \u00dcber die beste Ann\u00e4herung von Funktionen einer gegebenen Funktionenklasse. Ann. Math. 37(1), 107\u2013110 (1936)","journal-title":"Ann. Math."},{"key":"10224_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69894-1","volume-title":"N-widths in approximation theory","author":"A Pinkus","year":"1985","unstructured":"Pinkus, A.: N-widths in approximation theory. Springer, Berlin (1985)"},{"key":"10224_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1017\/S0962492900002816","volume":"7","author":"RA DeVore","year":"1998","unstructured":"DeVore, R.A.: Nonlinear approximation. Acta Numer. 7, 51\u2013150 (1998)","journal-title":"Acta Numer."},{"issue":"1","key":"10224_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1137\/20M1355720","volume":"42","author":"MS Floater","year":"2021","unstructured":"Floater, M.S., Manni, C., Sande, E., Speleers, H.: Best low-rank approximations and Kolmogorov $$n$$-widths. SIAM J. Matrix Anal. Appl. 42(1), 330\u2013350 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"10224_CR5","doi-asserted-by":"publisher","first-page":"2830","DOI":"10.1093\/imanum\/draa041","volume":"41","author":"A Bressan","year":"2021","unstructured":"Bressan, A., Floater, M.S., Sande, E.: On best constants in L2 approximation. IMA J. Numer. Anal. 41(4), 2830\u20132840 (2021)","journal-title":"IMA J. Numer. Anal."},{"issue":"6","key":"10224_CR6","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10208-010-9072-2","volume":"10","author":"A Cohen","year":"2010","unstructured":"Cohen, A., DeVore, R., Schwab, C.: Convergence rates of best N-term Galerkin approximations for a class of elliptic sPDEs. Found. Comp. Math. 10(6), 615\u2013646 (2010)","journal-title":"Found. Comp. Math."},{"issue":"1","key":"10224_CR7","first-page":"1","volume":"36","author":"A Cohen","year":"2015","unstructured":"Cohen, A., DeVore, R.: Kolmogorov widths under holomorphic mappings. IMA J. Numer. Anal. 36(1), 1\u201312 (2015)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"10224_CR8","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jmaa.2000.6862","volume":"247","author":"M Melenk","year":"2000","unstructured":"Melenk, M.: On N-widths for elliptic problems. J. Math. Anal. Appl. 247(1), 272\u2013289 (2000)","journal-title":"J. Math. Anal. Appl."},{"key":"10224_CR9","doi-asserted-by":"crossref","unstructured":"Benner, P., Ohlberger, M., Cohen, A., Willcox, K.: Model reduction and approximation. Computational Science & Engineering. SIAM, Philadelphia (2017)","DOI":"10.1137\/1.9781611974829"},{"key":"10224_CR10","volume-title":"Certified reduced basis methods for parametrized partial differential equations","author":"JS Hesthaven","year":"2015","unstructured":"Hesthaven, J.S., Rozza, G., Stamm, B.: Certified reduced basis methods for parametrized partial differential equations. Springer, Cham (2015)"},{"key":"10224_CR11","volume-title":"Reduced basis methods for partial differential equations: an introduction","author":"A Quarteroni","year":"2015","unstructured":"Quarteroni, A., Manzoni, A., Negri, F.: Reduced basis methods for partial differential equations: an introduction. Springer, Cham (2015)"},{"issue":"3","key":"10224_CR12","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/100795772","volume":"43","author":"P Binev","year":"2011","unstructured":"Binev, P., Cohen, A., Dahmen, W., DeVore, R., Petrova, G., Wojtaszczyk, P.: Convergence rates for greedy algorithms in reduced basis methods. SIAM J. Math. Anal. 43(3), 1457\u20131472 (2011)","journal-title":"SIAM J. Math. Anal."},{"issue":"304","key":"10224_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1090\/mcom\/3132","volume":"86","author":"M Bachmayr","year":"2017","unstructured":"Bachmayr, M., Cohen, A.: Kolmogorov widths and low-rank approximations of parametric elliptic PDEs. Math. Comp. 86(304), 701\u2013724 (2017)","journal-title":"Math. Comp."},{"key":"10224_CR14","doi-asserted-by":"crossref","unstructured":"DeVore, R.A.: The theoretical foundation of reduced basis methods. Computational Science & Engineering, pp. 137\u2013168. SIAM, Philadelphia (2017)","DOI":"10.1137\/1.9781611974829.ch3"},{"key":"10224_CR15","unstructured":"Maday, Y.: Reduced basis method for the rapid and reliable solution of partial differential equations. In: Proceedings of ICM, Madrid, EMS (2006)"},{"issue":"3","key":"10224_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11831-008-9019-9","volume":"15","author":"G Rozza","year":"2008","unstructured":"Rozza, G., Huynh, D.B.P., Patera, A.T.: Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations: application to transport and continuum mechanics. Arch. Comput. Methods Eng. 15(3), 229\u2013275 (2008)","journal-title":"Arch. Comput. Methods Eng."},{"issue":"3","key":"10224_CR17","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1051\/m2an\/2011056","volume":"46","author":"A Buffa","year":"2012","unstructured":"Buffa, A., Maday, Y., Patera, A.T., Prud\u2019homme, C., Turinici, G.: A priori convergence of the greedy algorithm for the parametrized reduced basis method. ESAIM Math. Model. Numer. Anal. 46(3), 595\u2013603 (2012)","journal-title":"ESAIM Math. Model. Numer. Anal."},{"issue":"1","key":"10224_CR18","first-page":"113","volume":"6","author":"T Lassila","year":"2013","unstructured":"Lassila, T., Manzoni, A., Quarteroni, A., Rozza, G.: Generalized reduced basis methods and N-width estimates for the approximation of the solution manifold of parametric pdes. Boll. Un. Mat. Italiana 6(1), 113\u2013135 (2013)","journal-title":"Boll. Un. Mat. Italiana"},{"key":"10224_CR19","unstructured":"Ohlberger, M., Rave, S.: Reduced basis methods: success, limitations and future challenges. Proceedings of the Conference Algoritmy, 1\u201312 (2016)"},{"issue":"1","key":"10224_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1023\/A:1015145924517","volume":"17","author":"Y Maday","year":"2002","unstructured":"Maday, Y., Patera, A.T., Turinici, G.: A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations. J. Sci. Comp. 17(1), 437\u2013446 (2002)","journal-title":"J. Sci. Comp."},{"issue":"3","key":"10224_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S1631-073X(02)02466-4","volume":"335","author":"Y Maday","year":"2002","unstructured":"Maday, Y., Patera, A.T., Turinici, G.: Global a priori convergence theory for reduced-basis approximations of single-parameter symmetric coercive elliptic partial differential equations. C. R. Math. 335(3), 289\u2013294 (2002)","journal-title":"C. R. Math."},{"key":"10224_CR22","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.aml.2019.05.013","volume":"96","author":"C Greif","year":"2019","unstructured":"Greif, C., Urban, K.: Decay of the Kolmogorov N-width for wave problems. Appl. Math. Lett. 96, 216\u2013222 (2019)","journal-title":"Appl. Math. Lett."},{"key":"10224_CR23","doi-asserted-by":"crossref","unstructured":"Arbes, F., Jensen, \u00d8., Mardal, K.-A., Dokken, J.: Model order reduction of solidification problems. ECCOMAS Congress (2022)","DOI":"10.23967\/eccomas.2022.179"},{"key":"10224_CR24","volume-title":"Mathematics for electrical engineering and computing","author":"MP Attenborough","year":"2003","unstructured":"Attenborough, M.P.: Mathematics for electrical engineering and computing. Elsevier, Oxford (2003)"},{"key":"10224_CR25","first-page":"416","volume-title":"Real and complex analysis","author":"W Rudin","year":"1987","unstructured":"Rudin, W.: Real and complex analysis, 3rd edn., p. 416. McGraw-Hill Book Co., New York (1987)","edition":"3"},{"key":"10224_CR26","doi-asserted-by":"publisher","unstructured":"Arbes, F.: Flabowski\/N_widths_for_transport: numerical approximation of the Kolmogorov N-width for the transport problem (2nd Review). Zenodo (2024). https:\/\/doi.org\/10.5281\/ZENODO.14051344","DOI":"10.5281\/ZENODO.14051344"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-025-10224-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-025-10224-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-025-10224-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:41:38Z","timestamp":1745559698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-025-10224-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10224"],"URL":"https:\/\/doi.org\/10.1007\/s10444-025-10224-0","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,5]]},"assertion":[{"value":"3 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"13"}}