高阶线性微分算子的完整基底与谱-塔方法的完整递归公式
Complete bases of canonical polynomials and the full recursive formulation of the spectral-tau method
AI总结:
本文通过将高阶线性微分算子分解为两个因子算子的直和,生成完整基底并实现谱-塔方法的完整递归公式,适用于无限矩阵的行阶梯形式相关算子方程。
摘要:
本文获得了一个高阶线性微分算子(具有多项式系数)的分解,将其分解为两个因子算子的直和。这导致了通过有限次基本操作得到的上述类型算子的下阶梯矩阵表示。作为结果,通过修改后的Ortiz递推公式生成了完整的标准多项式基底。本文提出的方法使得能够实现谱-塔方法的完整且自操作的递归实现。这些结果可应用于各种与无限矩阵相关联的算子方程,具有对广泛离散和连续数值方法的启示,这些方法被解释为在特定扰动项下的谱-塔方法的特殊实现。
英文摘要:
A decomposition of a higher order linear differential operator with polynomial coefficients into a direct sum of two factor operators is obtained. This leads to a lower echelon matrix representation for operators of the above mentioned type arising from a finite sequence of elementary operations. As a consequence, a complete basis of canonical polynomials is generated via a modified Ortiz' recurrence formula. The approach presented in this paper enables us to curry out the full and self-operative recursive implementation of the spectral-tau method. These results can be applied to a variety of operator equations associated with infinite matrices in lower row echelon form, having implications for a broad family of discrete and continuous numerical methods, interpreted as special realizations of the tau method under specific perturbation terms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。