Generalizing Dodgson’s Method: a “double-crossing” Approach to Computing Determinants
ثبت نشده
چکیده
Dodgson’s method of computing determinants was recently revisited in a paper that appeared in the College Math Journal. The method is attractive, but fails if an interior entry of an intermediate matrix has the value zero. This paper reviews the structure of Dodgson’s method and introduces a generalization, called a “double-crossing” method, that provides a workaround to the failure for many interesting cases.
منابع مشابه
Viewing Determinants as Nonintersecting Lattice Paths yields Classical Determinantal Identities Bijectively
In this paper, we show how general determinants may be viewed as generating functions of nonintersecting lattice paths, using the Lindström–Gessel–Viennotmethod and the Jacobi-Trudi identity together with elementary observations. After some preparations, this point of view provides “graphical proofs” for classical determinantal identities like the Cauchy-Binet formula, Dodgson’s condensation fo...
متن کاملBijective Proofs for Schur Function Identities which Imply Dodgson's Condensation - Formula and Plu"cker Relations
We exhibit a “method” for bijective proofs for determinant identities, which is based on translating determinants to Schur functions by the Jacobi–Trudi identity. We illustrate this “method” by generalizing a bijective construction (which was first used by Goulden) to a class of Schur function identities, from which we shall obtain bijective proofs for Dodgson’s condensation formula, Plücker re...
متن کاملA New Method for Computing Determinants By Reducing The Orders By Two
In this paper we will present a new method to calculate determinants of square matrices. The method is based on the Chio-Dodgson's condensation formula and our approach automatically affects in reducing the order of determinants by two. Also, using the Chio's condensation method we present an inductive proof of Dodgson's determinantal identity.
متن کاملSolve Linear System with Sylvester’s Condensation
We present a development of Dodgson’s method for the solution to a system of linear equations (see [5]) using the determinants of the Sylvester’s (Determinants) Identity. We explicitly write down the algorithm for this developed method. Mathematics Subject Classification: Primary 05A19; Secondary 05A10
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کامل