{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T15:07:44Z","timestamp":1775488064855,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00211-023-01379-3","type":"journal-article","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T05:01:51Z","timestamp":1698728511000},"page":"415-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On generating Sobolev orthogonal polynomials"],"prefix":"10.1007","volume":"155","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0856-0670","authenticated-orcid":false,"given":"Niel","family":"Van Buggenhout","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"1379_CR1","doi-asserted-by":"publisher","unstructured":"Mart\u00ednez-Finkelshtein, A.: Analytic aspects of Sobolev orthogonal polynomials revisited. In: Numerical Analysis 2000. Vol. V: Quadrature and Orthogonal Polynomials. J. Comput. Appl. Math., 127(1-2), pp. 255\u2013266 (2001). https:\/\/doi.org\/10.1016\/S0377-0427(00)00499-4","DOI":"10.1016\/S0377-0427(00)00499-4"},{"issue":"3","key":"1379_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.exmath.2014.10.002","volume":"33","author":"F Marcell\u00e1n","year":"2015","unstructured":"Marcell\u00e1n, F., Xu, Y.: On Sobolev orthogonal polynomials. Expo. Math. 33(3), 308\u2013352 (2015). https:\/\/doi.org\/10.1016\/j.exmath.2014.10.002","journal-title":"Expo. Math."},{"key":"1379_CR3","doi-asserted-by":"publisher","unstructured":"L\u00f3pez Lagomasino, G., Pijeira Cabrera, H., P\u00e9rez Izquierdo, I.: Sobolev orthogonal polynomials in the complex plane. In: Numerical Analysis 2000. Vol. V: Quadrature and Orthogonal Polynomials. J. Comput. Appl. Math. 127(1\u20132), pp. 219\u2013230 (2001). https:\/\/doi.org\/10.1016\/S0377-0427(00)00498-2","DOI":"10.1016\/S0377-0427(00)00498-2"},{"issue":"2","key":"1379_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1137\/0105007","volume":"5","author":"GE Forsythe","year":"1957","unstructured":"Forsythe, G.E.: Generation and use of orthogonal polynomials for data-fitting with a digital computer. J. Soc. Ind. Appl. Math. 5(2), 74\u201388 (1957). https:\/\/doi.org\/10.1137\/0105007","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"1379_CR5","unstructured":"Szeg\u0151, G.: Orthogonal Polynomials, 4th edn. Americal Mathematical Society Colloquium Publications, vol. 23. American Mathematical Society, Providence, RI (1975)"},{"key":"1379_CR6","doi-asserted-by":"crossref","unstructured":"Gautschi, W.: Orthogonal Polynomials: Computation and Approximation. Numerical Mathematics and Scientific Computation. Oxford Science Publications. Oxford University Press, New York (2004)","DOI":"10.1093\/oso\/9780198506720.001.0001"},{"key":"1379_CR7","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Meurant, G.: Matrices, Moments and Quadrature with Applications. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2009)","DOI":"10.1515\/9781400833887"},{"issue":"3","key":"1379_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01405565","volume":"44","author":"WB Gragg","year":"1984","unstructured":"Gragg, W.B., Harrod, W.J.: The numerically stable reconstruction of Jacobi matrices from spectral data. Numer. Math. 44(3), 317\u2013335 (1984). https:\/\/doi.org\/10.1007\/BF01405565","journal-title":"Numer. Math."},{"issue":"106","key":"1379_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1090\/S0025-5718-69-99647-1","volume":"23","author":"GH Golub","year":"1969","unstructured":"Golub, G.H., Welsch, J.H.: Calculation of Gauss quadrature rules. Math. Comput. 23(106), 221\u2013230 (1969). https:\/\/doi.org\/10.1090\/S0025-5718-69-99647-1","journal-title":"Math. Comput."},{"issue":"2","key":"1379_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/19M130100X","volume":"63","author":"PD Brubeck","year":"2021","unstructured":"Brubeck, P.D., Nakatsukasa, Y., Trefethen, L.N.: Vandermonde with Arnoldi. SIAM Rev. 63(2), 405\u2013415 (2021). https:\/\/doi.org\/10.1137\/19M130100X","journal-title":"SIAM Rev."},{"issue":"3","key":"1379_CR11","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1137\/0612041","volume":"12","author":"L Reichel","year":"1991","unstructured":"Reichel, L.: Fast $$QR$$ decomposition of Vandermonde-like matrices and polynomial least squares approximation. SIAM J. Matrix Anal. Appl. 12(3), 552\u2013564 (1991). https:\/\/doi.org\/10.1137\/0612041","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1379_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0024-3795(78)90086-1","volume":"21","author":"C de Boor","year":"1978","unstructured":"de Boor, C., Golub, G.H.: The numerically stable reconstruction of a Jacobi matrix from spectral data. Linear Algebra Appl. 21(3), 245\u2013260 (1978). https:\/\/doi.org\/10.1016\/0024-3795(78)90086-1","journal-title":"Linear Algebra Appl."},{"issue":"195","key":"1379_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1090\/S0025-5718-1991-1079030-8","volume":"57","author":"L Reichel","year":"1991","unstructured":"Reichel, L., Ammar, G., Gragg, W.: Discrete least squares approximation by trigonometric polynomials. Math. Comput. 57(195), 273\u2013289 (1991). https:\/\/doi.org\/10.1090\/S0025-5718-1991-1079030-8","journal-title":"Math. Comput."},{"issue":"1\u20132","key":"1379_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0377-0427(99)00228-9","volume":"112","author":"DP Laurie","year":"1999","unstructured":"Laurie, D.P.: Accurate recovery of recursion coefficients from Gaussian quadrature formulas. J. Comput. Appl. Math. 112(1\u20132), 165\u2013180 (1999). https:\/\/doi.org\/10.1016\/S0377-0427(99)00228-9","journal-title":"J. Comput. Appl. Math."},{"key":"1379_CR15","doi-asserted-by":"crossref","unstructured":"Liesen, J., Strako\u0161, Z.: Krylov Subspace Methods. Principles and Analysis. Numerical Mathematics and Scientific Computation. Oxford University Press, Oxford (2013)","DOI":"10.1093\/acprof:oso\/9780199655410.003.0002"},{"key":"1379_CR16","doi-asserted-by":"crossref","unstructured":"Meurant, G.: The Lanczos and Conjugate Gradient Algorithms. From Theory to Finite Precision Computations. Software, Environments, and Tools, vol. 19. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2006)","DOI":"10.1137\/1.9780898718140"},{"issue":"1","key":"1379_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S0036144504445376","volume":"48","author":"ABJ Kuijlaars","year":"2006","unstructured":"Kuijlaars, A.B.J.: Convergence analysis of Krylov subspace iterations with methods from potential theory. SIAM Rev. 48(1), 3\u201340 (2006). https:\/\/doi.org\/10.1137\/S0036144504445376","journal-title":"SIAM Rev."},{"key":"1379_CR18","doi-asserted-by":"crossref","unstructured":"Stahl, H., Totik, V.: General Orthogonal Polynomials. Encyclopedia of Mathematics and its Applications, vol. 43. Cambridge University Press, Cambridge (1992)","DOI":"10.1017\/CBO9780511759420"},{"key":"1379_CR19","doi-asserted-by":"publisher","unstructured":"Althammer, P.: Eine Erweiterung des Orthogonalit\u00e4tsbegriffes bei Polynomen und deren Anwendung auf die beste Approximation. J. Reine Angew. Math. 211, 192\u2013204 (1962). In German. https:\/\/doi.org\/10.1515\/crll.1962.211.192","DOI":"10.1515\/crll.1962.211.192"},{"key":"1379_CR20","doi-asserted-by":"publisher","unstructured":"Gr\u00f6bner, W.: Orthogonale Polynomsysteme, die gleichzeitig mit $$f(x)$$ auch deren Ableitung $$f^{\\prime }(x)$$ approximieren. In: Funktionalanalysis, Approximationstheorie, Numerische Mathematik (Oberwolfach, 1965). Internationale Schriftenreihe zur Numerischen Mathematik, vol. 7, pp. 24\u201332. Birkh\u00e4user Verlag, Basel-Stuttgart (1967). In German. https:\/\/doi.org\/10.1007\/978-3-0348-5821-2_3","DOI":"10.1007\/978-3-0348-5821-2_3"},{"key":"1379_CR21","doi-asserted-by":"crossref","unstructured":"Iserles, A., Koch, P.E., N\u00f8rsett, S.P., Sanz-Serna, J.M.: Orthogonality and approximation in a Sobolev space. In: Algorithms for Approximation. II (Shrivenham 1988), pp. 117\u2013124. Chapman and Hall, London (1990)","DOI":"10.1007\/978-1-4899-3442-0_12"},{"key":"1379_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2022.108420","volume":"135","author":"Q Niu","year":"2023","unstructured":"Niu, Q., Zhang, H., Zhou, Y.: Confluent Vandermonde with Arnoldi. Appl. Math. Lett. 135, 108420 (2023). https:\/\/doi.org\/10.1016\/j.aml.2022.108420","journal-title":"Appl. Math. Lett."},{"issue":"1\u20132","key":"1379_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(92)90259-Z","volume":"43","author":"C Bernardi","year":"1992","unstructured":"Bernardi, C., Maday, Y.: Polynomial interpolation results in Sobolev spaces. J. Comput. Appl. Math. 43(1\u20132), 53\u201380 (1992). https:\/\/doi.org\/10.1016\/0377-0427(92)90259-Z","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1379_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s42967-019-00016-x","volume":"1","author":"X Yu","year":"2019","unstructured":"Yu, X., Wang, Z., Li, H.: Jacobi\u2013Sobolev orthogonal polynomials and spectral methods for elliptic boundary value problems. Commun. Appl. Math. Comput. 1(2), 283\u2013308 (2019). https:\/\/doi.org\/10.1007\/s42967-019-00016-x","journal-title":"Commun. Appl. Math. Comput."},{"key":"1379_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2023.07.027","author":"L Fern\u00e1ndez","year":"2023","unstructured":"Fern\u00e1ndez, L., Marcell\u00e1n, F., P\u00e9rez, T.E., Pi\u00f1ar, M.A.: Sobolev orthogonal polynomials and spectral methods in boundary value problems. Appl. Numer. Math. (2023). https:\/\/doi.org\/10.1016\/j.apnum.2023.07.027","journal-title":"Appl. Numer. Math."},{"key":"1379_CR26","doi-asserted-by":"crossref","unstructured":"Rutishauser, H.: On Jacobi rotation patterns. In: Experimental Arithmetic, High Speed Computing and Mathematics. Proceedings of Symposia in Applied Mathematics, vol. XV, pp. 241\u2013258. American Mathematical Society, Providence, RI (1963)","DOI":"10.1090\/psapm\/015\/0160321"},{"issue":"2","key":"1379_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s002110050140","volume":"71","author":"W Gautschi","year":"1995","unstructured":"Gautschi, W., Zhang, M.: Computing orthogonal polynomials in Sobolev spaces. Numer. Math. 71(2), 159\u2013183 (1995). https:\/\/doi.org\/10.1007\/s002110050140","journal-title":"Numer. Math."},{"issue":"1","key":"1379_CR28","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1006\/jath.1998.3318","volume":"99","author":"G L\u00f3pez Lagomasino","year":"1999","unstructured":"L\u00f3pez Lagomasino, G., Pijeira Cabrera, H.: Zero location and $$n$$th root asymptotics of Sobolev orthogonal polynomials. J. Approx. Theory 99(1), 30\u201343 (1999). https:\/\/doi.org\/10.1006\/jath.1998.3318","journal-title":"J. Approx. Theory"},{"issue":"1","key":"1379_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jath.2002.3681","volume":"117","author":"F Marcell\u00e1n","year":"2002","unstructured":"Marcell\u00e1n, F., Osilenker, B.P., Rocha, I.A.: On Fourier series of a discrete Jacobi\u2013Sobolev inner product. J. Approx. Theory 117(1), 1\u201322 (2002). https:\/\/doi.org\/10.1006\/jath.2002.3681","journal-title":"J. Approx. Theory"},{"issue":"2","key":"1379_CR30","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0021-9045(90)90036-P","volume":"62","author":"A Cachafeiro","year":"1990","unstructured":"Cachafeiro, A., Marcell\u00e1n, F.: The characterization of the quasi-typical extension of an inner product. J. Approx. Theory 62(2), 235\u2013242 (1990). https:\/\/doi.org\/10.1016\/0021-9045(90)90036-P","journal-title":"J. Approx. Theory"},{"issue":"1","key":"1379_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0909001","volume":"9","author":"PE Saylor","year":"1988","unstructured":"Saylor, P.E., Smolarski, D.C.: Computing the roots of complex orthogonal and kernel polynomials. SIAM J. Sci. Stat. Comput. 9(1), 1\u201313 (1988). https:\/\/doi.org\/10.1137\/0909001","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"2","key":"1379_CR32","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0377-0427(95)00234-0","volume":"71","author":"F Marcell\u00e1n","year":"1996","unstructured":"Marcell\u00e1n, F., P\u00e9rez, T.E., Pi\u00f1ar, M.A.: Laguerre\u2013Sobolev orthogonal polynomials. J. Comput. Appl. Math. 71(2), 245\u2013265 (1996). https:\/\/doi.org\/10.1016\/0377-0427(95)00234-0","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"1379_CR33","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s11075-022-01402-y","volume":"92","author":"C Hermoso","year":"2023","unstructured":"Hermoso, C., Huertas, E.J., Lastra, A., Marcell\u00e1n, F.: Higher-order recurrence relations, Sobolev-type inner products and matrix factorizations. Numer. Algorithms 92(1), 665\u2013692 (2023). https:\/\/doi.org\/10.1007\/s11075-022-01402-y","journal-title":"Numer. Algorithms"},{"key":"1379_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717778","volume-title":"Functions of Matrices: Theory and Computation","author":"NJ Higham","year":"2008","unstructured":"Higham, N.J.: Functions of Matrices: Theory and Computation. SIAM, Philiadelphia (2008)"},{"key":"1379_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492902000016","volume":"11","author":"MT Chu","year":"2002","unstructured":"Chu, M.T., Golub, G.H.: Structured inverse eigenvalue problems. Acta Numer. 11, 1\u201371 (2002). https:\/\/doi.org\/10.1017\/S0962492902000016","journal-title":"Acta Numer."},{"key":"1379_CR36","doi-asserted-by":"crossref","unstructured":"Ammar, G., Gragg, W., Reichel, L.: Constructing a unitary Hessenberg matrix from spectral data. In: Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms (Leuven 1988). NATO Adv. Sci. Inst. Ser. F: Comput. Systems Sci., vol. 70, pp. 385\u2013395. Springer, Berlin (1991)","DOI":"10.1007\/978-3-642-75536-1_18"},{"key":"1379_CR37","unstructured":"Van\u00a0Buggenhout, N.: Structured matrix techniques for orthogonal rational functions and rational Krylov methods. Ph.D. thesis, KU Leuven (2021)"},{"key":"1379_CR38","doi-asserted-by":"crossref","unstructured":"Rutishauser, H.: Der Quotienten-Differenzen-Algorithmus. Mitt. Inst. Angew. Math. Z\u00fcrich 1957(7), 74 pp. (1957). In German","DOI":"10.1007\/978-3-0348-7175-4_2"},{"key":"1379_CR39","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s11075-021-01125-6","volume":"89","author":"N Van Buggenhout","year":"2022","unstructured":"Van Buggenhout, N., Van Barel, M., Vandebril, R.: Generation of orthogonal rational functions by procedures for structured matrices. Numer. Algorithms 89, 551\u2013582 (2022). https:\/\/doi.org\/10.1007\/s11075-021-01125-6","journal-title":"Numer. Algorithms"},{"key":"1379_CR40","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1090\/qam\/42792","volume":"9","author":"WE Arnoldi","year":"1951","unstructured":"Arnoldi, W.E.: The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9, 17\u201329 (1951)","journal-title":"Quart. Appl. Math."},{"key":"1379_CR41","unstructured":"Van\u00a0Buggenhout, N.: SOP. GitHub (2022). https:\/\/github.com\/nielvb\/SOP"},{"issue":"4","key":"1379_CR42","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards 45(4), 255\u2013282 (1950)","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"1379_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1553\/etna_vol50s1","volume":"50","author":"S Pozza","year":"2018","unstructured":"Pozza, S., Prani\u0107, M.S., Strako\u0161, Z.: The Lanczos algorithm and complex Gauss quadrature. Electron. Trans. Numer. Anal. 50, 1\u201319 (2018). https:\/\/doi.org\/10.1553\/etna_vol50s1","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1379_CR44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971354","volume-title":"Fast Reliable Algorithms for Matrices with Structure","author":"T Kailath","year":"1999","unstructured":"Kailath, T., Sayed, A.H.: Fast Reliable Algorithms for Matrices with Structure. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1999)"},{"issue":"4","key":"1379_CR45","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF02165404","volume":"13","author":"BN Parlett","year":"1969","unstructured":"Parlett, B.N., Reinsch, C.: Balancing a matrix for calculation of eigenvalues and eigenvectors. Numer. Math. 13(4), 293\u2013304 (1969). https:\/\/doi.org\/10.1007\/BF02165404","journal-title":"Numer. Math."},{"key":"1379_CR46","unstructured":"Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Monographs on Numerical Analysis. The Clarendon Press, Oxford University Press, New York (1988). 1st ed. published 1963"},{"issue":"3","key":"1379_CR47","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s002110050069","volume":"68","author":"K-C Toh","year":"1994","unstructured":"Toh, K.-C., Trefethen, L.N.: Pseudozeros of polynomials and pseudospectra of companion matrices. Numer. Math. 68(3), 403\u2013425 (1994). https:\/\/doi.org\/10.1007\/s002110050069","journal-title":"Numer. Math."},{"issue":"5","key":"1379_CR48","doi-asserted-by":"publisher","first-page":"1969","DOI":"10.1137\/040609847","volume":"43","author":"D Day","year":"2005","unstructured":"Day, D., Romero, L.: Roots of polynomials expressed in terms of orthogonal polynomials. SIAM J. Numer. Anal. 43(5), 1969\u20131987 (2005). https:\/\/doi.org\/10.1137\/040609847","journal-title":"SIAM J. Numer. Anal."},{"issue":"301","key":"1379_CR49","doi-asserted-by":"publisher","first-page":"2391","DOI":"10.1090\/mcom3049","volume":"85","author":"Y Nakatsukasa","year":"2016","unstructured":"Nakatsukasa, Y., Noferini, V.: On the stability of computing polynomial roots via confederate linearizations. Math. Comput. 85(301), 2391\u20132425 (2016). https:\/\/doi.org\/10.1090\/mcom3049","journal-title":"Math. Comput."},{"issue":"2","key":"1379_CR50","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1137\/0721026","volume":"21","author":"V Faber","year":"1984","unstructured":"Faber, V., Manteuffel, T.: Necessary and sufficient conditions for the existence of a conjugate gradient method. SIAM J. Numer. Anal. 21(2), 352\u2013362 (1984). https:\/\/doi.org\/10.1137\/0721026","journal-title":"SIAM J. Numer. Anal."},{"key":"1379_CR51","doi-asserted-by":"publisher","unstructured":"Barth, T., Manteuffel, T.: Multiple recursion conjugate gradient algorithms. I. Sufficient conditions. SIAM J. Matrix Anal. Appl. 21(3), 768\u2013796 (2000). https:\/\/doi.org\/10.1137\/S089547989833245X","DOI":"10.1137\/S089547989833245X"},{"issue":"2","key":"1379_CR52","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1137\/S0036141092226922","volume":"26","author":"WD Evans","year":"1995","unstructured":"Evans, W.D., Littlejohn, L.L., Marcell\u00e1n, F., Markett, C., Ronveaux, A.: On recurrence relations for Sobolev orthogonal polynomials. SIAM J. Math. Anal. 26(2), 446\u2013467 (1995). https:\/\/doi.org\/10.1137\/S0036141092226922","journal-title":"SIAM J. Math. Anal."},{"key":"1379_CR53","unstructured":"Kressner, D.: Numerical Methods for General and Structured Eigenvalue Problems. Lecture Notes in Computational Science and Engineering, vol. 46. Springer, Berlin (2005)"},{"key":"1379_CR54","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1017\/S0962492920000045","volume":"29","author":"S Olver","year":"2020","unstructured":"Olver, S., Slevinsky, R.M., Townsend, A.: Fast algorithms using orthogonal polynomials. Acta Numer. 29, 573\u2013699 (2020). https:\/\/doi.org\/10.1017\/S0962492920000045","journal-title":"Acta Numer."},{"key":"1379_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-023-01615-9","author":"T Laudadio","year":"2023","unstructured":"Laudadio, T., Mastronardi, N., Van Dooren, P.: On computing modified moments for half-range Hermite weights. Numer. Algorithms (2023). https:\/\/doi.org\/10.1007\/s11075-023-01615-9","journal-title":"Numer. Algorithms"},{"key":"1379_CR56","unstructured":"Zhang, M.: Orthogonal polynomials in Sobolev spaces: Computational method. Ph.D. thesis, Purdue University (1993)"},{"key":"1379_CR57","doi-asserted-by":"publisher","unstructured":"Zhang, M.: Sensitivity analysis for computing orthogonal polynomials of Sobolev type. In: Approximation and Computation (West Lafayette, IN, 1993). International Series of Numerical Mathematics, vol. 119, pp. 563\u2013576. Birkh\u00e4user Boston, Boston, MA (1994). https:\/\/doi.org\/10.1007\/978-1-4684-7415-2_38","DOI":"10.1007\/978-1-4684-7415-2_38"},{"issue":"2","key":"1379_CR58","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-0427(01)00421-6","volume":"139","author":"HG Meijer","year":"2002","unstructured":"Meijer, H.G., de Bruin, M.G.: Zeros of Sobolev orthogonal polynomials following from coherent pairs. J. Comput. Appl. Math. 139(2), 253\u2013274 (2002). https:\/\/doi.org\/10.1016\/S0377-0427(01)00421-6","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"1379_CR59","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1016\/j.cam.2007.12.028","volume":"233","author":"L Knizhnerman","year":"2010","unstructured":"Knizhnerman, L.: Sensitivity of the Lanczos recurrence to Gaussian quadrature data: How malignant can small weights be? J. Comput. Appl. Math. 233(5), 1238\u20131244 (2010). https:\/\/doi.org\/10.1016\/j.cam.2007.12.028","journal-title":"J. Comput. Appl. Math."},{"key":"1379_CR60","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0024-3795(93)00218-O","volume":"219","author":"AJ Dur\u00e1n","year":"1995","unstructured":"Dur\u00e1n, A.J., Van Assche, W.: Orthogonal matrix polynomials and higher-order recurrence relations. Linear Algebra Appl. 219, 261\u2013280 (1995). https:\/\/doi.org\/10.1016\/0024-3795(93)00218-O","journal-title":"Linear Algebra Appl."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-023-01379-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-023-01379-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-023-01379-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T16:02:11Z","timestamp":1699718531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-023-01379-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,31]]},"references-count":60,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1379"],"URL":"https:\/\/doi.org\/10.1007\/s00211-023-01379-3","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,31]]},"assertion":[{"value":"28 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that there is no conflict of interest nor competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All code and numerical experiments are made publicly available .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code and data availability"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}