LA: 2.1-2.3 Terms

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/16

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

17 Terms

1
New cards

diagonal entries

entries with equal row and column index #s

2
New cards

main diagonal

The entries with equal row and column index #s.

3
New cards

diagonal matrix

A square matrix whose nondiagonal entries are all zero

4
New cards

zero matrix

a matrix in which every element is zero

5
New cards

matrices are equal

if the sizes are equal and corresponding entries are equal

6
New cards

sum A + B

the m x n matrix whose columns are the sums of the corresponding columns in A and B

7
New cards

scalar multiple of a vector

r is a scalar and A is a matrix whose columns are r times the corresponding columns in A

8
New cards

If A is an m x n matrix and if B is an n x p matrix with columns b_1, ... , b_p, then the product AB is

the m x p matrix whose columns are Ab_1 , ... , Ab_p

AB = A[b_1 b_2 ... b_p] = [Ab_1 Ab_2 ... Ab_p]

9
New cards

A and B commute

if AB = BA

10
New cards

transpose of A

Given an m x n matrix, it's the n x m matrix, denoted by A^T, whose columns are formed from the corresponding rows of A

11
New cards

invertible

An n x n matrix A if there's an n x n matrix C s. t. CA = I and AC = I where I = I_n, the n x n identity matrix

12
New cards

inverse matrix

the matrix when multiplied by the original matrix results in the identity matrix

AA^(-1) = (A^(-1))(A) = I_n

13
New cards

singular matrix

a matrix that is not invertible

14
New cards

nonsingular matrix

a matrix that's invertible

15
New cards

determinant of A

detA = ad - bc

16
New cards

elementary matrix

a matrix obtained by performing a single elementary row operation on an identity matrix

17
New cards

invertible linear transformation

A linear transformation T : R^n -> R^n is said to be invertible if there exists a function S : R^n -> R^n such that

S(T(x)) = x for all x in R^n

T(S(x)) = x for all x in R^n