This article needs more citations. (November 2026) |
In mathematics, the Lanczos tau method is a spectral method for the numerical solution of differential equations, named after Cornelius Lanczos, who first presented it in 1938. Unlike the Galerkin method, which requires the basis functions to satisfy the boundary conditions a priori, the tau method uses a set of orthogonal polynomials as basis functions. In the Tau method approach, the boundary conditions are imposed on the linear combination of basis functions, while the residual is made orthogonal to as many basis functions as possible — rather than to the entire set.
The tau method seeks an approximation to the solution of a differential equation by expanding the solution in terms of a set of basis functions, typically orthogonal polynomials such as Chebyshev or Legendre polynomials. The key idea is to require that the residual of the differential equation be orthogonal to as many basis functions as possible, while the boundary or auxiliary conditions are forced to be exactly satisfied.
Consider a differential equation of the form
subject to appropriate boundary or auxiliary conditions
Here, is a differential operator that can be, at least approximately, written in the form
is the differential problem order, and are given. For the tau method to be applied, it is assumed that the solution admits a generalised Fourier series
where is a set of square-integrable orthogonal functions defined on , and are unknown coefficients. Usually is an orthogonal polynomial basis.
In the tau method, for some integer , an approximation to is found in the subspace spanned by , in the form
where the coefficients are found by requiring that the boundary conditions hold
and using the remaining degrees of freedom to impose that agrees with as far as possible.The last condition means that the residual is orthogonal to each or, equivalently, forces the residual to be an order Fourier series in
In case all coefficients in are polynomials, and if is the degree of , then the residual is a polynomial of degree .
In 1981, Ortiz and Samara proposed an operational approach to the tau method based on operational matrices of differential operators. For a fixed , let be a basis for the subspace , and let be the vector of the Fourier coefficients of , then the approximate solution can be written as .
Let denote the multiplication of basis elements by , and let denote differentiation of basis elements. These operations can be represented as matrix operations by
Matrices and can be evaluated from properties of . If is an orthogonal polynomial sequence, then a three-term recurrence relation holds:
Then is the Jacobi matrix with
and where are the connection coefficients in
From matrices and , the action of the differential operator over polynomials is translated to the action of the algebraic operator, over the vector of Fourier coefficients, defined by the operational matrix
in the sense that , where is the vector of Fourier coefficients of the projection of onto . If, for the coefficients of , we have
at least approximately, then
The action of boundary conditions over the base is represented by the matrix with
and the vector . Then , is an approximate solution to
in the Tau sense if
where
is matrix truncated to its first rows and is vector truncated to its first elements.