# Visualization of General Defined Space Data

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 013 Visualization of General Defined Space Data John R Rankin La Trobe University, Australia Abstract A new algorithm is presented which determines the dimensionality and signature of a measured space. The algorithm generalizes the Map Maker s algorithm from D to n dimensions and works the same for D measured spaces as the Map Maker s algorithm but with better efficiency. The difficulty of generalizing the geometric approach of the Map Maker s algorithm from D to 3D and then to higher dimensions is avoided by using this new approach. The new algorithm preserves all distances of the distance matrix and also leads to a method for building the curved space as a subset of the N-1 dimensional embedding space. This algorithm has direct application to Scientific Visualization for data viewing and searching based on Computational Geometry. Categories and Subject Descriptors: I.3.3 Viewing algorithms, I.3.5 Computational Geometry and Object Modelling 1. Introduction The Map Maker s problem is to convert a measured space into a two-dimensional coordinatized space. This is well achieved by the Map Maker s algorithm [Ran13]. However the assumption in that process is that the distance matrix of the measured space corresponds at least roughly to a flat two-dimensional space. When this is true the Map Maker s algorithm is distance preserving. In general however this would not be the case and then the Map Maker s algorithm does not preserve all distances. A measured space is defined by a set of sites i = 1 to N and their measured separations d ij where d ij is the shortest distance between site i and site j. The set of NxN distances d ij is called the Distance Matrix. This matrix is symmetric and trace-free with zeros down the principal diagonal. Thus a set of known sites and their distance matrix constitutes what is called a defined (or measured) space. Research based on distance matrices has had wide applications such as in signal processing [PC9], pattern recognition [ZWZ08] and medical imaging [PE*09]. One of the foundational research efforts [LSB77] resulted in Lee s algorithm for projecting n-dimensional distance matrix data to two dimensions for visualization. Lee s algorithm does not determine the n-dimensional coordinates of the points involved but goes straight to a projection of those points in D. In the process of this projection most of the distance information is not preserved in the visualization. Other approaches such as LLE preserve distances just in the local neighbourhood of a chosen point [RS00, TSL00]. In the research presented here the coordinatization and projection processes are separated one is free to apply any desired projection transformation to the coordinatized data. Surprisingly, from the distance matrix d ij one can determine the dimensionality and signature of the space that it defines as well as the coordinates for the sites and the algorithm presented in this paper demonstrates this. DOI : /ijcga

2 International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 013 The algorithm presented here, called the Coordinatizator algorithm, does not require any special ordering of the sites before processing. The given ordering of the sites however determines the directions and orientations of all axes in the building of the n-dimensional space. Re-orderings of the sites therefore may be done for other reasons such as desired axial directions or reduction in numerical errors. The Coordinatizator algorithm coordinatizes by considering the sequence of simplices S k = P 1 P P k with vertices P i for i = 1 to k and setting up orthogonal axes for these simplices.. Coordinatizator Process The Coordinatizator algorithm uses the given sites to construct axes and produce coordinates for each of the sites. As in the Map Maker s algorithm, site 1 is taken as the origin so it is coordinatized as the point: P 1 = (0, 0, 0, 0...) The direction from site 1 to site is taken as the x-axis or the first axis so therefore site is coordinatized as the point: P = (x 1, 0, 0, 0...) and obviously x 1 = d 1. The triangle of site 1 to site to site 3 defines the x-y plane and thus the -axis (i.e. the y-axis which is perpendicular to the 1-axis which is the x-axis). Therefore P 3 is coordinatized as the point: P 3 = (x 31, x 3, 0, 0, 0...) The tetrahedron formed by the first 4 sites defines the third axial direction perpendicular to the first two. Thus site 4 is coordinatized as the point: P 4 = (x 41, x 4, x 43, 0, 0, 0...) and so forth in general: P i = (x i1, x i, x i3,, x ii-1,0, 0, 0, 0...) for i = 1 to N where N is the number of sites and the size of the Distance Matrix. This process of converting the Distance Matrix into a set of N points in n-dimensional space generally creates a non-euclidean space of n = N-1 dimensions. We add the points progressively by building up a simplex from 0 dimensions to n = N-1 dimensions. However it is possible that at some step the added point is degenerate and the dimension does not increase for that step in general the dimensionality of the measured space is bounded above by N-1, n N-1. It is interesting that every time another point say the k+1th point is added, we only have to consider k more edges since d ij = d ji. The Coordinatizator algorithm solves the following mathematical equations for the x ij given the d ij. Investigation into these equations found that the algebraic solution was possible for the general n-dimensional case. 16

3 International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 013 Given: P 1 = (0, 0, 0, 0...) P = (x 1, 0, 0, 0...) P 3 = (x 31, x 3, 0, 0, 0...) P 4 = (x 41, x 4, x 43, 0, 0, 0...) P 5 = (x 51, x 5, x 53, x 54, 0, 0, 0...) ::::: P i = (x i1, x i, x i3,, x ii-1,0, 0, 0, 0...) The unknowns x ij in the above equations can be solved for k = 1 to N by the following procedure. Every coordinatization is extended to higher dimensions by appending the additional required number of zeros in the n-tuple. For k = 1 we consider only point P 1 and coordinatize it by assign it to the 0 dimensional origin. For k = we bring in point P and get: d 1 = (P - P 1 )(P - P 1 ) = x 1 and without loss of generality we choose: x 1 = d 1 and thereby coordinatize P as the 1 dimensional point (x 1 ). For k = 3 we bring in point P 3 and coordinatize it by getting: d 13 = (P 3 - P 1 )(P 3 - P 1 ) = x 31 + x 3 d 3 = (P 3 - P )(P 3 - P ) = (x 31 -x 1 ) + x 3 Subtracting gives: d 13 - d 3 = x 1 x 31 - x 1 x 31 = (d 13 - d 3 + x 1 )/(x 1 ) and therefore Now if the term in the square root is negative then we have non-euclidean flat space. We will consider this type of situation later on. Here we will take the positive root without loss of generality since this will be the first point with a y component. For k = 4 we are adding in P 4 and we have these three equations to consider: d 14 = (P 4 - P 1 )(P 4 - P 1 ) = x 41 + x 4 + x 43 d 4 = (P 4 - P )(P 4 - P ) = (x 41 -x 1 ) + x 4 + x 43 d 34 = (P 4 - P 3 )(P 4 - P 3 ) = (x 41 -x 31 ) + (x 4 -x 3 ) + x 43 Therefore: d 14 - d 4 = x 1 x 41 - x 1 x 41 = (d 14 - d 4 + x 1 )/(x 1 ) Secondly d 4 - d 34 = (x 41 -x 1 ) - (x 41 -x 31 ) + x 3 x 4 - x 3 17

4 International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 013 x 4 = (d 4 - d 34 - (x 41 -x 1 ) + (x 41 -x 31 ) + x 3 )/(x 3 ) Finally we get: Now if the term in the square root is negative then we have non-euclidean flat space. We will consider this type of situation later on. Here we will take the positive root without loss of generality since this will be the first point with a z component (i.e. 3rd or kth component). For k = 5 we are adding in P 5 and we have these four equations to consider: d 15 = (P 5 - P 1 )(P 5 - P 1 ) = x 51 + x 5 + x 53 + x 54 d 5 = (P 5 - P )(P 5 - P ) = (x 51 -x 1 ) + x 5 + x 53 + x 54 d 35 = (P 5 - P 3 )(P 5 - P 3 ) = (x 51 -x 31 ) + (x 5 -x 3 ) + x 53 + x 54 d 45 = (P 5 - P 4 )(P 5 - P 4 ) = (x 51 -x 41 ) + (x 5 -x 4 ) + (x 53 -x 43 ) + x 54 Therefore: d 15 - d 5 = x 1 x 51 - x 1 x 51 = (d 15 - d 5 + x 1 )/(x 1 ) Secondly d 5 - d 35 = (x 51 -x 1 ) - (x 51 -x 31 ) + x 3 x 5 - x 3 x 5 = (d 5 - d 35 - (x 51 -x 1 ) + (x 51 -x 31 ) + x 3 )/(x 3 ) Thirdly d 35 - d 45 = (x 51 -x 31 ) - (x 51 -x 41 ) + (x 5 -x 3 ) - (x 5 -x 4 ) + x 43 x 53 - x 43 x 53 = (d 35 - d 45 - (x 51 -x 31 ) + (x 51 -x 41 ) - (x 5 -x 3 ) + (x 5 -x 4 ) + x 43 )/(x 43 ) Finally we get: Now if the term in the square root is negative then we have non-euclidean flat space. We will consider this type of situation later on. Here we will take the positive root without loss of generality since this will be the first point with a kth component. This forms a clear pattern for any value of k >= 1 and hence the algorithm can be worked for any value of N. 3. Imaginery Components The quantities under the square root signs in the equations above could be positive, zero or negative giving rise to three important cases to consider. If the quantity is positive we have an extra Euclidean dimension for housing the points. If the quantity is zero then we have sufficient dimensions already and an extra dimension is not (yet) required for embedding the points considered so far. If the quantity is negative then the Euclidean space becomes pseudo-euclidean [Wik13a] like Minkowski space in Special Relativity where time is an imaginary extra axial dimension for three-dimensional space. As in Relativity, the invariant quadratic form then is no 18

5 International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 013 longer positive definite and is properly termed a pseudo-metric though it is common to continue to call it a metric anyway). Sylvester s Theorem [Wik13b] states that the matrix for any quadratic form can be diagonalized by a suitable change of coordinates and with rescalings the diagonal elements are only {-1,0,1} and furthermore the number of +1s (called the positive index of inertia n + ) and the number of 0s (n 0 )and the number of -1s (called the negative index of inertia n - ) is invariant no matter what recoordinatization is chosen. Clearly n + + n 0 + n - = N-1 The dimensionality of the measured space is given by n = n + + n - The signature of the measured space is given by s = n + - n - Knowing the dimensionality, the signature and N is equivalent to knowing n +, n 0 and n - which the Coordinatization algorithm provides. The Corrdinatizator algorithm automatically determines these quantities by noting the sign of the quantities under the square root. The presentation of the algorithm below explicitly indicates these quantities. 4. Coding the Algorithm We have an outer loop for k = 1 to N. In each loop we determine k constants which are the nonzero components of P k. Computing the next component depends on the values of all previously computed components. Essentially we are constructing a new output NxN matrix called x from a given input NxN matrix called d. The input matrix cannot have negative values, must be symmetric and its principal diagonal should consist only of zeros. The output matrix is lowertriangular it also has zeros on its principal diagonal. In both cases the matrix indices run from 1 to N. So the algorithm looks like this: Inputs: The NxN distance matrix d[i,j] Outputs: The NxN matrix of point components x[i,j]. Initialize all x[i,j] = 0 -: for i = 1 to N for j = 1 to N x[i,j] = 0 PositiveIndex = 0 NegativeIndex = 0 for k = 1 to N l = k-1 for i = 1 to l-1 sum = Sq(d[i,k]) - Sq(d[i+1,k]) for j = 1 to i-1 sum += - Sq(x[k,j] - x[i,j]) sum += + Sq(x[k,j] - x[i+1,j]) sum += Sq(x[i+1,i]) x[k,i] = sum//x[i+1,i] 19

6 International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 013 sum = Sq(d[l,k]) for i = 1 to l-1 sum = sum - Sq(x[l,i]-x[k,i]) if sum > 0 PositiveIndex++ x[l,k] = SqRoot(sum) if sum < 0 NegativeIndex++ x[l,k] = SqRoot(-sum) 5. Curvature, Dimensionality and Degeneracy We will start by assuming that the N sites define a space of dimensionality n = N-1. If for any k in the algorithm we find x k+1k is zero or close to it then we will reduce the dimensionality n of the data space by 1. The Coordinatizator algorithm does not search for curvature in the space nor the dimensionality of the embedding space, so the defined space be either a flat n-dimensional Euclidean space or a flat n-dimensional pseudo-euclidean space. When there is degeneracy one has to check whether the negative is the right solution i.e. it gives the right distances to the other points before it according to the distance matrix as described in the Map Maker s algorithm. 6. Conclusions The Coordinatizator algorithm presented in this paper maps sites to an n-dimensional pseudo- Euclidean space preserving all distances of the given distance matrix. The algorithm returns the positive index of inertia and the negative index of inertia of the pseudo-metric of the pseudo- Euclidean space. If the negative index is zero then the space is pure Euclidean and the triangle inequality [Wik13c] is valid for all triplets of points within it. If the negative index is non-zero then the triangle inequality is reversed but only for the subspace of points spanned by the imaginary axial directions. Once this algorithm is applied to defined space data projection mappings can be applied to view the n-dimensional data on a flat screen. The Coordinatizator algorithm effectively maps one NxN lower triangular matrix (d ij ) to another NxN lower triangular matrix (x ij ) and this would allow us to reduce memory needs by storing data in a single square NxN real matrix. References [1]. [Fer57] Ferrar W, Algebra A Textbook of Determinants, Matrices and Algebraic Forms, Oxford University Press, nd edition, 1957, p 154. []. [LSB77] Lee R, Slagle J & Blum H, A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space, 1977, IEEE Transaction on Computers, pp [3]. [PC9] Potter L & Chiang D, Distance Matrices and Modified Cyclic Projections for Molecular Conformation, Acoustics, Speech and Signal Processing 199, Vol 4, pp [4]. [PE*09] Pham T, Eisenblatter U, Golledge J, Baune B & Berger K, Segmentation of Medical Images Using Geo-theoretic Distance Matrix in Fuzzy Clustering, Image Processing (ICIP) 009, pp

7 International Journal of Computer Graphics & Animation (IJCGA) Vol.3, No.4, October 013 [5]. [Ran13] Rankin J, Map Making From Tables, International Journal of Computer Graphics and Animation, vol 3, no, 013, pp [6]. [RS00] Rowels S & Saul L, Nonlinear Dimensionality Reduction by Locally Linear Embedding, Science, Vol 90, December 000, pp [7]. [Sle10] Sledge I, A Projection Transform for non-euclidean Relational Clustering, Neural Networks (IJCNN) 010, pp 1-8. [8]. [TSL00] Tenembaum J, de Silva V & Langford J, A Global Geometric Framework for Nonlinear Diemsionality Reduction, Science, Vol 90, December 000, pp [9]. [TT*1] Tzagkarakis G, Tsagkatakis G, Starck J & Tsakalides P, Compressive Video Classification in a Low-dimensional Manifold with Learned Distance Matrix, 0 th European Signal Processing Conference [EUSIPCO 01], 01, pp [10]. [Wik13a] PseudoEuclidean spaces Wikipedia, 011 [11]. [1]. [Wik13b] Sylvester s Law of Inertia, Wikipedia, 013 [13]. [14]. [Wik13c] Triangle Inequality, Wikepedia [15]. [16]. [YR13] Youldash M & Rankin J, Evaluation of a Geometric Approach to the Coordinatization of Measured Spaces, 8 th International Conference on Information Technology and Applications (ICITA 013), Sydney, Australia July 013. [17]. [ZWZ08] Zuo W, Wang K & Zhang D, Assembled Matrix Distance Metric for DPCA-based Face and Palmprint Recognition, Machine Learning and Cybernetics 008, Vol 8, pp

### Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

### Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

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

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### Linear Algebra Review. Vectors

Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

### Math 215 HW #6 Solutions

Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T

### Manifold Learning Examples PCA, LLE and ISOMAP

Manifold Learning Examples PCA, LLE and ISOMAP Dan Ventura October 14, 28 Abstract We try to give a helpful concrete example that demonstrates how to use PCA, LLE and Isomap, attempts to provide some intuition

### MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

### What are the place values to the left of the decimal point and their associated powers of ten?

The verbal answers to all of the following questions should be memorized before completion of algebra. Answers that are not memorized will hinder your ability to succeed in geometry and algebra. (Everything

### State of Stress at Point

State of Stress at Point Einstein Notation The basic idea of Einstein notation is that a covector and a vector can form a scalar: This is typically written as an explicit sum: According to this convention,

### CHAPTER 4 4. METHODS FOR MEASURING DISTANCE IN IMAGES

50 CHAPTER 4 4. METHODS FOR MEASURING DISTANCE IN IMAGES 4.1. INTRODUCTION In image analysis, the distance transform measures the distance of each object point from the nearest boundary and is an important

### KEANSBURG SCHOOL DISTRICT KEANSBURG HIGH SCHOOL Mathematics Department. HSPA 10 Curriculum. September 2007

KEANSBURG HIGH SCHOOL Mathematics Department HSPA 10 Curriculum September 2007 Written by: Karen Egan Mathematics Supervisor: Ann Gagliardi 7 days Sample and Display Data (Chapter 1 pp. 4-47) Surveys and

### Factoring Patterns in the Gaussian Plane

Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 1 Introduction to Matrices

1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns

### Nonlinear Iterative Partial Least Squares Method

Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for

### Bedford, Fowler: Statics. Chapter 4: System of Forces and Moments, Examples via TK Solver

System of Forces and Moments Introduction The moment vector of a force vector,, with respect to a point has a magnitude equal to the product of the force magnitude, F, and the perpendicular distance from

### Common Core Unit Summary Grades 6 to 8

Common Core Unit Summary Grades 6 to 8 Grade 8: Unit 1: Congruence and Similarity- 8G1-8G5 rotations reflections and translations,( RRT=congruence) understand congruence of 2 d figures after RRT Dilations

### Notes on the representational possibilities of projective quadrics in four dimensions

bacso 2006/6/22 18:13 page 167 #1 4/1 (2006), 167 177 tmcs@inf.unideb.hu http://tmcs.math.klte.hu Notes on the representational possibilities of projective quadrics in four dimensions Sándor Bácsó and

### Metrics on SO(3) and Inverse Kinematics

Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction

### Dimensionality Reduction: Principal Components Analysis

Dimensionality Reduction: Principal Components Analysis In data mining one often encounters situations where there are a large number of variables in the database. In such situations it is very likely

### Algebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.

Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.

### Linear algebra and the geometry of quadratic equations. Similarity transformations and orthogonal matrices

MATH 30 Differential Equations Spring 006 Linear algebra and the geometry of quadratic equations Similarity transformations and orthogonal matrices First, some things to recall from linear algebra Two

### Prentice Hall Algebra 2 2011 Correlated to: Colorado P-12 Academic Standards for High School Mathematics, Adopted 12/2009

Content Area: Mathematics Grade Level Expectations: High School Standard: Number Sense, Properties, and Operations Understand the structure and properties of our number system. At their most basic level

### Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

### THREE DIMENSIONAL GEOMETRY

Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,

### Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks

Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson

### Linear Algebra: Vectors

A Linear Algebra: Vectors A Appendix A: LINEAR ALGEBRA: VECTORS TABLE OF CONTENTS Page A Motivation A 3 A2 Vectors A 3 A2 Notational Conventions A 4 A22 Visualization A 5 A23 Special Vectors A 5 A3 Vector

### Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.

This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra

### Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

### x1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.

Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability

### Students will understand 1. use numerical bases and the laws of exponents

Grade 8 Expressions and Equations Essential Questions: 1. How do you use patterns to understand mathematics and model situations? 2. What is algebra? 3. How are the horizontal and vertical axes related?

### Vector Spaces; the Space R n

Vector Spaces; the Space R n Vector Spaces A vector space (over the real numbers) is a set V of mathematical entities, called vectors, U, V, W, etc, in which an addition operation + is defined and in which

### α = u v. In other words, Orthogonal Projection

Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

### THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS

THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS O.U. Sezerman 1, R. Islamaj 2, E. Alpaydin 2 1 Laborotory of Computational Biology, Sabancı University, Istanbul, Turkey. 2 Computer Engineering

### Geometry of Vectors. 1 Cartesian Coordinates. Carlo Tomasi

Geometry of Vectors Carlo Tomasi This note explores the geometric meaning of norm, inner product, orthogonality, and projection for vectors. For vectors in three-dimensional space, we also examine the

### Finite Element Formulation for Plates - Handout 3 -

Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the

### Current Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary

Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:

### GRADES 7, 8, AND 9 BIG IDEAS

Table 1: Strand A: BIG IDEAS: MATH: NUMBER Introduce perfect squares, square roots, and all applications Introduce rational numbers (positive and negative) Introduce the meaning of negative exponents for

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

Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

### Vectors 2. The METRIC Project, Imperial College. Imperial College of Science Technology and Medicine, 1996.

Vectors 2 The METRIC Project, Imperial College. Imperial College of Science Technology and Medicine, 1996. Launch Mathematica. Type

### Geometry and Measurement

The student will be able to: Geometry and Measurement 1. Demonstrate an understanding of the principles of geometry and measurement and operations using measurements Use the US system of measurement for

### MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

### Algebra 1-2. A. Identify and translate variables and expressions.

St. Mary's College High School Algebra 1-2 The Language of Algebra What is a variable? A. Identify and translate variables and expressions. The following apply to all the skills How is a variable used

### Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

### Georgia Standards of Excellence Curriculum Map. Mathematics. GSE 8 th Grade

Georgia Standards of Excellence Curriculum Map Mathematics GSE 8 th Grade These materials are for nonprofit educational purposes only. Any other use may constitute copyright infringement. GSE Eighth Grade

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Recall that two vectors in are perpendicular or orthogonal provided that their dot

Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal

### Year 9 set 1 Mathematics notes, to accompany the 9H book.

Part 1: Year 9 set 1 Mathematics notes, to accompany the 9H book. equations 1. (p.1), 1.6 (p. 44), 4.6 (p.196) sequences 3. (p.115) Pupils use the Elmwood Press Essential Maths book by David Raymer (9H

### Pennsylvania System of School Assessment

Pennsylvania System of School Assessment The Assessment Anchors, as defined by the Eligible Content, are organized into cohesive blueprints, each structured with a common labeling system that can be read

### A BRIEF GUIDE TO ABSOLUTE VALUE. For High-School Students

1 A BRIEF GUIDE TO ABSOLUTE VALUE For High-School Students This material is based on: THINKING MATHEMATICS! Volume 4: Functions and Their Graphs Chapter 1 and Chapter 3 CONTENTS Absolute Value as Distance

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### We call this set an n-dimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.

Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to

### ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.

ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional

### AP Physics - Vector Algrebra Tutorial

AP Physics - Vector Algrebra Tutorial Thomas Jefferson High School for Science and Technology AP Physics Team Summer 2013 1 CONTENTS CONTENTS Contents 1 Scalars and Vectors 3 2 Rectangular and Polar Form

### TWO-DIMENSIONAL TRANSFORMATION

CHAPTER 2 TWO-DIMENSIONAL TRANSFORMATION 2.1 Introduction As stated earlier, Computer Aided Design consists of three components, namely, Design (Geometric Modeling), Analysis (FEA, etc), and Visualization

### Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors

1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number

### The basic unit in matrix algebra is a matrix, generally expressed as: a 11 a 12. a 13 A = a 21 a 22 a 23

(copyright by Scott M Lynch, February 2003) Brief Matrix Algebra Review (Soc 504) Matrix algebra is a form of mathematics that allows compact notation for, and mathematical manipulation of, high-dimensional

### Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects include

### BookTOC.txt. 1. Functions, Graphs, and Models. Algebra Toolbox. Sets. The Real Numbers. Inequalities and Intervals on the Real Number Line

College Algebra in Context with Applications for the Managerial, Life, and Social Sciences, 3rd Edition Ronald J. Harshbarger, University of South Carolina - Beaufort Lisa S. Yocco, Georgia Southern University

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### Florida Math for College Readiness

Core Florida Math for College Readiness Florida Math for College Readiness provides a fourth-year math curriculum focused on developing the mastery of skills identified as critical to postsecondary readiness

### ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

### Lecture 1: Systems of Linear Equations

MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables

### Visualization by Linear Projections as Information Retrieval

Visualization by Linear Projections as Information Retrieval Jaakko Peltonen Helsinki University of Technology, Department of Information and Computer Science, P. O. Box 5400, FI-0015 TKK, Finland jaakko.peltonen@tkk.fi

### Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections 4.6 and 1.1) 8.1 Equivalent Inequalities Definition 8.1 Two inequalities are equivalent

### 2. THE x-y PLANE 7 C7

2. THE x-y PLANE 2.1. The Real Line When we plot quantities on a graph we can plot not only integer values like 1, 2 and 3 but also fractions, like 3½ or 4¾. In fact we can, in principle, plot any real

### with functions, expressions and equations which follow in units 3 and 4.

Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model

### MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0

### Figure 1.1 Vector A and Vector F

CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### 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

Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col

### Precalculus REVERSE CORRELATION. Content Expectations for. Precalculus. Michigan CONTENT EXPECTATIONS FOR PRECALCULUS CHAPTER/LESSON TITLES

Content Expectations for Precalculus Michigan Precalculus 2011 REVERSE CORRELATION CHAPTER/LESSON TITLES Chapter 0 Preparing for Precalculus 0-1 Sets There are no state-mandated Precalculus 0-2 Operations

### 17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function

17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):

### 13.4 THE CROSS PRODUCT

710 Chapter Thirteen A FUNDAMENTAL TOOL: VECTORS 62. Use the following steps and the results of Problems 59 60 to show (without trigonometry) that the geometric and algebraic definitions of the dot product

### CS3220 Lecture Notes: QR factorization and orthogonal transformations

CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss

### MATH 304 Linear Algebra Lecture 24: Scalar product.

MATH 304 Linear Algebra Lecture 24: Scalar product. Vectors: geometric approach B A B A A vector is represented by a directed segment. Directed segment is drawn as an arrow. Different arrows represent

### Prentice Hall Mathematics: Algebra 2 2007 Correlated to: Utah Core Curriculum for Math, Intermediate Algebra (Secondary)

Core Standards of the Course Standard 1 Students will acquire number sense and perform operations with real and complex numbers. Objective 1.1 Compute fluently and make reasonable estimates. 1. Simplify

### Topological Data Analysis Applications to Computer Vision

Topological Data Analysis Applications to Computer Vision Vitaliy Kurlin, http://kurlin.org Microsoft Research Cambridge and Durham University, UK Topological Data Analysis quantifies topological structures

### Utah Core Curriculum for Mathematics

Core Curriculum for Mathematics correlated to correlated to 2005 Chapter 1 (pp. 2 57) Variables, Expressions, and Integers Lesson 1.1 (pp. 5 9) Expressions and Variables 2.2.1 Evaluate algebraic expressions

### Such As Statements, Kindergarten Grade 8

Such As Statements, Kindergarten Grade 8 This document contains the such as statements that were included in the review committees final recommendations for revisions to the mathematics Texas Essential

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

### MATHEMATICS CLASS - XII BLUE PRINT - II. (1 Mark) (4 Marks) (6 Marks)

BLUE PRINT - II MATHEMATICS CLASS - XII S.No. Topic VSA SA LA TOTAL ( Mark) (4 Marks) (6 Marks). (a) Relations and Functions 4 () 6 () 0 () (b) Inverse trigonometric Functions. (a) Matrices Determinants

### Math 312 Homework 1 Solutions

Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please

Academic Content Standards Grade Eight and Grade Nine Ohio Algebra 1 2008 Grade Eight STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express

### Chapter 6. Orthogonality

6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

### (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.

Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### Functions and Equations

Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c

### Clustering and Data Mining in R

Clustering and Data Mining in R Workshop Supplement Thomas Girke December 10, 2011 Introduction Data Preprocessing Data Transformations Distance Methods Cluster Linkage Hierarchical Clustering Approaches

### Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches

Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches PhD Thesis by Payam Birjandi Director: Prof. Mihai Datcu Problematic