{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T19:10:16Z","timestamp":1778699416537,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/R029423\/1"],"award-info":[{"award-number":["EP\/R029423\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V001345\/1"],"award-info":[{"award-number":["EP\/V001345\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-15-1-0222"],"award-info":[{"award-number":["W911NF-15-1-0222"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-15-1-0222"],"award-info":[{"award-number":["W911NF-15-1-0222"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1848508"],"award-info":[{"award-number":["DMS-1848508"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/R029423\/1"],"award-info":[{"award-number":["EP\/R029423\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V001345\/1"],"award-info":[{"award-number":["EP\/V001345\/1"]}],"id":[{"id":"10.13039\/501100000266","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":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As the use of spectral\/<jats:italic>hp<\/jats:italic> element methods, and high-order finite element methods in general, continues to spread, community efforts to create efficient, optimized algorithms associated with fundamental high-order operations have grown. Core tasks such as solution expansion evaluation at quadrature points, stiffness and mass matrix generation, and matrix assembly have received tremendous attention.  With the expansion of the types of problems to which high-order methods are applied, and correspondingly the growth in types of numerical tasks accomplished through high-order methods, the number and types of these core operations broaden. This work focuses on solution expansion evaluation at arbitrary points within an element. This operation is core to many postprocessing applications such as evaluation of streamlines and pathlines, as well as to field projection techniques such as mortaring. We expand barycentric interpolation techniques developed on an interval to 2D (triangles and quadrilaterals) and 3D (tetrahedra, prisms, pyramids, and hexahedra) spectral\/<jats:italic>hp<\/jats:italic> element methods. We provide efficient algorithms for their implementations, and demonstrate their effectiveness using the spectral\/<jats:italic>hp<\/jats:italic> element library <jats:italic>Nektar++<\/jats:italic> by running a series of baseline evaluations against the \u2018standard\u2019 Lagrangian method, where an interpolation matrix is generated and matrix-multiplication applied to evaluate a point at a given location. We present results from a rigorous series of benchmarking tests for a variety of element shapes, polynomial orders and dimensions. We show that when the point of interest is to be repeatedly evaluated, the barycentric method performs at worst <jats:inline-formula><jats:alternatives><jats:tex-math>$$50\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>50<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> slower, when compared to a cached matrix evaluation. However, when the point of interest changes repeatedly so that the interpolation matrix must be regenerated in the \u2018standard\u2019 approach, the barycentric method yields far greater performance, with a minimum speedup factor of <jats:inline-formula><jats:alternatives><jats:tex-math>$$7\\times $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>7<\/mml:mn>\n                    <mml:mo>\u00d7<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Furthermore, when derivatives of the solution evaluation are also required, the barycentric method in general slightly outperforms the cached interpolation matrix method across all elements and orders, with an up to <jats:inline-formula><jats:alternatives><jats:tex-math>$$30\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>30<\/mml:mn>\n                    <mml:mo>%<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> speedup. Finally we investigate a real-world example of scalar transport using a non-conformal discontinuous Galerkin simulation, in which we observe around <jats:inline-formula><jats:alternatives><jats:tex-math>$$6\\times $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>6<\/mml:mn>\n                    <mml:mo>\u00d7<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> speedup in computational time for the barycentric method compared to the matrix-based approach. We also explore the complexity of both interpolation methods and show that the barycentric interpolation method requires <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}(k)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>k<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> storage compared to a best case space complexity of <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}(k^2)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>k<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for the Lagrangian interpolation matrix method.<\/jats:p>","DOI":"10.1007\/s10915-021-01750-2","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:03:23Z","timestamp":1641812603000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Barycentric-Based Evaluation Over Spectral\/hp Elements"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6040-6681","authenticated-orcid":false,"given":"Edward","family":"Laughton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vidhi","family":"Zala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akil","family":"Narayan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert M.","family":"Kirby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Moxey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"key":"1750_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0036144502417715","volume":"46","author":"JP Berrut","year":"2004","unstructured":"Berrut, J.P., Trefethen, L.N.: Barycentric lagrange interpolation. SIAM Rev. 46, 501\u2013517 (2004)","journal-title":"SIAM Rev."},{"key":"1750_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.cpc.2015.02.008","volume":"192","author":"CD Cantwell","year":"2015","unstructured":"Cantwell, C.D., Moxey, D., Comerford, A., Bolis, A., Rocco, G., Mengaldo, G., De Grazia, D., Yakovlev, S., Lombard, J.E., Ekelschot, D., Jordi, B., Xu, H., Mohamied, Y., Eskilsson, C., Nelson, B., Vos, P., Biotto, C., Kirby, R.M., Sherwin, S.J.: Nektar++: An open-source spectral\/hp element framework. Comput. Phys. Commun. 192, 205\u2013219 (2015). https:\/\/doi.org\/10.1016\/j.cpc.2015.02.008","journal-title":"Comput. Phys. Commun."},{"issue":"119","key":"1750_CR3","doi-asserted-by":"publisher","first-page":"20160234","DOI":"10.1098\/rsif.2016.0234","volume":"13","author":"K Chooi","year":"2016","unstructured":"Chooi, K., Comerford, A., Sherwin, S., Weinberg, P.: Intimal and medial contributions to the hydraulic resistance of the arterial wall at different pressures: a combined computational and experimental study. J. R. Soc. Interface 13(119), 20160234 (2016)","journal-title":"J. R. Soc. Interface"},{"issue":"51","key":"1750_CR4","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1090\/S0025-5718-1955-0071856-0","volume":"9","author":"CW Clenshaw","year":"1955","unstructured":"Clenshaw, C.W.: A note on the summation of Chebyshev series. Math. Comput. 9(51), 118\u2013120 (1955)","journal-title":"Math. Comput."},{"key":"1750_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546792","volume-title":"High Order Methods for Incompressible Fluid Flow","author":"M Deville","year":"2002","unstructured":"Deville, M., Mund, E., Fischer, P.: High Order Methods for Incompressible Fluid Flow. Cambridge University Press, Cambridge (2002)"},{"key":"1750_CR6","volume-title":"Nodal discontinuous Galerkin methods: algorithms. Analysis and Applications","author":"JS Hesthaven","year":"2007","unstructured":"Hesthaven, J.S., Warburton, T.: Nodal discontinuous Galerkin methods: algorithms. Analysis and Applications. Springer, New York, NY (2007)"},{"key":"1750_CR7","doi-asserted-by":"crossref","unstructured":"H.T.\u00a0Huynh, Z.W., Vincent, P.: High-order methods for computational fluid dynamics: a brief review of compact differential formulations on unstructured grids. Computers & Fluids 98, 209\u2013220 (2014)","DOI":"10.1016\/j.compfluid.2013.12.007"},{"key":"1750_CR8","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s10915-019-00954-x","volume":"80","author":"A Jallepalli","year":"2019","unstructured":"Jallepalli, A., Kirby, R.M.: Efficient algorithms for the line-SIAC filter. J. Sci. Comput. 80, 743\u2013761 (2019)","journal-title":"J. Sci. Comput."},{"key":"1750_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/TVCG.2019.2934338","volume":"26","author":"A Jallepalli","year":"2020","unstructured":"Jallepalli, A., Levine, J.A., Kirby, R.M.: The effect of data transformation methodologies on the topological analysis of high-order FEM solutions. IEEE Trans. Vis. Comput. Graph. 26, 162\u2013172 (2020)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"1750_CR10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528692.001.0001","volume-title":"Spectral\/hp Element Methods for Computational Fluid Dynamics","author":"G Karniadakis","year":"2005","unstructured":"Karniadakis, G., Sherwin, S.: Spectral\/hp Element Methods for Computational Fluid Dynamics, 2nd edn. Oxford University Press, Oxford (2005)","edition":"2"},{"key":"1750_CR11","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/16M1062569","volume":"59","author":"M Kelly","year":"2017","unstructured":"Kelly, M.: An introduction to trajectory optimization: How to do your own direct collocation. SIAM Rev. 59, 849\u2013904 (2017)","journal-title":"SIAM Rev."},{"key":"1750_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.cma.2021.113820","volume":"381","author":"E Laughton","year":"2021","unstructured":"Laughton, E., Tabor, G., Moxey, D.: A comparison of interpolation techniques for non-conformal high-order discontinuous Galerkin methods. Comput. Methods Appl. Mech. Eng. 381, 381\u2013113820 (2021). https:\/\/doi.org\/10.1016\/j.cma.2021.113820","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"2","key":"1750_CR13","doi-asserted-by":"publisher","first-page":"506","DOI":"10.2514\/1.J054181","volume":"54","author":"JEW Lombard","year":"2016","unstructured":"Lombard, J.E.W., Moxey, D., Sherwin, S.J., Hoessler, J.F.A., Dhandapani, S., Taylor, M.J.: Implicit large-eddy simulation of a wingtip vortex. AIAA J. 54(2), 506\u2013518 (2016)","journal-title":"AIAA J."},{"key":"1750_CR14","doi-asserted-by":"publisher","first-page":"C97","DOI":"10.1137\/19M1246523","volume":"43","author":"D Moxey","year":"2020","unstructured":"Moxey, D., Amici, R., Kirby, R.M.: Efficient matrix-free high-order finite element evaluation for simplicial elements. SIAM J. Sci. Comput. 43, C97-123 (2020)","journal-title":"SIAM J. Sci. Comput."},{"key":"1750_CR15","doi-asserted-by":"publisher","first-page":"107110","DOI":"10.1016\/j.cpc.2019.107110","volume":"249","author":"D Moxey","year":"2020","unstructured":"Moxey, D., Cantwell, C.D., Bao, Y., Cassinelli, A., Castiglioni, G., Chun, S., Juda, E., Kazemi, E., Lackhove, K., Marcon, J., Mengaldo, G., Serson, D., Turner, M., Xu, H., Peiro, J., Kirby, R.M., Sherwin, S.J.: Nektar++: enhancing the capability and application of high-fidelity spectral\/hp element methods. Comput. Phys. Commun. 249, 107110 (2020)","journal-title":"Comput. Phys. Commun."},{"issue":"2","key":"1750_CR16","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.jcp.2005.01.024","volume":"207","author":"S Sirisup","year":"2005","unstructured":"Sirisup, S., Karniadakis, G.E., Xiu, D., Kevrekidis, I.G.: Equation-free\/Galerkin-free POD-assisted computation of incompressible flows. J. Comput. Phys. 207(2), 568\u2013587 (2005)","journal-title":"J. Comput. Phys."},{"issue":"3","key":"1750_CR17","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1109\/TVCG.2008.9","volume":"14","author":"M Steffen","year":"2008","unstructured":"Steffen, M., Curtis, S., Kirby, R.M., Ryan, J.K.: Investigation of smoothness-increasing accuracy-conserving filters for improving streamline integration through discontinuous fields. IEEE Trans. Vis. Comput. Graph. 14(3), 680\u2013692 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01750-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-021-01750-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01750-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T17:07:00Z","timestamp":1643130420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-021-01750-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1750"],"URL":"https:\/\/doi.org\/10.1007\/s10915-021-01750-2","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"5 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","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 no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All code is available in the <i>Nektar++<\/i> repository at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability"}}],"article-number":"78"}}