{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T21:54:12Z","timestamp":1775858052592,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004270","name":"Royal Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004270","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the two parts of the present note we discuss several questions concerning the implementation of overdetermined least-squares collocation methods for higher index differential-algebraic equations (DAEs). Since higher index DAEs lead to ill-posed problems in natural settings, the discrete counterparts are expected to be very sensitive, which attaches particular importance to their implementation. In the present Part 1, we provide a robust selection of basis functions and collocation points to design the discrete problem. We substantiate a procedure for its numerical solution later in Part 2. Additionally, in Part 1, a number of new error estimates are proven that support some of the design decisions.<\/jats:p>","DOI":"10.1007\/s11075-021-01140-7","type":"journal-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T06:02:26Z","timestamp":1623736946000},"page":"931-963","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards a reliable implementation of least-squares collocation for higher index differential-algebraic equations\u2014Part 1: basics and ansatz function choices"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4950-6646","authenticated-orcid":false,"given":"Michael","family":"Hanke","sequence":"first","affiliation":[]},{"given":"Roswitha","family":"M\u00e4rz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"1140_CR1","doi-asserted-by":"crossref","unstructured":"Albasiny, E.L. In: Childs, B., Scott, M., Daniel, J.W., Denman, E., Nelson, P. (eds.) : A Subroutine for Solving a System of Differential Equations in Chebyshev Series, pp 280\u2013286. Springer-Verlag, Berlin Heidelberg New York (1979)","DOI":"10.1007\/3-540-09554-3_24"},{"key":"1140_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1137\/0908047","volume":"8","author":"U Ascher","year":"1987","unstructured":"Ascher, U., Bader, G.: A new basis implementation for a mixed order boundary-value ode solver. SIAM J. Sci. Statist. Comput. 8, 483\u2013500 (1987)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"1140_CR3","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1137\/0915056","volume":"15","author":"U Ascher","year":"1994","unstructured":"Ascher, U., Spiteri, R.: Collocation software for boundary-value differential-algebraic equations. SIAM J. Sci. Comput. 15, 938\u2013952 (1994)","journal-title":"SIAM J. Sci. Comput."},{"key":"1140_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0377-0427(01)00382-X","volume":"138","author":"R Barrio","year":"2002","unstructured":"Barrio, R.: Rounding error bounds for Clenshaw and Forsythe algoritms for the evaluation of orthogonal polynomial series. J. Comp. Appl. Math. 138, 185\u2013204 (2002)","journal-title":"J. Comp. Appl. Math."},{"key":"1140_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/PL00005392","volume":"85","author":"B Beckermann","year":"2000","unstructured":"Beckermann, B.: The condition number of real Vandermonde, Krylov and positive definite Hankel matrices. Numer. Math. 85, 553\u2013577 (2000)","journal-title":"Numer. Math."},{"key":"1140_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s002110050099","volume":"69","author":"SL Campbell","year":"1995","unstructured":"Campbell, S.L., Moore, E.: Constraint preserving integrators for general nonlinear higher index DAEs. Num. Math. 69, 383\u2013399 (1995)","journal-title":"Num. Math."},{"key":"1140_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems. Fundamentals of Algorithms","author":"TA Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. Fundamentals of Algorithms. SIAM, Philadelphia (2006)"},{"issue":"1","key":"1140_CR8","first-page":"8:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A.: Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization. ACM Trans. Math. Softw. 38 (1), 8:1\u20138:22 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"1140_CR9","doi-asserted-by":"crossref","unstructured":"Deuflhard, P., Hohmann, A.: Numerische Mathematik 1. Eine algorithmisch orientierte Einf\u00fchrung. De Gruyter, Berlin, Boston, 5 auflage edition (2019)","DOI":"10.1515\/9783110614329"},{"key":"1140_CR10","volume-title":"Chebfun Guide","author":"TA Driscoll","year":"2014","unstructured":"Driscoll, T.A., Hale, N., Trefethen, L.N.: Chebfun Guide. Pafnuty Publications, Oxford (2014)"},{"key":"1140_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626357","volume-title":"A Practical Guide to Pseudospectral Methods","author":"B Fornberg","year":"1996","unstructured":"Fornberg, B.: A Practical Guide to Pseudospectral Methods. Cambridge University Press, Cambridge (1996)"},{"issue":"1","key":"1140_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1017\/S0962492900002440","volume":"3","author":"B Fornberg","year":"1994","unstructured":"Fornberg, B., Sloan, D.M.: A review of pseudospectral methods for solving partial differential equations. Acta Numerica 3(1), 203\u2013267 (1994)","journal-title":"Acta Numerica"},{"key":"1140_CR13","volume-title":"Chebyshev Polynomials in Numerical Analysis. Oxford Mathematical Handbooks","author":"L Fox","year":"1968","unstructured":"Fox, L., Parker, I.B.: Chebyshev Polynomials in Numerical Analysis. Oxford Mathematical Handbooks. Oxford University Press, London (1968)"},{"key":"1140_CR14","unstructured":"Galassi, M., et al: GNU Scientific Library Reference Manual. Network Theory Ltd. 3rd edition edition. Version 2.6. (2009)"},{"issue":"\/53","key":"1140_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0024-3795(83)80020-2","volume":"52","author":"W Gautschi","year":"1983","unstructured":"Gautschi, W.: The condition of Vandermonde-like matrices involving orthogonal polynomials. Linear Algebra Appl. 52(\/53), 293\u2013300 (1983)","journal-title":"Linear Algebra Appl."},{"key":"1140_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0378-4754(00)00179-8","volume":"54","author":"W Gautschi","year":"2000","unstructured":"Gautschi, W.: Gauss-Radau formulae for Jacobi and Laguerre weight functions. Math. Comput. Simul. 54, 403\u2013412 (2000)","journal-title":"Math. Comput. Simul."},{"key":"1140_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1016689830453","volume":"25","author":"W Gautschi","year":"2000","unstructured":"Gautschi, W.: High-order Gauss-Lobatto formulae. Numer. Algorithm. 25, 213\u2013222 (2000)","journal-title":"Numer. Algorithm."},{"key":"1140_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10543-010-0293-1","volume":"51","author":"W Gautschi","year":"2011","unstructured":"Gautschi, W.: Optimally scaled and optimally conditioned Vandermonde and Vandermonde-like matrices. BIT Numer. Math. 51, 103\u2013125 (2011)","journal-title":"BIT Numer. Math."},{"key":"1140_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01398878","volume":"52","author":"W Gautschi","year":"1988","unstructured":"Gautschi, W., Inglese, G.: Lower bounds for the condition number of Vandermonde matrices. Numer. Math. 52, 241\u2013250 (1988)","journal-title":"Numer. Math."},{"key":"1140_CR20","doi-asserted-by":"crossref","unstructured":"Gladwell, I.: The development of the boundary-value codes in the ordinary differential equations chapter of the NAG library. In: Childs, B., Scott, M., Daniel, J.W., Denman, E., Nelson, P. (eds.) Codes for Boundary-Value Problems in Ordinary Differential Equations, volume 76 of Lecture Notes in Coputer Science, pp 122\u2013143. Springer-Verlag, Berlin, Heidelberg New York (1979)","DOI":"10.1007\/3-540-09554-3_8"},{"key":"1140_CR21","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. Comp. 23, 221\u2013230 (1969)","journal-title":"Math. Comp."},{"key":"1140_CR22","unstructured":"Guennebaud, G., Jacob, B., et al.: Eigen v3. http:\/\/eigen.tuxfamily.org(2010)"},{"key":"1140_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4442-4","volume-title":"Numerical Mathematics","author":"G H\u00e4mmerlin","year":"1991","unstructured":"H\u00e4mmerlin, G., Hoffman, K.-H.: Numerical Mathematics. Springer Verlag, New York (1991)"},{"key":"1140_CR24","unstructured":"Hanke, M., M\u00e4rz, R.: Towards a reliable implementation of least-squares collocation for higher-index linear differential-algebaic equations. Part 2: The discrete least-squares problem. Numerical Algorithms. submitted"},{"key":"1140_CR25","doi-asserted-by":"publisher","first-page":"112514","DOI":"10.1016\/j.cam.2019.112514","volume":"387","author":"M Hanke","year":"2021","unstructured":"Hanke, M., M\u00e4rz, R.: Convergence analysis of least-squares collocation metods for nonlinear higher-index differential-algebraic equations. J. Comp. Appl. Math. 387, 112514 (2021)","journal-title":"J. Comp. Appl. Math."},{"key":"1140_CR26","doi-asserted-by":"publisher","first-page":"112520","DOI":"10.1016\/j.cam.2019.112520","volume":"387","author":"M Hanke","year":"2021","unstructured":"Hanke, M., M\u00e4rz, R.: A reliable direct numerical treatment of differential-algebraic equations by overdetermined collocation An operator approach. J. Comp. Appl. Math. 387, 112520 (2021)","journal-title":"J. Comp. Appl. Math."},{"issue":"318","key":"1140_CR27","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1090\/mcom\/3393","volume":"88","author":"M Hanke","year":"2019","unstructured":"Hanke, M., M\u00e4rz, R., Tischendorf, C.: Least-squares collocation for higher-index linear differential-algebaic equations: Estimating the stability threshold. Math. Comp. 88(318), 1647\u20131683 (2019). https:\/\/doi.org\/10.1090\/mcom\/3393","journal-title":"Math. Comp."},{"key":"1140_CR28","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.cam.2016.12.017","volume":"317","author":"M Hanke","year":"2017","unstructured":"Hanke, M., M\u00e4rz, R., Tischendorf, C., Weinm\u00fcller, E., Wurm, S.: Least-squares collocation for linear higher-index differential-algebraic equations. J. Comput. Appl Math. 317, 403\u2013431 (2017). https:\/\/doi.org\/10.1016\/j.cam.2016.12.017","journal-title":"J. Comput. Appl Math."},{"key":"1140_CR29","volume-title":"Introduction to Numerical Analysis","author":"FB Hildebrand","year":"1956","unstructured":"Hildebrand, F.B.: Introduction to Numerical Analysis. McGraw-Hill, New York (1956)"},{"key":"1140_CR30","first-page":"1","volume":"93","author":"BA Ibrahimoglu","year":"2016","unstructured":"Ibrahimoglu, B.A.: Lebesgue functions constants in polynomial interpolation. J. Lebesgue Inequal. Appl. 93, 1\u201315 (2016)","journal-title":"J. Lebesgue Inequal. Appl."},{"key":"1140_CR31","unstructured":"Kitzhofer, G., Koch, O., Pulverer, G., Simon, C.h., Weinm\u00fcller, E.: BVPSUITE a new MATLAB solver for singular implicit boundary value problems. ASC Report 35 Vienna University of Technology (2009)"},{"key":"1140_CR32","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1090\/S0025-5718-09-02267-4","volume":"79","author":"O Koch","year":"2010","unstructured":"Koch, O., M\u00e4rz, R., Praetorius, D., Weinm\u00fcller, E., et al: Collocation methods for index-1 daes with singularities of the first kind. Math. Comp. 79, 281\u2013304 (2010)","journal-title":"Math. Comp."},{"key":"1140_CR33","doi-asserted-by":"crossref","unstructured":"Lamour, R., M\u00e4rz, R., C. Tischendorf. In: Ilchmann, A., Reis, T. (eds.) : Differential-Algebraic Equations: A Projector Based Analysis. Differential-Algebraic Equations Forum. Springer-Verlag, Berlin Heidelberg New York Dordrecht London (2013)","DOI":"10.1007\/978-3-642-27555-5"},{"key":"1140_CR34","doi-asserted-by":"crossref","unstructured":"Lamour, R., M\u00e4rz, R., Weinm\u00fcller, E. In: Ilchmann, A., Reis, T. (eds.) : Surveys in Differential-Algebraic Equations III, chapter Boundary-Value Problems for Differential-Algebraic Equations: A Survey: Differential-Algebraic Equations Forum, pp 177\u2013309. Springer Heidelberg, New York (2015)","DOI":"10.1007\/978-3-319-22428-2_4"},{"issue":"3","key":"1140_CR35","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0041-5553(65)90149-7","volume":"5","author":"V-I Lebedev","year":"1965","unstructured":"Lebedev, V.-I., Barburin, O.V.: Calculation of principal values, weights and nodes of the Gauss quadrature formulae of integrals. U.S.S.R Comput. Math. Math. Phys. 5(3), 81\u201392 (1965)","journal-title":"U.S.S.R Comput. Math. Math. Phys."},{"key":"1140_CR36","doi-asserted-by":"crossref","unstructured":"M\u00e4rz, R. In: Ilchmann, A., Reis, T. (eds.) : Surveys in Differential-Algebraic Equations II, chapter Differential-Algebraic Equations from a Functional-Analytic Viewpoint: A Survey: Differential-Algebraic Equations Forum, pp 163\u2013285. Springer Heidelberg, New York (2015)","DOI":"10.1007\/978-3-319-11050-9_4"},{"key":"1140_CR37","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1090\/S0025-5718-1963-0158540-4","volume":"17","author":"HH Michaels","year":"1963","unstructured":"Michaels, H.H.: Abscissas weight coefficients for Lobatto quadrature. Math Comp 17, 237\u2013244 (1963)","journal-title":"Math Comp"},{"issue":"1","key":"1140_CR38","first-page":"26","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on Stirling\u2019s formula. Amer. Math. Monthly 62(1), 26\u201329 (1955)","journal-title":"Amer. Math. Monthly"},{"issue":"3","key":"1140_CR39","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1023\/A:1022001931526","volume":"42","author":"A Smoktunowicz","year":"2002","unstructured":"Smoktunowicz, A.: Backward stability of Clenshaw\u2019s algorithm. BIT Numer. Math. 42(3), 600\u2013610 (2002)","journal-title":"BIT Numer. Math."},{"key":"1140_CR40","unstructured":"Stallman, R.M., GCC Developers Community, et al: Using the Gnu Compiler collection. CreateSpace, Scotts Valley (2009)"},{"key":"1140_CR41","volume-title":"Numerische Mathematik 1. Springer-Lehrbuch","author":"J Stoer","year":"1989","unstructured":"Stoer, J.: Numerische Mathematik 1. Springer-Lehrbuch. Springer-Verlag, Berlin, Heidelberg, New York, London, Paris Tokyo HongKong (1989). f\u00fcnfte, verbesserte auflage edition"},{"key":"1140_CR42","unstructured":"The Numerical Algorithms Group (NAG). The nag library for fortran (2019)"},{"key":"1140_CR43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719598","volume-title":"Spectral methods in MATLAB","author":"LN Trefethen","year":"2000","unstructured":"Trefethen, L.N.: Spectral methods in MATLAB. SIAM, Philadelphia (2000)"},{"key":"1140_CR44","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0021-9045(91)90090-W","volume":"65","author":"LN Trefethen","year":"1991","unstructured":"Trefethen, L.N., Weideman, J.A.C.: Two results on polynomial interpolation in equally spaced points. J Approx. Theory 65, 247\u2013260 (1991)","journal-title":"J Approx. Theory"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01140-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T17:18:17Z","timestamp":1643995097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01140-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1140"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01140-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"25 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}