اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA closed form to the general solution of linear difference equations with variable coefficients
72
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The determinant of a lower Hessenberg matrix (Hessenbergian) is expressed as a sum of signed elementary products indexed by initial segments of nonnegative integers. A closed form alternative to the recurrence expression of Hessenbergians is thus obtained. This result further leads to a closed form of the general solution for regular order linear difference equations with variable coefficients, including equations of N-order and equations of ascending order.
قيم البحث
اقرأ أيضاً
Leibniz combinatorial formula for determinants is modified to establish a condensed and easily handled compact representation for Hessenbergians, referred to here as Leibnizian representation. Alongside, the elements of a fundamental solution set ass
ociated with linear difference equations with variable coefficients of order $p$ are explicitly represented by $p$ banded Hessenbergian solutions, built up solely of the variable coefficients. This yields banded Hessenbergian representations for the elements both of the product of companion matrices and of the determinant ratio formula of the one-sided Greens function (Greens function for short). Combining the above results, the elements of the foregoing notions are endowed with compact representations formulated here by Leibnizian and nested sum representations. We show that the elements of the fundamental solution set can be expressed in terms of the first banded Hessenbergian fundamental solution, called principal determinant function. We also show that the Greens function coincides with the principal determinant function, when both functions are restricted to a fairly large domain. These results yield, an explicit and compact representation of the Greens function restriction along with an explicit and compact solution representation of the previously stated type of difference equations in terms of the variable coefficients, the initial conditions and the forcing term. The equivalence of the Greens function solution representation and the well known single determinant solution representation is derived from first principles. Algorithms and automated software are employed to illustrate the main results of this paper.
The construction of the general solution sequence of row-finite linear systems is accomplished by implementing -ad infinitum- the Gauss-Jordan algorithm under a rightmost pivot elimination strategy. The algorithm generates a basis (finite or Schauder
) of the homogeneous solution space for row-finite systems. The infinite Gaussian elimination part of the algorithm solves linear difference equations with variable coefficients of regular order, including equations of constant order and of ascending order. The general solution thus obtained can be expressed as a single Hessenbergian.
The detailed construction of the general solution of a second order non-homogenous linear operatordifference equation is presented. The wide applicability of such an equation as well as the usefulness of its resolutive formula is shown by studying so
me applications belonging to different mathematical contexts.
The exact solution of a Cauchy problem related to a linear second-order difference equation with constant noncommutative coefficients is reported.
Let L be a linear difference operator with polynomial coefficients. We consider singularities of L that correspond to roots of the trailing (resp. leading) coefficient of L. We prove that one can effectively construct a left multiple with polynomial
coefficients L of L such that every singularity of L is a singularity of L that is not apparent. As a consequence, if all singularities of L are apparent, then L has a left multiple whose trailing and leading coefficients equal 1.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
