Výsledky vyhledávání - "Awoniyi, Samuel"

Report

On pairs of complementary GJ pivoting transforming skew-symmetric matrices

Autor: Awoniyi, Samuel

This article describes certain ratios that attend pairs of complementary Gauss-Jordan pivotings transforming skew-symmetric matrices. Our interest in those ratios was motivated by a need to prove a crucial Claim stated in a recently proposed strongly

Externí odkaz: http://arxiv.org/abs/2410.19350

Zobrazit plný text záznamu

Report

Validation of a strongly polynomial-time algorithm for the general linear programming problem

Autor: Awoniyi, Samuel

This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The algorithm is an implicit, solution-space reduction procedure that works as follows. Primal and dual problems

Externí odkaz: http://arxiv.org/abs/2310.05855

Zobrazit plný text záznamu

Report

Computation and applications of limits of certain non-stationary Markov chains

Autor: Awoniyi, Samuel

This article describes a method for computing limits of a class of non-stationary Markov chains motivated by healthcare sojourn-time cycles. A mathematical validation of the computation method is also given. Applications are described that include pr

Externí odkaz: http://arxiv.org/abs/2309.10974

Zobrazit plný text záznamu

Report

A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem

Autor: Awoniyi, Samuel

Utilizing illustrative linear programming (LP) problem instances, this article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general LP problem. With each iteration of the algorithm consisting of

Externí odkaz: http://arxiv.org/abs/2309.01037

Zobrazit plný text záznamu