---
title: Polynomial Quasi-Trefftz Bases
url: https://www.emergentmind.com/topics/polynomial-quasi-trefftz-bases
type: topic
---

# Polynomial Quasi-Trefftz Bases

Searching arXiv for recent and foundational papers on polynomial quasi-Trefftz bases.
Polynomial quasi-Trefftz bases are local polynomial function systems tailored to a differential operator by enforcing that the PDE residual vanishes in a truncated Taylor sense at a chosen point, typically an element barycenter or center. They arise when classical Trefftz methods become unavailable because exact elementwise PDE solutions are inaccessible, notably for variable-coefficient problems. In this setting, the discrete functions are not exact local solutions but *approximate solutions* of controlled order, and the resulting spaces remain substantially smaller than full polynomial spaces while retaining the same local approximation order and high-order convergence in discontinuous Galerkin formulations [2011.04617], [2408.00392], [2505.18480].

## 1. Definition and conceptual position

Trefftz methods use discrete spaces made of elementwise exact solutions of the governing PDE. This is practical for many linear homogeneous equations with piecewise-constant coefficients, but it generally fails for smoothly varying coefficients because exact local polynomial solutions need not exist [2011.04617], [2312.09919], [2408.00392]. Polynomial quasi-Trefftz bases relax the Trefftz property by replacing exact local solvability with a Taylor-based residual cancellation condition.

For the acoustic wave equation in space-time, on each space-time element \(K\), the scalar quasi-Trefftz space of degree \(p\) is defined by
\[
{}^p(K) := \{ f\in\mathcal{P}^p(K) \mid D^\alpha(\Box_{\rho,G}f)(x_K,t_K)=0 \ \forall |\alpha|\le p-2 \},
\]
where \(\Box_{\rho,G}=\nabla\cdot(\rho^{-1}\nabla)-G\partial_t^2\), \(\mathcal{P}^p(K)\) denotes polynomials of total degree \(\le p\), and \((x_K,t_K)\) is the element barycenter [2011.04617]. This enforces that the Taylor polynomial of the residual vanishes through order \(p-2\).

The same idea extends to general scalar linear operators. For a linear differential operator
\[
L=\sum_{|\alpha|\le m}\alpha_\alpha(x)D^\alpha
\]
of order \(m\), with \(f\in C^{p-m}(E)\), the inhomogeneous local polynomial quasi-Trefftz space is
\[
{}^p_f(E):=\{\,v\in P^p(E): D^\alpha[L\,v](x_E)=D^\alpha f(x_E)\ \forall |\alpha|\le p-m\},
\]
and the homogeneous space is \({}^p_0(E)\) when \(f\equiv0\) [2408.00392]. A closely related abstract formulation defines the quasi-Trefftz operator
\[
D_p[\Pi]:=T_{p-\gamma}(L\Pi),
\]
for an operator \(L\) of order \(\gamma\), and then sets
\[
QT_p:=\ker D_p=\{\Pi\in P_p:T_{p-\gamma}(L\Pi)=0\},
\]
making the quasi-Trefftz space explicitly the kernel of a linear map between polynomial spaces [2505.18480].

This framework places polynomial quasi-Trefftz bases between exact Trefftz spaces and full polynomial spaces. They are equation-dependent like Trefftz spaces, but they remain available for smooth variable coefficients because they are defined through local Taylor jets rather than exact closed-form solutions [2011.04617], [2505.18480]. A plausible implication is that they should be understood less as a special basis family for one PDE class than as a general local residual-annihilation mechanism for high-order discretization.

## 2. Local spaces, dimension, and graded structure

A recurring property is that quasi-Trefftz spaces are much smaller than the ambient polynomial spaces of the same degree. For second-order scalar operators in \(d\) dimensions, both the general elliptic framework and the diffusion-advection-reaction construction give
\[
\dim QT_p=\binom{p+d}{d}-\binom{p+d-2}{d}
=\binom{p+d-1}{d-1}+\binom{p+d-2}{d-1},
\]
so in two dimensions \(\dim QT_p=2p+1\) [2312.09919], [2412.00806], [2505.18480]. This yields \(O(p^{d-1})\) local dimension rather than \(O(p^d)\) for the full degree-\(p\) polynomial space [2505.18480].

For the space-time wave equation, the local space has dimension
\[
N(n,p)=\binom{p+n}{n}+\binom{p-1+n}{n},
\]
with \(\dim {}^p(K)=2p+1\) for \(n=1\), and \(\dim {}^p(K)=(p+2)(p+1)(2p+3)/6\) for \(n=2\) [2011.04617]. For the time-dependent Schrödinger equation, the polynomial Trefftz space of anisotropic maximal degree \(\le p\) satisfies
\[
\dim T_p(K)=\dim P^{2p}(\mathbb{R}^d)=\binom{2p+d}{d},
\]
reflecting the mixed derivative structure of the PDE and the use of anisotropic degree \(|\alpha|+2j_t\) [2306.09571].

The linear-algebraic structure behind these dimensions is graded by homogeneous polynomial degree. In the general scalar framework, \(P_p=\bigoplus_{n=0}^p\widetilde{\mathcal P}_n\), and the quasi-Trefftz operator has block-triangular form with diagonal blocks given by the constant-coefficient principal part
\[
L_*[\cdot]=\sum_{|\alpha|=\gamma} c_\alpha(x_0)\partial^\alpha,
\]
acting from \(\widetilde{\mathcal P}_n\) to \(\widetilde{\mathcal P}_{n-\gamma}\) [2505.18480]. Surjectivity of these principal blocks yields surjectivity of the full operator onto \(P_{p-\gamma}\), and hence the dimension formula \(\dim QT_p=\dim P_p-\dim P_{p-\gamma}\) [2505.18480].

For systems, the structure can be more elaborate. In second-order time-harmonic Maxwell, the local Taylor-based quasi-Trefftz space \(QT_p\subset (P_p)^3\) is defined by
\[
T_{p-2}[\nabla\times\nabla\times \Pi-\varepsilon \Pi]=0^3,
\qquad
T_{p-1}[\nabla\cdot(\varepsilon \Pi)]=0,
\]
and its dimension is
\[
\dim QT_p=3p^2+10p-2,
\]
obtained via a Helmholtz decomposition of homogeneous vector polynomial fields [2509.00193]. This suggests that dimension formulas remain explicit even for systems, provided one can exploit an exact-sequence or graded decomposition structure.

## 3. Basis construction algorithms

Polynomial quasi-Trefftz bases are constructed locally, either by explicit recurrence on monomial coefficients or by nullspace extraction from a constraint matrix. The explicit-recursion route is the defining algorithmic feature of most polynomial quasi-Trefftz constructions.

For the wave equation in space-time, one prescribes Cauchy data at \(t=t_K\) from two spatial polynomial bases,
\[
b_J(\cdot,t_K)=\widehat b_J,\quad \partial_t b_J(\cdot,t_K)=0,
\]
or
\[
b_J(\cdot,t_K)=0,\quad \partial_t b_J(\cdot,t_K)=\widetilde b_{J-C(n,p)},
\]
and writes
\[
b_J(x,t)=\sum_{|\alpha|+k_t\le p} a_{\alpha,k_t}(x-x_K)^\alpha (t-t_K)^{k_t}.
\]
The constraints \(D^\beta \Box b_J(x_K,t_K)=0\) for \(|\beta|\le p-2\) become a linear recurrence among the coefficients \(a_{\alpha,k_t}\), allowing one to solve for \(a_{\alpha,k_t+2}\) from already known lower-time-derivative coefficients [2011.04617]. Proposition 4.3 in that work proves that the resulting functions are linearly independent and span the local quasi-Trefftz space [2011.04617].

For general scalar equations, the explicit algorithm of the elliptic framework assumes a non-degeneracy condition on the principal part, namely that the coefficient of \(\partial^m/\partial x_1^m\) does not vanish at the expansion point:
\[
\alpha_{m e_1}(x_E)\neq 0.
\]
One then chooses \(m\) Cauchy-data polynomials \(\psi_r(x')\in P^{p-r}(\mathbb R^{d-1})\) for \(r=0,\dots,m-1\), which determine all monomial coefficients with \(\alpha_1=r<m\), and recursively computes the remaining coefficients \(a_{\beta+m e_1}\) from derivatives of \(f\) and of the operator coefficients at \(x_E\) [2408.00392]. Proposition 2.3 states that all coefficients are determined uniquely [2408.00392].

The systematic scalar theory generalizes this further. It decomposes each homogeneous block into a free-data part \(U_n\) and a complementary part \(V_n\) on which the principal block is invertible, and then applies a forward-substitution procedure degree by degree. The resulting algorithm produces a minimal basis of \(\ker D_p\) in any dimension and for any equation order \(\gamma\) [2505.18480]. The cost model given there is asymptotically
\[
O(p^{2d-1}),
\]
which is substantially below a naive dense solve on the full polynomial space [2505.18480].

An alternative is to define the local space as the kernel of a weak constraint operator and compute a basis by SVD. In the embedded Trefftz DG method for Helmholtz, one starts from \(P_p(K)\), enforces
\[
\int_K(-\Delta u_h-\omega^2 u_h)\,q_h\,dx=0 \quad \forall q_h\in P_{p-2}(K),
\]
assembles the local constraint matrix \(C_K\), and extracts the nullspace basis vectors from a thin singular-value decomposition \(C_K=U\Sigma V^*\) [2603.13034]. This avoids explicit symbolic basis construction. Although the paper is framed as an embedded Trefftz strategy rather than a Taylor-based construction, its local nullspace basis functions are explicitly described as quasi-Trefftz functions [2603.13034].

## 4. Approximation theory

The central approximation fact is that the Taylor polynomial of an exact solution belongs to the local quasi-Trefftz space. This gives best-approximation estimates with the same local orders as full polynomials.

For the space-time wave equation, if \(u\) solves \(\Box_{\rho,G}u=0\) smoothly on \(K\), then its \(p+1\)-st Taylor polynomial \(T^{p+1}_K[u]\) belongs to \({}^p(K)\), and
\[
\inf_{P\in {}^p(K)} |u-P|_{C^q(K)}
\le
\frac{(n+1)^{p+1-q}}{(p+1-q)!}\, r_K^{p+1-q}\, |u|_{C^{p+1}(K)},
\]
with an analogous estimate in a wavespeed-weighted norm \(C^\star\) [2011.04617].

For general elliptic problems, Theorem 2.3 states that if \(u\in C^{p+1}(E)\) solves \(Lu=f\) and \(E\) is star-shaped with respect to \(x_E\), then \(T^{p+1}_{x_E}[u]\in {}^p_f(E)\) and, for \(0\le q\le p\),
\[
\inf_{v\in {}^p_f(E)} |u-v|_{C^q(E)}
=
|u-T^{p+1}_{x_E}[u]|_{C^q(E)}
\le
\frac{d^{\,p+1-q}}{(p+1-q)!}\,h_E^{\,p+1-q}\,\|u\|_{C^{p+1}(E)}.
\]
This shows that the quasi-Trefftz space retains full polynomial approximation order despite its reduced dimension [2408.00392].

The same conclusion is stated in the scalar unified theory: if \(u\) is an exact solution of \(Lu=0\) and is \(C^{p+\gamma}\) smooth, then \(T_pu\in QT_p\), with local estimates
\[
|u(x)-T_pu(x)|=O(|x-x_0|^{p+1}),
\qquad
|\nabla u(x)-\nabla T_pu(x)|=O(|x-x_0|^p).
\]
The contrast with full polynomials is explicit there: quasi-Trefftz spaces reduce the local dimension to \(O(p^{d-1})\) but remain tailored only to solutions of \(Lu=0\) [2505.18480].

For polynomial Trefftz spaces in the time-dependent Schrödinger equation, the situation is exact rather than quasi-Trefftz, but it is directly relevant because it demonstrates the same philosophy with a different degree notion. Using extended averaged Taylor polynomials of total anisotropic degree \(2p\), the Trefftz-DG approximation achieves optimal order \(h^p\) while the dimension equals that of \(P^{2p}(\mathbb R^d)\) [2306.09571]. This indicates that degree-counting must match the derivative structure of the PDE; in quasi-Trefftz settings this principle reappears in the choice of residual truncation order.

## 5. DG formulations and convergence

Polynomial quasi-Trefftz bases are typically inserted into discontinuous Galerkin schemes in which all volume terms are either eliminated or controlled through the residual structure. The resulting methods are well posed, quasi-optimal, and high-order convergent under standard mesh regularity and coefficient smoothness assumptions.

For the first-order acoustic initial-boundary value problem, the space-time quasi-Trefftz DG method of Imbert-Gérard, Moiola, and Stocker proves that the DG bilinear form is coercive in a mesh-dependent norm, continuous in a stronger paired norm, and that the discrete solution \((v_{hp},\sigma_{hp})\in V_{hp}\) satisfies the quasi-optimal error bound
\[
\|\!\| (v-v_{hp},\sigma-\sigma_{hp}) \|\!\|
\le
(1+C)\inf_{(w,\tau)\in V_{hp}}
\|\!\|(v-w,\sigma-\tau)\|\!\|.
\]
With \(V_{hp}=\prod_K {}^p(K)\), one obtains
\[
\|\!\|(v-v_{hp},\sigma-\sigma_{hp})\|\!\|=O(h^{p+1/2}),
\]
and in an \(L^2\)-type final-time norm,
\[
O(h^{p+1}).
\]
The paper states that these are the same \(h\)-convergence rates as a full polynomial space or a classical Trefftz space in the constant-coefficient case [2011.04617].

For variable-coefficient diffusion-advection-reaction equations, the DG formulation combines the usual SIPG diffusion form with upwind advection-reaction terms. Theorem 4.1 proves coercivity, boundedness, and well-posedness, while Theorem 5.2 gives
\[
\|u-u_h\|_{dar}
\le
\Bigl(1+\frac{M}{\alpha}\Bigr)
\frac{d^p}{p!}
\Bigl(\sum_{E\in\mathcal C_h} G_E |E| h_E^{2p}\|u\|_{C^{p+1}(E)}^2\Bigr)^{1/2}
=O(h^p)
\]
for the quasi-Trefftz DG method [2408.00392]. The earlier diffusion-advection-reaction study states the analogous quasi-optimal estimate in a DG norm and concludes \(O(h^p)\) in the DG norm and \(O(h^{p+1})\) in \(L^2\) for smooth solutions [2312.09919].

The unified Trefftz-like framework of Lederer and collaborators interprets these methods through local/global decomposition. For second-order operators, it gives a Strang-type estimate in a broken energy norm and, under extra \(L^2\)-\(H^2\) regularity of the dual problem, an Aubin-Nitsche estimate
\[
\|u-u_h\|_{L^2(\Omega)}\le C h^{\min(p,s)+1}|u|_{H^{\min(p,s)+1}(\Omega)},
\]
while retaining the local dimension formula
\[
\dim Q_p(K)=\binom{p+d}{d}-\binom{p+d-m}{d}.
\]
The same framework also interprets quasi-Trefftz elimination as a static-condensation-like restriction from the ambient polynomial space to a smaller local kernel space [2412.00806].

For embedded Trefftz DG for Helmholtz, the local space is defined by weak constraints rather than Taylor truncation. Nonetheless, the global SIPDG formulation is analyzed by a \(T\)-coercivity argument and a Schatz-type duality technique, leading to wavenumber-explicit stability and quasi-optimality under
\[
(1+\omega^2)h\le C_\Omega.
\]
An \(L^2\)-error bound of order \(O(h(1+\omega))\) relative to best DG approximation is also derived [2603.13034]. This is not a Taylor-based polynomial quasi-Trefftz basis in the strict sense, but it clarifies that locally constrained polynomial subspaces can support Trefftz-like DG analysis even when no exact polynomial solutions exist.

## 6. Variants, related constructions, and scope

Polynomial quasi-Trefftz bases form one branch of a broader class of Trefftz-like spaces for variable-coefficient problems. Related constructions include generalized plane waves, polynomial Trefftz spaces with anisotropic degree, and first-order or vector-valued quasi-Trefftz spaces.

Amplitude-based generalized plane waves for variable-coefficient Helmholtz use an ansatz
\[
\phi(x,y)=P_N(x,y)\exp\bigl(i\,\kappa(x_c,y_c)\,\theta\cdot(x-x_c,y-y_c)\bigr),
\]
with a polynomial amplitude \(P_N\), and impose a quasi-Trefftz property of order \(q\) by demanding that the Taylor expansion of the residual vanish through total degree \(q-1\) [2009.05306]. The construction is triangular and local, and the interpolation theorem proves \(O(h^{n+1})\) approximation with \(2n+1\) directions in two dimensions [2009.05306]. The 2020 space-time quasi-Trefftz wave paper explicitly states that its technique is inspired by generalized plane waves previously developed for time-harmonic problems with variable coefficients, but that in the time-domain case the approach allows for polynomial basis functions [2011.04617].

For the 3D convected Helmholtz equation, three quasi-Trefftz families are studied, including a purely polynomial basis. There the polynomial ansatz \(R\in\mathbb C[X_1,X_2,X_3]\) with \(\deg R\le q+1\) yields a \((q+2)^2\)-dimensional family, and the approximation theorem states that with \(p=(n+1)^2\) basis functions one obtains
\[
|u-u_a|\le C|x-x_C|^{n+1},
\qquad
\|\nabla u-\nabla u_a\|\le C|x-x_C|^n
\]
for exact solutions of the convected Helmholtz operator [2201.12993]. The paper also emphasizes that the polynomial basis does not suffer from the ill-conditioning inherent to wave-like bases [2201.12993].

For first-order systems, the 2025 Helmholtz formulation defines a polynomial quasi-Trefftz space of triples \((p,v_x,v_y)\in \mathbb P^d\times(\mathbb P^{d-1})^2\) by Taylor truncation of the first-order residuals. The space is equivalent to a scalar quasi-Trefftz condition for \(p\) combined with the exact relation \(v=(1/(\omega\rho))\nabla p\), and its dimension is
\[
2d+1.
\]
Two explicit \(O(d^5)\) basis-construction algorithms are given, one coupled and one decoupled [2509.08936]. This indicates that quasi-Trefftz methodology extends naturally from scalar second-order PDEs to first-order systems once compatibility conditions are handled explicitly.

Vector-valued polynomial quasi-Trefftz spaces for second-order time-harmonic Maxwell provide a further extension. Their basis construction depends on an adequate Helmholtz decomposition for homogeneous vector polynomial fields, with arbitrary choices of harmonic components \(H_k\in \widetilde H_k\) carrying \(2k+3\) degrees of freedom at each level [2509.00193]. A plausible implication is that exact-sequence technology may be central for quasi-Trefftz spaces of PDE systems, just as scalar graded decomposition is central for single-equation operators.

## 7. Numerical behavior, advantages, and limitations

The main numerical advantage repeatedly reported is higher accuracy for comparable numbers of degrees of freedom, due to the fact that the local space is adapted to the PDE while remaining much smaller than the full polynomial space [2312.09919], [2408.00392]. For the 3D diffusion-dominated elliptic test in \(\Omega=(0,1)^3\), the 2024 elliptic paper reports
\[
\|u-u_h\|_{L^2}=O(h^{p+1}),\qquad \|\cdot\|_{dar}=O(h^p)
\]
exactly as for full \(P^p\)-DG, but with \(\sim O(p)\) fewer degrees of freedom and lower condition numbers [2408.00392]. In two-dimensional advection-dominated tests, both full polynomial DG and quasi-Trefftz DG capture internal layers with small oscillations, and on an L-shaped domain the quasi-Trefftz DG solution with \(p=3\) differs from full-polynomial DG only by \(O(10^{-6})\) in most of \(\Omega\) [2408.00392].

The diffusion-advection-reaction study likewise states that the quasi-Trefftz space has smaller dimension than the full polynomial space of the same degree while yielding the same optimal convergence rates [2312.09919]. In the Schrödinger setting, careful scaling can reduce the stiffness-matrix condition number from \(O(h^{-(2p+1)})\) to \(O(h^{-1})\), and the reduced Trefftz dimension yields a substantial reduction in the number of degrees of freedom without sacrificing accuracy [2306.09571].

Conditioning is a recurrent point of comparison with oscillatory bases. For the 3D convected Helmholtz problem, the condition number of the normal matrix built from the monomial quasi-Trefftz basis grows only algebraically in \(n\), approximately \(10^3\) at \(n=8\), whereas GPW or plane-wave bases exhibit exponential ill-conditioning, approximately \(10^{17}\) at \(n=8\) [2201.12993]. The amplitude-based GPW work makes a related comparison: amplitude-based GPWs and phase-based GPWs achieve the same final slope \(n+1\), but the amplitude-based ansatz is significantly more stable in the pre-asymptotic regime \(h\sim1\) [2009.05306].

Several limitations are equally clear. The basis construction generally requires smooth coefficients and local Taylor jets of the operator coefficients, and explicit recursive construction may rely on a non-degeneracy condition such as \(\alpha_{m e_1}(x_E)\neq0\) [2408.00392]. The approximation theory is PDE-specific: quasi-Trefftz spaces preserve optimal order only for exact solutions of the underlying operator, not for arbitrary smooth functions [2505.18480]. For non-homogeneous problems, one may need a local quasi-Trefftz particular solution and then solve for the difference [2408.00392]. Finally, while exact Trefftz formulations often eliminate all volume terms, quasi-Trefftz formulations generally require control of residual contributions; in the unified viewpoint, this is handled through local constraints and DG coupling rather than exact elementwise annihilation of the operator [2412.00806].

Taken together, the literature presents polynomial quasi-Trefftz bases as a general local Taylor-based technology for constructing reduced high-order spaces adapted to variable-coefficient PDEs. The core ingredients are a kernel definition via residual truncation, a graded or recursive basis construction, explicit dimension formulas, Taylor-based best approximation, and DG formulations that recover the same \(h\)-convergence rates as much larger ambient polynomial spaces [2011.04617], [2408.00392], [2505.18480].

Source: https://www.emergentmind.com/topics/polynomial-quasi-trefftz-bases