Question | Answer |

A system is consistent if and only if the row rank of the coefficient matrix equals the row rank of the augmented matrix | |

A^t (switching a matrix's rows and columns) | |

choosing a point in a matrix, turning it into a one, then annihilating entries above and below it | |

When vectors can be written as linear combinations of each other they are | |

When no vector in S is a linear combination of the other vectors | |

A basis that is also an orthonormal set | |

x vector =(x1,x2,...,xn) = Po vector + t times the v vector | |

Vector Sn = T^n times vector So | |

method used to find the determinant and/or inverse of a 3x3 matrix or larger | |

vector u times vector v = u1v1+...+unvn | |

If every vector is a unit vector and the vectors are mutually orthogonal then the vectors are | |

system where all constraints are 0 (when every equation in the system equals 0) | |

when one non-zero vector is a scalar multiple of another, these vectors are: | |

vector v = c1v1+c2v2+...+ckvk for some scalars c1,c2...ck | |

the number of non-zero rows the matrix has after it has been put in ref | |

vector starting at the origin and ending at a point | |

a matrix where all entries are non-negative and every column sums to one | |

the distance between vector u and the projection of vector u onto vector v | |

2-parameter solution = | |

a basic solution to a linear program in which all variables are nonnegative | |

when vector u times vector v = 0, U and v vectors are: | |

A vector space W that is part of a larger vector space V | |

## Show Comments