FAST CALCULATION OF INVERSE MATRICES OCCURRING IN SQUARED-RECTANGLE CALCULATION
|
|
- Jodie Golden
- 5 years ago
- Views:
Transcription
1 R911 Philips Res. Repts 30, 329*-336*, 1975 Issue in honour of C. J. Bouwkamp FAST CALCULATION OF INVERSE MATRICES OCCURRING IN SQUARED-RECTANGLE CALCULATION 1. Introduction by A. J. W. DUIJVESTIJN Technological University Twente Enschede, The Netherlands (Received January 22, 1975) In my thesis 1) a method is described how to generate so-called c-nets automatically. I used a code ofthe network from which a planar representation can immediately be found; this code defines the net uniquely. From this code one can easily obtain the mesh-mesh incidence matrix INe automatically. By removing one row and its corresponding column one obtains a matrix C that plays an important role in the determination of the currents in the network when an accumulator is placed in one of the branches assuming resistors of 1 n in all of the branches. For the determination of the currents one needs the inverse of C. In my thesis this inverse was obtained by means of Gaussian elimination using integer arithmetic. Each element in the calculation was denoted by a pair of integers (although one common denominator per row). In order to avoid extensive growth of the integers it was necessary to determine highest common divisors that could be removed from the occurring integers. Obviously the determination of the inverse of C is rather time-consuming. In this paper a new method is presented that lis much faster than the abovedescribed method. To achieve this I use the fact that a network NI with a corresponding matrix CN! can be obtained from a network No having one branch less than NI' If CNo -1 happens to be known one can obtain CNl-1 without completely inverting the matrix. 2. Outline of the method In order to explain the method I use a reference network R and its dual 11 as an example. It is shown in fig. 1. The reference net R has the following characteristics: number of nodes number of meshes number of branches complexity K =9, M=8, B -:- 15, C = 1600.
2 330* A. J. W. DUIJVESTIJN Original A code of the original network R is A code of its dual ft is Fig. 1. Reference network R and its dual R. Dual For definitions of the code and the complexity I refer to ref. 1. From the code one can obtain the mesh-mesh incidence matrix INCR The matrix CR has been obtained from INCR by removing row 8 and column 8. The complexity of R is denoted by CR' The matrices INCR, CR and CR CR- 1 are given in fig. 2. We now assume that we want to construct a network N of order 16 with K = 10 and M = 8 by adding branch l3 to the dual network and dualizing back. Note that INC N differs from INC R in four corresponding elements namely: First of all we change the reference system of independent meshes. In the reference net R we have used the meshes 1, 2, 3, 4, 5, 6 and 7. We remove either 1 or 3. Let us remove mesh 3 and introduce mesh 8. The matrix with independent meshes 1,2,8,4, 5, 6, 7 is denoted by CR"' It can be shown that CR" = rcr I", where r is a square transformation matrix consisting of elements that only take the value 1,0 and -1 2). TI is the transpose of r. Hence it follows (CR")-1 = Cr-1)! CR- 1 F:», The inverse (CR")-1 can therefore be obtained from CR-1 by th~ following formulae: qlj = PIJ +P«- Pit - PtJ> i =1= t,j -=I t qlt = Pu - PIt> i =1= t
3 INVERSE MATRICES IN SQUARED-RECTANGLE CALCULATION 331* INC R CR er- 1 Fig. 2. INC R, CR and CR CR- 1 for the reference net R. CR and where t is the mesh that has been removed from CR and PIJ = element of CR- 1 and qlj = element of (er*)-1. In our example t = 3. Using these relations we obtain the following result: CR (CR*)-1 = The matrices CR* and en * only differ in one element, namely' the one with indices 1, 1.
4 332* A. J. W. DUIJVESTIJN I Fig.3. When we finally interchange meshes 1 and 7, we arrive at the results shown in fig. 3. The matrices are denoted by CR, C/o and CR CCR )-1. The matrix C/;'R )-1 is partitioned in the following way: CR CCR )-1 = t::t \~:j, where ;3 = ;2 = and ;2 t is the transpose of ;2' The complexity C N of the new network equals the determinant of CN "', It can therefore be obtained from C N = CR + ;3 = = The new inverse (/;,/.)-1 can be obtained from the following formula as can be verified easily:
5 INVERSE MATRICES IN SQUARED-RECTANGLE CALCULATION 333* Apparently el C N - e2 e2 t must be divisible by CR' The result is CN (CN )-l = Finally we interchange the meshes 1 and 7 and as a last step we remove mesh 8 and introduce mesh 3 again. We then have completed our task. The result is CN CN- 1 = Sofar we have only added branches in the dual network. We also want to add branches in the original network. One could think of dualizing the network but I could not easily obtain the corresponding inverse matrix of the dual network from the original network. Therefore I tried to derive the inverse of the new network from the inverse of the original network only. 3. Adding branches in the original network When we add a branch in the original network it means that we split a mesh. When for example a branch 25 is added, mesh 8 is split into meshes 8 and 9. Note that mesh 8 is not one of the independent meshes in CR' In case we split an independent mesh we have to change the reference system by the method described in sec. 2 such that this mesh is not one of the independent meshes.
6 334* A. J. W. DUIJVESTIJN Let us denote the new network by Nz. We then obtain the following meshmesh incidence matrix INC Nz : INC N2 = ~ 1-1 ~-1 ~ \ \-1 "9" =ï =i =ï... =ï ~ 4 For the determination of currents we remove mesh 9 and obtain CN2: The matrix CN2 is partitioned as follows: -1 aa Al = a, a Az = 4 and CRhas the same meaning as in sec
7 INVERSE MATRICES IN SQUARED-RECTANGLE CALCULATION 335* If we put gr = CR CR- 1 and gr Al = BI we can easily show that In our example we have: Finally we find CR Al = while AI' gr Al = 3232 and C N2 = 4 x = ~I C N2 CN2-1 = Significance of the method In 1962 we calculated all c-nets of orders up to and including 19 on the PASCAL and STEVIN computers of Philips' computing centre. The c-nets were made available on punched cards and punched paper tape. Furthermore all nets of order 20 were generated but kept in the computer. We investigated whether these nets produced any perfect squared-square of order 19.We found only a large number of imperfect squared-squares of order 19.In 1968 and 1969 IBM Netherlands gave me the opportunity to use the IBM 7094 at Rijswijk to tackle this problem. D. Severein wrote 'programs in 7094 assembly code according to the method described in my thesis. As a result the nets of orders up to and including 20 are available now on magnetic tape.
8 336* A. J. W. DUIJVESTIJN We found that the number of c-nets of order 20 is less than or equal to The following approach is now feasible. First we calculate for each net N of order 20 the matrix CN-1 by means of Gaussian elimination. Next we generate the nets of order 21, 22, 23 and 24 and search for existence of possible squared-. square solutions. To achieve this we investigate CN- 1 directly for the orders 21,22 and 23. For the nets of order 24 we only calculate the complexity and remember that squared-square solutions can only be obtained from a net with a complexity of the form 2kA 2, where k and A are integers. The nets of order 21 will not be generated in one run. We rather generate the complete tree of nets and search this tree. By doing this we only need to store four nets with inverse matrices. Obviously we will not store the nets on magnetic tape. Acknowledgement I am grateful to IBM Netherlands, which gave me the opportunity to use the IBM Furthemore I am indebted to Ir. J. G. Rietveld of IBM for his encouragement. I want to thank D. Severein of the Computing Centre of the Technological University Twente for carrying out the enormous task of programming and testing the large programs in the IBM 7094 assembly code. REFERENCES 1) A. J. W. Duijvestijn, Thesis, Eindhoven, 1962 (Philips Res. Repts 17, ,1962). 2) G. Kron, Tensor analysis of networks, John Wiley & Sons, Inc., New York, 1939.
Exercise Set Decide whether each matrix below is an elementary matrix. (a) (b) (c) (d) Answer:
Understand the relationships between statements that are equivalent to the invertibility of a square matrix (Theorem 1.5.3). Use the inversion algorithm to find the inverse of an invertible matrix. Express
More informationAH Matrices.notebook November 28, 2016
Matrices Numbers are put into arrays to help with multiplication, division etc. A Matrix (matrices pl.) is a rectangular array of numbers arranged in rows and columns. Matrices If there are m rows and
More information36 Modular Arithmetic
36 Modular Arithmetic Tom Lewis Fall Term 2010 Tom Lewis () 36 Modular Arithmetic Fall Term 2010 1 / 10 Outline 1 The set Z n 2 Addition and multiplication 3 Modular additive inverse 4 Modular multiplicative
More informationTHE NUMBER OF POLYHEDRAL (3-CONNECTED PLANAR) GRAPHS
MATHEMATICS OF COMPUTATION Volume 65, Number 215 July 1996, Pages 1289 1293 THE NUMBER OF POLYHEDRAL (3-CONNECTED PLANAR) GRAPHS A. J. W. DUIJVESTIJN Abstract. Data is presented on the number of 3-connected
More informationx = 12 x = 12 1x = 16
2.2 - The Inverse of a Matrix We've seen how to add matrices, multiply them by scalars, subtract them, and multiply one matrix by another. The question naturally arises: Can we divide one matrix by another?
More informationThe Number of Polyhedral (3-Connected Planar) Graphs
mathematics of computation volume 37, number 56 OCTOBER 98 The Number of Polyhedral (3-Connected Planar) Graphs By A. J. W. Duijvestijn and P. J. Federico Abstract. Data is presented on the number of 3-connected
More informationDIVIDE & CONQUER. Problem of size n. Solution to sub problem 1
DIVIDE & CONQUER Definition: Divide & conquer is a general algorithm design strategy with a general plan as follows: 1. DIVIDE: A problem s instance is divided into several smaller instances of the same
More informationMatrix Inverse 2 ( 2) 1 = 2 1 2
Name: Matrix Inverse For Scalars, we have what is called a multiplicative identity. This means that if we have a scalar number, call it r, then r multiplied by the multiplicative identity equals r. Without
More informationTeachers Teaching with Technology (Scotland) Teachers Teaching with Technology. Scotland T 3. Matrices. Teachers Teaching with Technology (Scotland)
Teachers Teaching with Technology (Scotland) Teachers Teaching with Technology T 3 Scotland Matrices Teachers Teaching with Technology (Scotland) MATRICES Aim To demonstrate how the TI-83 can be used to
More informationA Necessary Condition for Four-Coloring a Planar Graph
JOURNAL OF COMBINATORIAL THEORY 1, 375-384 (1966) A Necessary Condition for Four-Coloring a Planar Graph GLEN BAXTER * Department of Mathematics, Purdue University, Lafayette, Indiana Communicated by Gian
More informationMatrices. Matrices. A matrix is a 2D array of numbers, arranged in rows that go across and columns that go down: 4 columns. Mike Bailey.
Matrices 1 Matrices 2 A matrix is a 2D array of numbers, arranged in rows that go across and columns that go down: A column: This work is licensed under a Creative Commons Attribution-NonCommercial- NoDerivatives
More informationMatrices. Mike Bailey. matrices.pptx. Matrices
Matrices 1 Mike Bailey mjb@cs.oregonstate.edu This work is licensed under a Creative Commons Attribution-NonCommercial- NoDerivatives 4.0 International License matrices.pptx Matrices 2 A matrix is a 2D
More informationGraphBLAS Mathematics - Provisional Release 1.0 -
GraphBLAS Mathematics - Provisional Release 1.0 - Jeremy Kepner Generated on April 26, 2017 Contents 1 Introduction: Graphs as Matrices........................... 1 1.1 Adjacency Matrix: Undirected Graphs,
More informationComputer Graphics with OpenGL ES (J. Han) Chapter IV Spaces and Transforms
Chapter IV Spaces and Transforms Scaling 2D scaling with the scaling factors, s x and s y, which are independent. Examples When a polygon is scaled, all of its vertices are processed by the same scaling
More informationSection 3.1 Gaussian Elimination Method (GEM) Key terms
Section 3.1 Gaussian Elimination Method (GEM) Key terms Rectangular systems Consistent system & Inconsistent systems Rank Types of solution sets RREF Upper triangular form & back substitution Nonsingular
More informationCALCULATING TRANSFORMATIONS OF KINEMATIC CHAINS USING HOMOGENEOUS COORDINATES
CALCULATING TRANSFORMATIONS OF KINEMATIC CHAINS USING HOMOGENEOUS COORDINATES YINGYING REN Abstract. In this paper, the applications of homogeneous coordinates are discussed to obtain an efficient model
More informationperform. If more storage is required, more can be added without having to modify the processor (provided that the extra memory is still addressable).
How to Make Zuse's Z3 a Universal Computer Raul Rojas January 14, 1998 Abstract The computing machine Z3, built by Konrad Zuse between 1938 and 1941, could only execute xed sequences of oating-point arithmetical
More informationHill Substitution Ciphers
Text Reference: Section 4.1 Wikipedia Reference: Hill Cipher Hill Substitution Ciphers In this Lab, matrices are used to encode and decode messages. The ideas are due to Lester Hill in 1929. Hill's patented
More informationInterleaving Schemes on Circulant Graphs with Two Offsets
Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical
More informationA Parallel Algorithm for Finding Sub-graph Isomorphism
CS420: Parallel Programming, Fall 2008 Final Project A Parallel Algorithm for Finding Sub-graph Isomorphism Ashish Sharma, Santosh Bahir, Sushant Narsale, Unmil Tambe Department of Computer Science, Johns
More informationLearning Log Title: CHAPTER 3: ARITHMETIC PROPERTIES. Date: Lesson: Chapter 3: Arithmetic Properties
Chapter 3: Arithmetic Properties CHAPTER 3: ARITHMETIC PROPERTIES Date: Lesson: Learning Log Title: Date: Lesson: Learning Log Title: Chapter 3: Arithmetic Properties Date: Lesson: Learning Log Title:
More informationPart 1. The Review of Linear Programming The Revised Simplex Method
In the name of God Part 1. The Review of Linear Programming 1.4. Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Outline in Tableau Format Comparison Between the Simplex and the Revised Simplex
More informationCHAPTER 5 SYSTEMS OF EQUATIONS. x y
page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [
More informationMath 1B03/1ZC3 - Tutorial 3. Jan. 24th/28th, 2014
Math 1B03/1ZC3 - Tutorial 3 Jan. 24th/28th, 2014 Tutorial Info: Website: http://ms.mcmaster.ca/ dedieula. Math Help Centre: Wednesdays 2:30-5:30pm. Email: dedieula@math.mcmaster.ca. Elementary Matrices
More informationScope and Sequence: National Curriculum Mathematics from Haese Mathematics (4 7)
Scope and Sequence: National Curriculum Mathematics from Haese Mathematics (4 7) http://www.haesemathematics.com.au/ Last updated: 15/04/2016 Year Level Number and Algebra Number and place value Representation
More informationMathematics. 2.1 Introduction: Graphs as Matrices Adjacency Matrix: Undirected Graphs, Directed Graphs, Weighted Graphs CHAPTER 2
CHAPTER Mathematics 8 9 10 11 1 1 1 1 1 1 18 19 0 1.1 Introduction: Graphs as Matrices This chapter describes the mathematics in the GraphBLAS standard. The GraphBLAS define a narrow set of mathematical
More informationEFFICIENT OFFLINE ELECTRONIC CHECKS (Extended Abstract)
EFFICIENT OFFLINE ELECTRONIC CHECKS (Extended Abstract) David Chaum Bert den Boer EugGne van Heyst Stig Mjglsnes Adri S teenbeek Cerme for Mathematics and Computer Science Kruislaan 413, 1098 SJ Amsterdam,
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationOn the computation of the n'th decimal digit of various transcendental numbers. Abstract
08 avril 2001 The n'th decimal digit of Pi Page: 1 On the computation of the n'th decimal digit of various transcendental numbers. by Simon Plouffe November 30, 1996 Abstract We outline a method for computing
More information16.10 Exercises. 372 Chapter 16 Code Improvement. be translated as
372 Chapter 16 Code Improvement 16.10 Exercises 16.1 In Section 16.2 we suggested replacing the instruction r1 := r2 / 2 with the instruction r1 := r2 >> 1, and noted that the replacement may not be correct
More informationComputational Methods CMSC/AMSC/MAPL 460. Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science
Computational Methods CMSC/AMSC/MAPL 460 Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science Zero elements of first column below 1 st row multiplying 1 st
More informationDiscrete Cubic Interpolatory Splines
Publ RIMS, Kyoto Univ. 28 (1992), 825-832 Discrete Cubic Interpolatory Splines By Manjulata SHRIVASTAVA* Abstract In the present paper, existence, uniqueness and convergence properties of a discrete cubic
More informationFreeMat Tutorial. 3x + 4y 2z = 5 2x 5y + z = 8 x x + 3y = -1 xx
1 of 9 FreeMat Tutorial FreeMat is a general purpose matrix calculator. It allows you to enter matrices and then perform operations on them in the same way you would write the operations on paper. This
More informationTUTORIAL 1 Introduction to Matrix Calculation using MATLAB TUTORIAL 1 INTRODUCTION TO MATRIX CALCULATION USING MATLAB
INTRODUCTION TO MATRIX CALCULATION USING MATLAB Learning objectives Getting started with MATLAB and it s user interface Learn some of MATLAB s commands and syntaxes Get a simple introduction to use of
More informationCoupling of surface roughness to the performance of computer-generated holograms
Coupling of surface roughness to the performance of computer-generated holograms Ping Zhou* and Jim Burge College of Optical Sciences, University of Arizona, Tucson, Arizona 85721, USA *Corresponding author:
More informationBasic Matrix Manipulation with a TI-89/TI-92/Voyage 200
Basic Matrix Manipulation with a TI-89/TI-92/Voyage 200 Often, a matrix may be too large or too complex to manipulate by hand. For these types of matrices, we can employ the help of graphing calculators
More informationDeterminant Computation on the GPU using the Condensation AMMCS Method / 1
Determinant Computation on the GPU using the Condensation Method Sardar Anisul Haque Marc Moreno Maza Ontario Research Centre for Computer Algebra University of Western Ontario, London, Ontario AMMCS 20,
More informationThe Application of EXCEL in Teaching Finite Element Analysis to Final Year Engineering Students.
The Application of EXCEL in Teaching Finite Element Analysis to Final Year Engineering Students. Kian Teh and Laurie Morgan Curtin University of Technology Abstract. Many commercial programs exist for
More informationGenerating the Nine-Point Graphs
MATHEMATICS OF COMPUTATION, VOLUME 28, NUMBER 127, JULY 1974, PAGES 833-838 Generating the Nine-Point Graphs By H. H. Baker, A. K. Dewdney and A. L. Szilard Abstract. A program has been written which recently
More informationPerforming Matrix Operations on the TI-83/84
Page1 Performing Matrix Operations on the TI-83/84 While the layout of most TI-83/84 models are basically the same, of the things that can be different, one of those is the location of the Matrix key.
More informationHypercubes. (Chapter Nine)
Hypercubes (Chapter Nine) Mesh Shortcomings: Due to its simplicity and regular structure, the mesh is attractive, both theoretically and practically. A problem with the mesh is that movement of data is
More informationMatrices. A Matrix (This one has 2 Rows and 3 Columns) To add two matrices: add the numbers in the matching positions:
Matrices A Matrix is an array of numbers: We talk about one matrix, or several matrices. There are many things we can do with them... Adding A Matrix (This one has 2 Rows and 3 Columns) To add two matrices:
More informationMatrix Multiplication
Systolic Arrays Matrix Multiplication Is used in many areas of signal processing, graph theory, graphics, machine learning, physics etc Implementation considerations are based on precision, storage and
More informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationAC64/AT64 DESIGN & ANALYSIS OF ALGORITHMS DEC 2014
AC64/AT64 DESIGN & ANALYSIS OF ALGORITHMS DEC 214 Q.2 a. Design an algorithm for computing gcd (m,n) using Euclid s algorithm. Apply the algorithm to find gcd (31415, 14142). ALGORITHM Euclid(m, n) //Computes
More informationADAPTIVE TILE CODING METHODS FOR THE GENERALIZATION OF VALUE FUNCTIONS IN THE RL STATE SPACE A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL
ADAPTIVE TILE CODING METHODS FOR THE GENERALIZATION OF VALUE FUNCTIONS IN THE RL STATE SPACE A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY BHARAT SIGINAM IN
More informationKeywords - DWT, Lifting Scheme, DWT Processor.
Lifting Based 2D DWT Processor for Image Compression A. F. Mulla, Dr.R. S. Patil aieshamulla@yahoo.com Abstract - Digital images play an important role both in daily life applications as well as in areas
More informationEncryption à la Mod Name
Rock Around the Clock Part Encryption à la Mod Let s call the integers,, 3,, 5, and the mod 7 encryption numbers and define a new mod 7 multiplication operation, denoted by, in the following manner: a
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationParallel Hybrid Monte Carlo Algorithms for Matrix Computations
Parallel Hybrid Monte Carlo Algorithms for Matrix Computations V. Alexandrov 1, E. Atanassov 2, I. Dimov 2, S.Branford 1, A. Thandavan 1 and C. Weihrauch 1 1 Department of Computer Science, University
More informationEE T32/ELECTRIC CIRCUIT ANALYSIS
UNIT- III NETWORK TOPOLOGY Network Topology: Network terminology - Graph of a network - Incidence and reduced incidence matrices Trees Cutsets - Fundamental cutsets - Cutset matrix Tiesets Link currents
More informationModular Arithmetic. Marizza Bailey. December 14, 2015
Modular Arithmetic Marizza Bailey December 14, 2015 Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find a quicker
More informationUNCLASSIFIED , DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFC,;MATION STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED
UNCLASSIFIED,419599 AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFC,;MATION CAMERON STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED smazo: Vem gweainat or other drwidnu, spt. ttions or other
More information1 Definition of Reduction
1 Definition of Reduction Problem A is reducible, or more technically Turing reducible, to problem B, denoted A B if there a main program M to solve problem A that lacks only a procedure to solve problem
More informationIdentity Matrix: >> eye(3) ans = Matrix of Ones: >> ones(2,3) ans =
Very Basic MATLAB Peter J. Olver January, 2009 Matrices: Type your matrix as follows: Use space or, to separate entries, and ; or return after each row. >> [;5 0-3 6;; - 5 ] or >> [,5,6,-9;5,0,-3,6;7,8,5,0;-,,5,]
More information1. (a) O(log n) algorithm for finding the logical AND of n bits with n processors
1. (a) O(log n) algorithm for finding the logical AND of n bits with n processors on an EREW PRAM: See solution for the next problem. Omit the step where each processor sequentially computes the AND of
More informationTurku PET Centre Modelling report TPCMOD Appendix C Marketta Hiissa. Pseudo-code for the Markov random field clustering algorithm
Turku PET Centre Modelling report TPCMOD0029 2004-08-19 Appendix C Marketta Hiissa Pseudo-code for the Markov random field clustering algorithm The idea of the algorithm The aim of the clustering is to
More informationMississippi College and Career Readiness Standards for Mathematics Scaffolding Document. Grade 4
Mississippi College and Career Readiness Standards for Mathematics Scaffolding Document Grade 4 Operations and Algebraic Thinking (OA) Use the four operations with whole numbers to solve problems 4.OA.1
More informationDouble-precision General Matrix Multiply (DGEMM)
Double-precision General Matrix Multiply (DGEMM) Parallel Computation (CSE 0), Assignment Andrew Conegliano (A0) Matthias Springer (A00) GID G-- January, 0 0. Assumptions The following assumptions apply
More informationMAT 275 Laboratory 2 Matrix Computations and Programming in MATLAB
MATLAB sessions: Laboratory MAT 75 Laboratory Matrix Computations and Programming in MATLAB In this laboratory session we will learn how to. Create and manipulate matrices and vectors.. Write simple programs
More informationChapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known
More informationMonday, January 27, 2014
Monday, January 27, 2014 Topics for today History of Computing (brief) Encoding data in binary Unsigned integers Signed integers Arithmetic operations and status bits Number conversion: binary to/from
More informationDyck-Eulerian digraphs
Dyck-Eulerian digraphs Pietro Codara 1,2 Ottavio M. D Antona 3 Dipartimento di Informatica Università degli Studi di Milano Via Comelico 39, I-20135 Milan, Italy Abstract We introduce a family of Eulerian
More informationArrays, Matrices and Determinants
Arrays, Matrices and Determinants Spreadsheet calculations lend themselves almost automatically to the use of arrays of values. Arrays in Excel can be either one- or two-dimensional. For the solution of
More information0_PreCNotes17 18.notebook May 16, Chapter 12
Chapter 12 Notes BASIC MATRIX OPERATIONS Matrix (plural: Matrices) an n x m array of elements element a ij Example 1 a 21 = a 13 = Multiply Matrix by a Scalar Distribute scalar to all elements Addition
More informationME305: Introduction to System Dynamics
ME305: Introduction to System Dynamics Using MATLAB MATLAB stands for MATrix LABoratory and is a powerful tool for general scientific and engineering computations. Combining with user-friendly graphics
More informationApplMath Lucie Kárná; Štěpán Klapka Message doubling and error detection in the binary symmetrical channel.
ApplMath 2015 Lucie Kárná; Štěpán Klapka Message doubling and error detection in the binary symmetrical channel In: Jan Brandts and Sergej Korotov and Michal Křížek and Karel Segeth and Jakub Šístek and
More informationFinite Math - J-term Homework. Section Inverse of a Square Matrix
Section.5-77, 78, 79, 80 Finite Math - J-term 017 Lecture Notes - 1/19/017 Homework Section.6-9, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.1-9, 11, 1, 13, 1, 17, 9, 30 Section.5 - Inverse
More informationVertex Magic Total Labelings of Complete Graphs 1
Vertex Magic Total Labelings of Complete Graphs 1 Krishnappa. H. K. and Kishore Kothapalli and V. Ch. Venkaiah Centre for Security, Theory, and Algorithmic Research International Institute of Information
More informationLecture 5: Matrices. Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur
Lecture 5: Matrices Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur 29 th July, 2008 Types of Matrices Matrix Addition and Multiplication
More informationCurriculum Map: Mathematics
Curriculum Map: Mathematics Course: Honors Advanced Precalculus and Trigonometry Grade(s): 11-12 Unit 1: Functions and Their Graphs This chapter will develop a more complete, thorough understanding of
More information4.4 Example of [ Z Bus ] matrix formulation in the presence of mutual impedances
4.4 Example of [ Z matrix formulation in the presence of mutual impedances Consider the network shown in Fig. 4.32. Figure 4.32: The power system for [ Z example A tree for the network is shown in Fig.
More informationLow Complexity Opportunistic Decoder for Network Coding
Low Complexity Opportunistic Decoder for Network Coding Bei Yin, Michael Wu, Guohui Wang, and Joseph R. Cavallaro ECE Department, Rice University, 6100 Main St., Houston, TX 77005 Email: {by2, mbw2, wgh,
More informationRevision Problems for Examination 2 in Algebra 1
Centre for Mathematical Sciences Mathematics, Faculty of Science Revision Problems for Examination in Algebra. Let l be the line that passes through the point (5, 4, 4) and is at right angles to the plane
More informationDiagonal versus affine transformations for color correction
2108 J. Opt. oc. Am. A/ Vol. 17, No. 11/ November 2000 JOA Communications Diagonal versus affine transformations for color correction Brian V. Funt and Benjamin C. ewis chool of Computing cience, imon
More informationData Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi
Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 20 Priority Queues Today we are going to look at the priority
More informationTime: 1 hour 30 minutes
Paper Reference(s) 666/0 Edecel GCE Core Mathematics C Bronze Level B Time: hour 0 minutes Materials required for eamination Mathematical Formulae (Green) Items included with question papers Nil Candidates
More informationTiling Rectangles. ...would be encoded as (4 2 1) (1) (1 2) (1) Problem Description
Tiling Rectangles Akshay Singh (akki) sakshay@gmail.com June 1, 2011 Given a rectangular area with integral dimensions, that area can be subdivided into square subregions, also with integral dimensions.
More informationGraph drawing in spectral layout
Graph drawing in spectral layout Maureen Gallagher Colleen Tygh John Urschel Ludmil Zikatanov Beginning: July 8, 203; Today is: October 2, 203 Introduction Our research focuses on the use of spectral graph
More information8.11 Multivariate regression trees (MRT)
Multivariate regression trees (MRT) 375 8.11 Multivariate regression trees (MRT) Univariate classification tree analysis (CT) refers to problems where a qualitative response variable is to be predicted
More informationBulgarian Math Olympiads with a Challenge Twist
Bulgarian Math Olympiads with a Challenge Twist by Zvezdelina Stankova Berkeley Math Circle Beginners Group September 0, 03 Tasks throughout this session. Harder versions of problems from last time appear
More informationMARK SCHEME for the October/November 2013 series 0580 MATHEMATICS
CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education MARK SCHEME for the October/November 01 series 0580 MATHEMATICS 0580/4 Paper 4 (Extended), maximum raw mark
More informationLong Live the HP-15C!
Long Live the HP-15C! Valentín Albillo (Ex-PPC #4747, HPCC #1075) According to Wlodek s superb Guide to HP Handheld Calculators and Computers, the HP-15C was released in July, 1982, and it was meant to
More informationLesson 11: Duality in linear programming
Unit 1 Lesson 11: Duality in linear programming Learning objectives: Introduction to dual programming. Formulation of Dual Problem. Introduction For every LP formulation there exists another unique linear
More informationAssignment 1 (concept): Solutions
CS10b Data Structures and Algorithms Due: Thursday, January 0th Assignment 1 (concept): Solutions Note, throughout Exercises 1 to 4, n denotes the input size of a problem. 1. (10%) Rank the following functions
More informationMapping Common Core State Standard Clusters and. Ohio Grade Level Indicator. Grade 5 Mathematics
Mapping Common Core State Clusters and Ohio s Grade Level Indicators: Grade 5 Mathematics Operations and Algebraic Thinking: Write and interpret numerical expressions. Operations and Algebraic Thinking:
More informationChapter 4: Implicit Error Detection
4. Chpter 5 Chapter 4: Implicit Error Detection Contents 4.1 Introduction... 4-2 4.2 Network error correction... 4-2 4.3 Implicit error detection... 4-3 4.4 Mathematical model... 4-6 4.5 Simulation setup
More informationResource sharing and blocking. The Mars Pathfinder Unbounded priority inversion Priority inheritance
Resource sharing and blocking The Mars Pathfinder Unbounded priority inversion Priority inheritance 1 Lecture overview Unbounded priority inversion problem (occurred in the Mars Pathfinder) Blocking and
More informationth Grade Math Curriculum Map
Standards Quarter 1 Dates Taught (For Teacher Use) Number and Operations in Base Ten Understand the place value system (Major Work) 5.NBT.1 Recognize that in a multi-digit number, a digit in one place
More informationUsing Templates to Introduce Time Efficiency Analysis in an Algorithms Course
Using Templates to Introduce Time Efficiency Analysis in an Algorithms Course Irena Pevac Department of Computer Science Central Connecticut State University, New Britain, CT, USA Abstract: We propose
More informationSimplifying Square Root Expressions[In Class Version][Algebra 1 Honors].notebook August 26, Homework Assignment. Example 5 Example 6.
Homework Assignment The following examples have to be copied for next class Example 1 Example 2 Example 3 Example 4 Example 5 Example 6 Example 7 Example 8 Example 9 Example 10 Example 11 Example 12 The
More informationArea of Kite Students are asked to find the area of a kite by composing it into rectangles or decomposing it into triangles.
Status: Published This is a resource from CPALMS (www.cpalms.org) where all educators go for bright ideas! Resource ID#: 65099 Primary Type: Formative Assessment Area of Kite Students are asked to find
More informationProblem. Prove that the square of any whole number n is a multiple of 4 or one more than a multiple of 4.
CHAPTER 8 Integers Problem. Prove that the square of any whole number n is a multiple of 4 or one more than a multiple of 4. Strategy 13 Use cases. This strategy may be appropriate when A problem can be
More informationThe Football Pool Problem for 5 Matches
JOURNAL OF COMBINATORIAL THEORY 3, 35-325 (967) The Football Pool Problem for 5 Matches H. J. L. KAMPS AND J. H. VAN LINT Technological University, Eindhoven, The Netherlands Communicated by N. G. debruijn
More information5 R1 The one green in the same place so either of these could be green.
Page: 1 of 20 1 R1 Now. Maybe what we should do is write out the cases that work. We wrote out one of them really very clearly here. [R1 takes out some papers.] Right? You did the one here um where you
More informationSINGULARITY-FREE COMPUTATION OF QUATERNIONS FROM ROTATION MATRICES IN E 4 AND E 3 S. Sarabandi a, A. Perez-Gracia b and F.
SINGULARITY-FREE COMPUTATION OF QUATERNIONS FROM ROTATION MATRICES IN E AND E 3 S. Sarabi a, A. Perez-Gracia b F. Thomas c a Institut de Robòtica i Informàtica Industrial (CSIC-UPC) Llorens Artigas -6,
More informationA modification of the simplex method reducing roundoff errors
A modification of the simplex method reducing roundoff errors Ralf Ulrich Kern Georg-Simon-Ohm-Hochschule Nürnberg Fakultät Informatik Postfach 21 03 20 90121 Nürnberg Ralf-Ulrich.Kern@ohm-hochschule.de
More informationYear 7 Key Performance Indicators Maths (Number)
Key Performance Indicators Maths (Number) M7.1 N1: I can use the four operations to answer calculations involving decimals. Use correct notation for recurring decimals, know the denominators of simple
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers & Number Systems
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics Numbers & Number Systems Introduction Numbers and Their Properties Multiples and Factors The Division Algorithm Prime and Composite Numbers Prime Factors
More information