LIBRARY OF THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY



Similar documents
Direct Methods for Solving Linear Systems. Matrix Factorization

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

A Primer on Index Notation

CBE 6333, R. Levicky 1. Tensor Notation.

7 Gaussian Elimination and LU Factorization

Linearly Independent Sets and Linearly Dependent Sets

Systems of Linear Equations

Using row reduction to calculate the inverse and the determinant of a square matrix

Row Echelon Form and Reduced Row Echelon Form

SOLVING LINEAR SYSTEMS

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

The Matrix Elements of a 3 3 Orthogonal Matrix Revisited

Solving Systems of Linear Equations

1 Introduction to Matrices

1.2 Solving a System of Linear Equations

Torgerson s Classical MDS derivation: 1: Determining Coordinates from Euclidean Distances

Solution of Linear Systems

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH

Matrix Differentiation

ANALYTIC HIERARCHY PROCESS (AHP) TUTORIAL

Solving Systems of Linear Equations

STATISTICS AND DATA ANALYSIS IN GEOLOGY, 3rd ed. Clarificationof zonationprocedure described onpp

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

ISOMORPHISM BETWEEN AHP AND DOUBLE ENTRY BOOK KEEPING SYSTEM

CONTROLLABILITY. Chapter Reachable Set and Controllability. Suppose we have a linear system described by the state equation

Notes on Determinant

Introduction to Matrix Algebra

Brief Review of Tensors

Determinants in the Kronecker product of matrices: The incidence matrix of a complete graph

6. Cholesky factorization

Introduction to Multivariate Analysis

1 Determinants and the Solvability of Linear Systems

v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.

1 Solving LPs: The Simplex Algorithm of George Dantzig

Chapter 3. Distribution Problems. 3.1 The idea of a distribution The twenty-fold way

The Determinant: a Means to Calculate Volume

SOLUTIONS TO HOMEWORK SET #4

Factorization Theorems

Section 5.3. Section 5.3. u m ] l jj. = l jj u j + + l mj u m. v j = [ u 1 u j. l mj

Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

Domain of a Composition

Lecture 2 Matrix Operations

Discrete Convolution and the Discrete Fourier Transform

Data Mining: Algorithms and Applications Matrix Math Review

Vectors and Index Notation

Introduction to Matrices for Engineers

Continued Fractions and the Euclidean Algorithm

Elementary Matrices and The LU Factorization

2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method

Math Quizzes Winter 2009

LINEAR INEQUALITIES. less than, < 2x + 5 x 3 less than or equal to, greater than, > 3x 2 x 6 greater than or equal to,

MAT188H1S Lec0101 Burbulla

A Multiplier and Linkage Analysis :

Fuqua School of Business, Duke University ACCOUNTG 510: Foundations of Financial Accounting

CHAPTER 7 Economic Growth I

SPLIT PLOT DESIGN 2 A 2 B 1 B 1 A 1 B 1 A 2 B 2 A 1 B 1 A 2 A 2 B 2 A 2 B 1 A 1 B. Mathematical Model - Split Plot

Burgers vector, Burgers circuit, and Dislocation Line Direction

Linear Algebra: Vectors

Macroeconomics Lecture 1: The Solow Growth Model

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

Solving Linear Systems, Continued and The Inverse of a Matrix

Math 115 Spring 2011 Written Homework 5 Solutions

(Refer Slide Time: 1:42)

Unit 18 Determinants

Lecture 3: Finding integer solutions to systems of linear equations

Physics 235 Chapter 1. Chapter 1 Matrices, Vectors, and Vector Calculus

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

13 MATH FACTS a = The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

The Characteristic Polynomial

Analysis of a single-loop circuit using the KVL method

These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

The Gravity Model: Derivation and Calibration

Figure 1.1 Vector A and Vector F

Chapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors

1 VECTOR SPACES AND SUBSPACES

CS3220 Lecture Notes: QR factorization and orthogonal transformations

Special cases in Transportation Problems

Matrix Multiplication

Unit 2 The Basic Accounting Cycle

Projecting the Leontief inverse directly by the RAS method

II. Linear Systems of Equations

9.2 Summation Notation

Multi-variable Calculus and Optimization

1.4 Compound Inequalities

A =

Section Inner Products and Norms

[1] Diagonal factorization

Section 4.2: The Division Algorithm and Greatest Common Divisors

Lecture notes on linear algebra

1 Introduction. 2 The Symmetrical Component Transformation. J.L. Kirtley Jr.

Unit 2 The Basic Accounting Cycle

by the matrix A results in a vector which is a reflection of the given

ACC 211/212: Double Entry Logs

Method To Solve Linear, Polynomial, or Absolute Value Inequalities:

5.04 Principles of Inorganic Chemistry II

NOTES ON LINEAR TRANSFORMATIONS

Transcription:

LIBRARY OF THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Not to be reproduced in whole or in part without author's permission Extensions of the Matrix Form of MASS. If'JST. TECH. Double Entry MOV 19 1964 DEWEY LIBRARY James J. Linn 90-64 I wish to express my gratitude to the Ford Foundation Faculty Seminar held at the Graduate School of Industrial Administration, Carnegie Institute of Technology in July-August, 1963 where I developed the basic idea of transforming the rectangular double entry matrix to a triangular form.

Introducing Account Balances into the Square Matrix Form The matrix form of double entry has a -I'.a-M^*' ciu^^iett.^^ There is no appropriate place for account balances. At present, to include these, the original matrix form must be augmented in some fashion. This can be done to the physical form by adding additional rows and columns. In the analytical form, where indexing alone is used in place of physical cells, additional variables such as beginning balance account must be used. This defect can be remedied by introducing into the set of permissable notations the minus sign and by utilizing the unused cells of the matrix which constitute the diagonal. The diagonal of the matrix form of double entry is always empty for the 2 simple reason that the same account is generally not debited and credited in any one transaction. On the other hand anything assigned to a diagonal cell means that the same account is to be both debited and credited in that amount. This is equivalent to doing nothing or adding zero to the account. In order to use the diagonal, and if it is to be used at all as a repository for account balances, some means of identifying the account balance must be devised. This can be done by the following convention: In the diagonal of a matrix form of traditional (debit-credit) double entry a minus sign indicates a credit balance and the absence of a minus sign indicates a debit balance. Thus a, means 3 a debit balance of amount a in account k and -b,, means a credit balance of b in account h. hh It has been emphasized elsewhere that accounting data is signless but that the See for example A. Charnes, W. Cooper, and Y. Ijuri, "Breakeven Budgeting and Programming to Goals," Journal of Accounting Research (Spring 1963), pp. 35; and A. Wayne Corcoran, "Matrix Bookkeeping," The Journal of Accountancy (March 1964), pp. 60-66. The exception is very unusual, (e.g., a transfer between the subordinate accounts of a control account). 3 Any set of indicators can be used instead of plus-minus. However the plus-minus set has the additiona useful characteristic of indicating the signed result of the account balance calculation.

debit and credit mechanism in conjunction with the accounts indicate whether a change in an account is an increase or a decrease. Thus the minus sign has no significance in the traditional form of double-entry and an arbitrary definition can be assigned to it. In addition to the minus convention it is necessary to modify some of the operations on the matrix. The diagonal cell must be omitted from every row or column summation. This can be done in standard notation as follows: La., or La,. ik ki., i=l., j=l - IJ^k jj'k Now every matrix form of traditional double entry can show beginning balances well as contained in each cell. \k = \k -^.\ ^k -.^ \^ 1=1 j=i -^ ij^k jj^k ^^^ The first term is the old account balance, the second the debits to the account, and the third the credits to the account. The new balance can be either, positive or negative. This is completely controlled by the sign and magnitude See James J. Linn, "An Analysis of Double Entry," (Working Paper 87-64, Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1964), p. 10.

Transforming the Square Matrix Form into a Traingular Matrix Form An interesting characteristic of the matrix form of traditional double entry is that the only difference between any cell except those in the diagonal and its mirror image across that diagonal is that the indices are reversed. This characteristic and an extension of the minus convention can be employed to reduce a square matrix to a traingular matrix. The minus sign will have the following meaning: Any figure with a minus indicates an index (debit-credit) interchange. Thus dr -10 means cr 10 cr -10 means dr 10 Letting a.. stand for debit account i and credit account j in the amount of a, this can also be stated as -a.. - a,.. This extension and the original ij ji minus convention together make up the extended minus convention. The original con- X venfion permits the introduction of account balances into either a square or this convention traingular matrix form of traditional double entry and the extcr.ri;.:; o.enables the square matrix form to be transformed into a triangular matrix form. The rule for this, based upon the convention extension is: ij L^. for all fi = 1, j-1 j = 1,..., i.i Once this transformation has occurred all transactions normally placed in 2 that part of a square matrix below the diagonal will be placed in that part above. The original and new transactions are distinguished by the new being preceded with a minus sign. This is based upon the presumption that the transactions remained separated when assigned to a cell. If they are accumulated, the integrity of the cells has been violated. The total of each cell of the triangular matrix. ^See p. 1. 2 On the other hand, the portion above the diagonal could be mapped onto the portion below. However, a triangular matrix is conventionally that portion of a square matrix above the diagonal.

is the net of the debits to account i and credits to account j less the debits to account j and the credits to account i. It may be possible to accumulate, for each cell, the positive and negative amounts separately. For some sets of implementing operations this is tatamount to using a square matrix. A square matrix which contains account balances can be transformed into a triangular matrix because the diagonal is unaffected. The extended minus convention is applicable since both parts occur after the transformation. Assuming the transactions were at most accumulated by sign within each cell^ account balances and full detail can be calculated. A new account balance (a/. ) is calculated as follows: ^kk = ^k ^ J^^k ji^kj t>^.>^ (2) i, j = 1, 2, k-1, k, k+1,, n \-l,k - Vl,k <3> ^f^^k = ^k - ^k " "2k - ^2k ^ -^ This is illustrated in Figure I. The - a. would be a.. in a square matrix. Substituting (3) and (4) into equation (2), "ik = \k ^ ^^k - ^k " " \-l.k - \.l,k^ -^\.k+l ^ \,k+l - -\n ^ V^ "^ Vi,k " Vi,k -^^.k+i -\,k+i ".^^^ is)

/z--^

then by rearranging terms this eaiiiation becomes 'k,k+l ' "kn \n (^> Now the equation can be divided into three sections. These are: a,. the beginning balance (debit) + a, all the debits to account k kn ^k - Vl.k \.k+l - - \n ^^^ ^^^ "^'^^^' ^ ^"^""'^ ^ In square matrix notation the debits would be written as... + a, + + a,, + Ik... + a,,, k-l,k a,,., k+l,k nk and the credits would be written as '^1 " " \,k-l ' \,k+l " - ~\n with a, =0 omitted, k Term by term these are identical. In the triangular matrix it was necessary to reverse some of the indices. Those that were reversed turn out to be the last half of the debits and the first half of the credits. This, notation, is the only difference between the two sets of data. Equation (1) expanded and rearranged represents the new (debit) balance of an asset account. For an equity account the notation and signs would be identical except for the beginning balance aj^i^j this would be -a,, (a credit). Thus the new balance would be -a,, if it were also a credit balance.

Sunnnary The diagonal of a square matrix form of double entry can be used to record account balances by the introduction of a sign convention to distinguish between debit and credit balances. The plus-minus sign convention is suitable and has the additional advantage of being consonant with the signs of the operations of the process by which account balances are calculated. By extending the plus-minus convention the square matrix form of double entry can be transformed into a triangular matrix form. While interesting this transformation appears to have limited usefulness since it is necessary, in every cell but those in the diagonal, to distinguish between those elements which were present before the transformation and those which are present after the transformation.

ksemo^t, Date Due

3 TDflD 003 TOO 5b0 ii'-bh &'^/ 3 TOfiO 003 flbt Elfl 3 TOflO 003 TOO 503 Mimimiii 3 TOflO 003 TOO 211 '- 1.751801 an 3 TOflO 003 TOO M?! 3 TOflO 003 flbt 4S7 i f11'-fifflllllilil 3 TDfiO DD3 abt 507 "^"' 3 TOfiO 003 TOO 500 II iiiiiiiu,ii,ii:ijlr:i:,:iil!i!llllllll!ll ^^-^'/ 3 TDfiO 003 TOO 4flM 3 TOflO 003 fibt 4b5 3 TOflO 003 TOO Mbfi V-^'l 3 TOflO 003 fltt 461 f? '^^( 3 TOflO 003 flbt 531 ^ H