{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T01:47:44Z","timestamp":1782092864695,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:00:00Z","timestamp":1777248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:00:00Z","timestamp":1777248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["759001"],"award-info":[{"award-number":["759001"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["326309100"],"award-info":[{"award-number":["326309100"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["101105786"],"award-info":[{"award-number":["101105786"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We propose a matrix-free inexact preconditioning strategy for elliptic partial differential equations discretized by the isogeometric Galerkin method on tensor-product spline spaces. We base our preconditioner on an approximation of the discrete linear operator by a sum of Kronecker product matrices. The action of its inverse on a vector of coefficients is approximated by an inner preconditioned conjugate gradient solve. The forward problem is solved by the inexact preconditioned conjugate gradient method. The complexity of the Kronecker matrix-vector products in the inner iteration is lower than the complexity of the matrix-vector products in the forward problem, leading to a reduced number of iterations and significant performance gains. We show the robustness, efficiency and effectiveness of our approach in test problems involving the Poisson equation and linear elasticity, and illustrate the performance gain with respect to preconditioning techniques based on fast diagonalization. The proposed method is implemented in our open-source  framework for spline based discretization methods.<\/jats:p>","DOI":"10.1007\/s10915-026-03253-4","type":"journal-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T16:15:19Z","timestamp":1777306519000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matrix-Free Inexact Preconditioning Techniques for Isogeometric Tensor-Product Discretizations"],"prefix":"10.1007","volume":"107","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3222-9179","authenticated-orcid":false,"given":"Micha\u0142 \u0141.","family":"Mika","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0179-9606","authenticated-orcid":false,"given":"Ren\u00e9 R.","family":"Hiemstra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9068-6311","authenticated-orcid":false,"given":"Dominik","family":"Schillinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,27]]},"reference":[{"issue":"1","key":"3253_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0377-0427(00)00393-9","volume":"123","author":"CFV Loan","year":"2000","unstructured":"Loan, C.F.V.: The ubiquitous Kronecker product. J. Comput. Appl. Math. 123(1), 85\u2013100 (2000). https:\/\/doi.org\/10.1016\/S0377-0427(00)00393-9","journal-title":"J. Comput. Appl. Math."},{"key":"3253_CR2","unstructured":"Bressan, A., Takacs, S.: Sum-factorization techniques in Isogeometric Analysis (2018). https:\/\/hal.science\/hal-01874006"},{"key":"3253_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cma.2019.06.020","volume":"355","author":"RR Hiemstra","year":"2019","unstructured":"Hiemstra, R.R., Sangalli, G., Tani, M., Calabr\u00f2, F., Hughes, T.J.R.: Fast formation and assembly of finite element matrices with application to isogeometric linear elasticity. Comput. Methods Appl. Mech. Eng. 355, 234\u2013260 (2019). https:\/\/doi.org\/10.1016\/j.cma.2019.06.020","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"6","key":"3253_CR4","doi-asserted-by":"publisher","first-page":"3644","DOI":"10.1137\/16M1062788","volume":"38","author":"G Sangalli","year":"2016","unstructured":"Sangalli, G., Tani, M.: Isogeometric Preconditioners Based on Fast Solvers for the Sylvester Equation. SIAM J. Sci. Comput. 38(6), 3644\u20133671 (2016). https:\/\/doi.org\/10.1137\/16M1062788","journal-title":"SIAM J. Sci. Comput."},{"key":"3253_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2023.116397","volume":"417","author":"B Marussig","year":"2023","unstructured":"Marussig, B., Hiemstra, R., Schillinger, D.: Fast immersed boundary method based on weighted quadrature. Comput. Methods Appl. Mech. Eng. 417, 116397 (2023). https:\/\/doi.org\/10.1016\/j.cma.2023.116397","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2025.118700","volume":"452","author":"M\u0141 Mika","year":"2026","unstructured":"Mika, M.\u0141, Hiemstra, R.R., Stoter, S.K.F., Schillinger, D.: A data-driven approach to cut-cell quadrature using spline interpolation. Comput. Methods Appl. Mech. Eng. 452, 118700 (2026). https:\/\/doi.org\/10.1016\/j.cma.2025.118700","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.cma.2014.09.014","volume":"284","author":"A Mantzaflaris","year":"2015","unstructured":"Mantzaflaris, A., J\u00fcttler, B.: Integration by interpolation and look-up for Galerkin-based isogeometric analysis. Comput. Methods Appl. Mech. Eng. 284, 373\u2013400 (2015). https:\/\/doi.org\/10.1016\/j.cma.2014.09.014","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2020.113005","volume":"366","author":"M Pan","year":"2020","unstructured":"Pan, M., J\u00fcttler, B., Giust, A.: Fast formation of isogeometric Galerkin matrices via integration by interpolation and look-up. Comput. Methods Appl. Mech. Eng. 366, 113005 (2020). https:\/\/doi.org\/10.1016\/j.cma.2020.113005","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR9","doi-asserted-by":"publisher","unstructured":"Mika, M.\u0141., Hiemstra, R.R., Schillinger, D., Hughes, T.J.R.: A Comparison of Matrix-Free Isogeometric Galerkin and Collocation Methods for Karhunen\u2013Lo\u00e8ve Expansion, pp. 329\u2013341. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-87312-7_32","DOI":"10.1007\/978-3-030-87312-7_32"},{"key":"3253_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2021.113730","volume":"379","author":"M\u0141 Mika","year":"2021","unstructured":"Mika, M.\u0141, Hughes, T.J.R., Schillinger, D., Wriggers, P., Hiemstra, R.R.: A matrix-free isogeometric Galerkin method for Karhunen-Lo\u00e8ve approximation of random fields using tensor product splines, tensor contraction and interpolation based quadrature. Comput. Methods Appl. Mech. Eng. 379, 113730 (2021). https:\/\/doi.org\/10.1016\/j.cma.2021.113730","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR11","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.cma.2018.04.017","volume":"338","author":"M Montardini","year":"2018","unstructured":"Montardini, M., Sangalli, G., Tani, M.: Robust isogeometric preconditioners for the Stokes system based on the Fast Diagonalization method. Comput. Methods Appl. Mech. Eng. 338, 162\u2013185 (2018). https:\/\/doi.org\/10.1016\/j.cma.2018.04.017","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"7","key":"3253_CR12","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.camwa.2017.06.013","volume":"74","author":"M Tani","year":"2017","unstructured":"Tani, M.: A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis. Computers & Mathematics with Applications 74(7), 1690\u20131702 (2017). https:\/\/doi.org\/10.1016\/j.camwa.2017.06.013","journal-title":"Computers & Mathematics with Applications"},{"key":"3253_CR13","doi-asserted-by":"publisher","unstructured":"Loli, G., Sangalli, G., Tani, M.: Easy and efficient preconditioning of the isogeometric mass matrix. Comput. Math. Appl. 116(C), 245\u2013264 (2022). https:\/\/doi.org\/10.1016\/j.camwa.2020.12.009","DOI":"10.1016\/j.camwa.2020.12.009"},{"key":"3253_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2023.116157","volume":"414","author":"J Cornejo Fuentes","year":"2023","unstructured":"Cornejo Fuentes, J., Elguedj, T., Dureisseix, D., Duval, A.: A cheap preconditioner based on fast diagonalization method for matrix-free weighted-quadrature isogeometric analysis applied to nonlinear transient heat transfer problems. Comput. Methods Appl. Mech. Eng. 414, 116157 (2023). https:\/\/doi.org\/10.1016\/j.cma.2023.116157","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR15","doi-asserted-by":"publisher","unstructured":"Mantzaflaris, A., J\u00fcttler, B., Khoromskij, B.N., Langer, U.: Matrix Generation in Isogeometric Analysis by Low Rank Tensor Approximation. In: Boissonnat, J.-D., Cohen, A., Gibaru, O., Gout, C., Lyche, T., Mazure, M.-L., Schumaker, L.L. (eds.) Curves and Surfaces, pp. 321\u2013340. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22804-4_24","DOI":"10.1007\/978-3-319-22804-4_24"},{"key":"3253_CR16","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.cma.2016.11.013","volume":"316","author":"A Mantzaflaris","year":"2017","unstructured":"Mantzaflaris, A., J\u00fcttler, B., Khoromskij, B.N., Langer, U.: Low rank tensor methods in Galerkin-based isogeometric analysis. Comput. Methods Appl. Mech. Eng. 316, 1062\u20131085 (2017). https:\/\/doi.org\/10.1016\/j.cma.2016.11.013","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR17","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.cam.2019.03.002","volume":"358","author":"I Georgieva","year":"2019","unstructured":"Georgieva, I., Hofreither, C.: Greedy low-rank approximation in Tucker format of solutions of tensor linear systems. J. Comput. Appl. Math. 358, 206\u2013220 (2019). https:\/\/doi.org\/10.1016\/j.cam.2019.03.002","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"3253_CR18","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/18M1227238","volume":"42","author":"A B\u00fcnger","year":"2020","unstructured":"B\u00fcnger, A., Dolgov, S., Stoll, M.: A Low-Rank Tensor Method for PDE-Constrained Optimization with Isogeometric Analysis. SIAM J. Sci. Comput. 42(1), 140\u2013161 (2020). https:\/\/doi.org\/10.1137\/18M1227238","journal-title":"SIAM J. Sci. Comput."},{"key":"3253_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2023.116472","volume":"417","author":"M Montardini","year":"2023","unstructured":"Montardini, M., Sangalli, G., Tani, M.: A low-rank isogeometric solver based on Tucker tensors. Comput. Methods Appl. Mech. Eng. 417, 116472 (2023). https:\/\/doi.org\/10.1016\/j.cma.2023.116472","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"4","key":"3253_CR20","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S1064827597323415","volume":"21","author":"GH Golub","year":"1999","unstructured":"Golub, G.H., Ye, Q.: Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration. SIAM J. Sci. Comput. 21(4), 1305\u20131320 (1999). https:\/\/doi.org\/10.1137\/S1064827597323415","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"3253_CR21","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1137\/S1064827599362314","volume":"22","author":"Y Notay","year":"2000","unstructured":"Notay, Y.: Flexible Conjugate Gradients. SIAM J. Sci. Comput. 22(4), 1444\u20131460 (2000). https:\/\/doi.org\/10.1137\/S1064827599362314","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"3253_CR22","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1137\/060675290","volume":"29","author":"AV Knyazev","year":"2008","unstructured":"Knyazev, A.V., Lashuk, I.: Steepest Descent and Conjugate Gradient Methods with Variable Preconditioning. SIAM J. Matrix Anal. Appl. 29(4), 1267\u20131280 (2008). https:\/\/doi.org\/10.1137\/060675290","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3253_CR23","doi-asserted-by":"crossref","unstructured":"Derber, J., Rosati, A.: A Global Oceanic Data Assimilation System. J. Phys. Oceanogr. 19(9), 1333\u20131347 (1989). https:\/\/doi.org\/10.1175\/1520-0485(1989)019$$<$$1333:AGODAS$$>$$2.0.CO;2","DOI":"10.1175\/1520-0485(1989)019<1333:AGODAS>2.0.CO;2"},{"issue":"2","key":"3253_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/0914028","volume":"14","author":"Y Saad","year":"1993","unstructured":"Saad, Y.: A Flexible Inner-Outer Preconditioned GMRES Algorithm. SIAM J. Sci. Comput. 14(2), 461\u2013469 (1993). https:\/\/doi.org\/10.1137\/0914028","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"3253_CR25","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/nla.1680010404","volume":"1","author":"HA Vorst","year":"1994","unstructured":"Vorst, H.A., Vuik, C.: GMRESR: a family of nested GMRES methods. Numerical Linear Algebra with Applications 1(4), 369\u2013386 (1994). https:\/\/doi.org\/10.1002\/nla.1680010404","journal-title":"Numerical Linear Algebra with Applications"},{"issue":"2","key":"3253_CR26","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/S106482750037336X","volume":"23","author":"DB Szyld","year":"2001","unstructured":"Szyld, D.B., Vogel, J.A.: FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning. SIAM J. Sci. Comput. 23(2), 363\u2013380 (2001). https:\/\/doi.org\/10.1137\/S106482750037336X","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"3253_CR27","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.amc.2006.09.116","volume":"188","author":"JA Vogel","year":"2007","unstructured":"Vogel, J.A.: Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems. Appl. Math. Comput. 188(1), 226\u2013233 (2007). https:\/\/doi.org\/10.1016\/j.amc.2006.09.116","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"3253_CR28","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1137\/100786253","volume":"32","author":"LM Carvalho","year":"2011","unstructured":"Carvalho, L.M., Gratton, S., Lago, R., Vasseur, X.: A Flexible Generalized Conjugate Residual Method with Inner Orthogonalization and Deflated Restarting. SIAM J. Matrix Anal. Appl. 32(4), 1212\u20131235 (2011). https:\/\/doi.org\/10.1137\/100786253","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"3253_CR29","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s13160-023-00627-1","volume":"41","author":"N Kushida","year":"2024","unstructured":"Kushida, N., Okuda, H.: A performance evaluation of a new flexible preconditioning method on a parallel finite element structure analysis program. FrontISTR. Jpn. J. Ind. Appl. Math. 41(1), 723\u2013737 (2024). https:\/\/doi.org\/10.1007\/s13160-023-00627-1","journal-title":"FrontISTR. Jpn. J. Ind. Appl. Math."},{"key":"3253_CR30","doi-asserted-by":"publisher","unstructured":"Jutho, Getzdan, Lyon, S., Protter, M., S, M.P., Leo, Garrison, J., Otto, F., Saba, E., Iouchtchenko, D., Privett, A., Morley, A.: Jutho\/TensorOperations.jl: v1.1.0. Zenodo (2019). https:\/\/doi.org\/10.5281\/zenodo.3245497","DOI":"10.5281\/zenodo.3245497"},{"key":"3253_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.033315","volume":"90","author":"RNC Pfeifer","year":"2014","unstructured":"Pfeifer, R.N.C., Haegeman, J., Verstraete, F.: Faster identification of optimal contraction sequences for tensor networks. Phys. Rev. E 90, 033315 (2014). https:\/\/doi.org\/10.1103\/PhysRevE.90.033315","journal-title":"Phys. Rev. E"},{"issue":"5\u20138","key":"3253_CR32","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.cma.2008.12.004","volume":"199","author":"TJR Hughes","year":"2010","unstructured":"Hughes, T.J.R., Reali, A., Sangalli, G.: Efficient quadrature for NURBS-based isogeometric analysis. Comput. Methods Appl. Mech. Eng. 199(5\u20138), 301\u2013313 (2010). https:\/\/doi.org\/10.1016\/j.cma.2008.12.004","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR33","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cma.2012.04.014","volume":"249\u2013252","author":"F Auricchio","year":"2012","unstructured":"Auricchio, F., Calabr\u00f2, F., Hughes, T.J.R., Reali, A., Sangalli, G.: A simple algorithm for obtaining nearly optimal quadrature rules for NURBS-based isogeometric analysis. Comput. Methods Appl. Mech. Eng. 249\u2013252, 15\u201327 (2012). https:\/\/doi.org\/10.1016\/j.cma.2012.04.014","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cma.2014.04.008","volume":"277","author":"D Schillinger","year":"2014","unstructured":"Schillinger, D., Hossain, S.J., Hughes, T.J.R.: Reduced B\u00e9zier element quadrature rules for quadratic and cubic splines in isogeometric analysis. Comput. Methods Appl. Mech. Eng. 277, 1\u201345 (2014). https:\/\/doi.org\/10.1016\/j.cma.2014.04.008","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR35","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.cma.2016.02.034","volume":"305","author":"M Barto\u0148","year":"2016","unstructured":"Barto\u0148, M., Calo, V.M.: Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis. Comput. Methods Appl. Mech. Eng. 305, 217\u2013240 (2016). https:\/\/doi.org\/10.1016\/j.cma.2016.02.034","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR36","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1016\/j.cam.2015.09.036","volume":"296","author":"M Barto\u0148","year":"2016","unstructured":"Barto\u0148, M., Calo, V.M.: Gaussian quadrature for splines via homotopy continuation: Rules for $$C^2$$ cubic splines. J. Comput. Appl. Math. 296, 709\u2013723 (2016). https:\/\/doi.org\/10.1016\/j.cam.2015.09.036","journal-title":"J. Comput. Appl. Math."},{"key":"3253_CR37","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.cam.2017.02.022","volume":"322","author":"M Barto\u0148","year":"2017","unstructured":"Barto\u0148, M., Ait-Haddou, R., Calo, V.M.: Gaussian quadrature rules for $$C^1$$ quintic splines with uniform knot vectors. J. Comput. Appl. Math. 322, 57\u201370 (2017). https:\/\/doi.org\/10.1016\/j.cam.2017.02.022","journal-title":"J. Comput. Appl. Math."},{"key":"3253_CR38","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.cad.2016.07.003","volume":"82","author":"M Barto\u0148","year":"2017","unstructured":"Barto\u0148, M., Calo, V.M.: Gauss-Galerkin quadrature rules for quadratic and cubic spline spaces and their application to isogeometric analysis. Comput. Aided Des. 82, 57\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cad.2016.07.003","journal-title":"Comput. Aided Des."},{"key":"3253_CR39","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1016\/j.cma.2016.10.049","volume":"316","author":"RR Hiemstra","year":"2017","unstructured":"Hiemstra, R.R., Calabr\u00f2, F., Schillinger, D., Hughes, T.J.R.: Optimal and reduced quadrature rules for tensor product and hierarchically refined splines in isogeometric analysis. Comput. Methods Appl. Mech. Eng. 316, 966\u20131004 (2017). https:\/\/doi.org\/10.1016\/j.cma.2016.10.049","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR40","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cma.2016.04.030","volume":"316","author":"KA Johannessen","year":"2017","unstructured":"Johannessen, K.A.: Optimal quadrature for univariate and tensor product splines. Comput. Methods Appl. Mech. Eng. 316, 84\u201399 (2017). https:\/\/doi.org\/10.1016\/j.cma.2016.04.030","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR41","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.cma.2016.09.013","volume":"316","author":"F Calabr\u00f2","year":"2017","unstructured":"Calabr\u00f2, F., Sangalli, G., Tani, M.: Fast formation of isogeometric Galerkin matrices by weighted quadrature. Comput. Methods Appl. Mech. Eng. 316, 606\u2013622 (2017). https:\/\/doi.org\/10.1016\/j.cma.2016.09.013","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR42","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.cma.2017.08.028","volume":"328","author":"F Fahrendorf","year":"2018","unstructured":"Fahrendorf, F., De Lorenzis, L., Gomez, H.: Reduced integration at superconvergent points in isogeometric analysis. Comput. Methods Appl. Mech. Eng. 328, 390\u2013410 (2018). https:\/\/doi.org\/10.1016\/j.cma.2017.08.028","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR43","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.cma.2018.04.029","volume":"338","author":"G Sangalli","year":"2018","unstructured":"Sangalli, G., Tani, M.: Matrix-free weighted quadrature for a computationally efficient isogeometric $$k$$-method. Comput. Methods Appl. Mech. Eng. 338, 117\u2013133 (2018). https:\/\/doi.org\/10.1016\/j.cma.2018.04.029","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR44","unstructured":"Montardini, M.: Preconditioners for Isogeometric Analysis. PhD thesis, Universit\u00e0 degli Studi di Pavia (2019). https:\/\/hdl.handle.net\/11571\/1292126"},{"issue":"1","key":"3253_CR45","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/060676489","volume":"30","author":"BW Bader","year":"2008","unstructured":"Bader, B.W., Kolda, T.G.: Efficient MATLAB Computations with Sparse and Factored Tensors. SIAM J. Sci. Comput. 30(1), 205\u2013231 (2008). https:\/\/doi.org\/10.1137\/060676489","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"3253_CR46","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor Decompositions and Applications. SIAM Rev. 51(3), 455\u2013500 (2009). https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Rev."},{"issue":"39","key":"3253_CR47","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.cma.2004.10.008","volume":"194","author":"TJR Hughes","year":"2005","unstructured":"Hughes, T.J.R., Cottrell, J.A., Bazilevs, Y.: Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement. Comput. Methods Appl. Mech. Eng. 194(39), 4135\u20134195 (2005). https:\/\/doi.org\/10.1016\/j.cma.2004.10.008","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"3253_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.compscitech.2022.109292","volume":"220","author":"D Liu","year":"2022","unstructured":"Liu, D., Chi, H., Ma, C., Song, M., Zhang, P., Dai, P.: Improving in-plane and out-of-plane thermal conductivity of polyimide\/boron nitride film with reduced graphene oxide by a moving magnetic field induction. Compos. Sci. Technol. 220, 109292 (2022). https:\/\/doi.org\/10.1016\/j.compscitech.2022.109292","journal-title":"Compos. Sci. Technol."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03253-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03253-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03253-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T01:11:06Z","timestamp":1782090666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03253-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,27]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3253"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03253-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,27]]},"assertion":[{"value":"19 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2026","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 authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"81"}}