Efficient Construction of T-Mesh Bases via a Constraint Transformation Matrix

This paper addresses the treatment of large T-elements, based on Lagrange interpolation, through the application of constraints along the horizontal and vertical mesh lines of a quadrilateral patch. Instead of resorting to manual or symbolic factorization to determine explicit closed-form expressions of the shape functions, we propose constructing a transformation matrix and applying it directly to the background tensor-product grid, thereby establishing a linear relationship between the active (primary or master) and the auxiliary (secondary or slave) degrees of freedom. Software implementation is greatly simplified when all data (boundary conditions, slave-node definitions, etc.) refer directly to the background tensor-product mesh, while the subsequent computation of the corresponding nodal values streamlines post-processing operations. Representative numerical examples illustrate the correctness of the proposed formulation and demonstrate its practical effectiveness in the analysis of field, elasticity and eigenvalue problems.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2026-10-13
DOI
https://doi.org/10.3390/axioms15100763
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Construction of T-Mesh Bases via a Constraint Transformation Matrix

Christopher G. Provatidis
Axioms
Advanced Numerical Methods in Computational Mathematics
article

Efficient Construction of T-Mesh Bases via a Constraint Transformation Matrix

Christopher G. Provatidis
article en

Abstract

This paper addresses the treatment of large T-elements, based on Lagrange interpolation, through the application of constraints along the horizontal and vertical mesh lines of a quadrilateral patch. Instead of resorting to manual or symbolic factorization to determine explicit closed-form expressions of the shape functions, we propose constructing a transformation matrix and applying it directly to the background tensor-product grid, thereby establishing a linear relationship between the active (primary or master) and the auxiliary (secondary or slave) degrees of freedom. Software implementation is greatly simplified when all data (boundary conditions, slave-node definitions, etc.) refer directly to the background tensor-product mesh, while the subsequent computation of the corresponding nodal values streamlines post-processing operations. Representative numerical examples illustrate the correctness of the proposed formulation and demonstrate its practical effectiveness in the analysis of field, elasticity and eigenvalue problems.

AxiomsVol. 15(10)
National Technical University of Athens (GR)
Openalex Percentile: Top 19%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.