Searcharxiv⌕ Search

arXiv subjects

A. G. Paraskevopoulos

Publications and source records attributed to A. G. Paraskevopoulos.

3 recordsLinked to original sources

The Canonical Family of Reduced Row Pivot Echelon Forms and the Induced Lexicographic Canonical Algorithm for Linear Programming

A complete canonical family of uniquely normalized, row-equivalent representatives of an $m\times n$ matrix is introduced and termed the family of Reduced Row Pivot Echelon Forms (RRPEFs). All RRPEFs represent the same row space, with the standard reduced row echelon form, renamed the Upper RREF (URREF), and the Lower RREF (LRREF) as its extreme members. A reformulation of Noether's Complementary Subspace Basis Theorem yields normalized bases of the row space that coincide with the nonzero rows of the corresponding RRPEFs. Constructively, each RRPEF is obtained by multi-index Gauss--Jordan reduction of a nonsingular transition submatrix. Factoring the admissible pivot-index sets by equality of their associated RRPEFs yields a quotient set in canonical bijection with the set of distinct RRPEFs. This bijection transfers the strict lexicographic order to the distinct RRPEFs and induces a finite chain from the URREF to the LRREF. The resulting structure gives rise to the Induced Lexicographic Canonical Algorithm (ILCA). Lexicographic confinement and singular-transition skipping restrict the candidate domain, whereas RRPEF reuse and scalar-equivalent transition bypassing avoid redundant Gauss--Jordan reductions while retaining the corresponding basic-solution tableaux. Strict lexicographic progression prevents cycling, while the traversal proceeds independently of objective improvement under degeneracy-induced stalling. ILCA terminates when a feasible tableau satisfies the standard optimality conditions and otherwise completes the finite traversal, including for Tucker- and Cunningham-type totally degenerate configurations.

math.OC↗

Explicit and compact representations for the Green's function and the Solution of Linear Difference Equations with variable coefficients

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 associated 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 Green's function (Green's 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 Green's 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 Green's 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 Green's 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.

math.FA↗

A closed form to the general solution of linear difference equations with variable coefficients

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.

math.FA↗