A) All constant terms are zero B) All coefficients are zero C) The matrix A is invertible D) The number of equations equals the number of variables
A) A column vector with n entries B) The scalar zero C) The zero vector with m entries D) A zero matrix of size m x n
A) n x m B) n x n C) m x m D) m x n
A) A row vector with n entries B) A square matrix of size n x n C) A column vector with m entries D) A column vector with n entries
A) Ax = 0 B) Ax = b C) xA = 0 D) Ax = I
A) n entries B) m + n entries C) m entries D) 1 entry
A) m + n entries B) 1 entry C) m entries D) n entries
A) Rank B) Determinant C) Dimension D) Trace
A) The number of diagonal elements B) The rank of the matrix C) The number of rows D) The number of columns
A) The number of columns B) The number of rows C) The rank of the matrix D) The number of entries in vector x
A) A matrix equation B) A quadratic equation C) A scalar equation D) A differential equation
A) Three B) Four C) One D) Two
A) 15 B) 2 C) 6 D) 3
A) 4 B) 15 C) 9 D) 6
A) 1 B) 6 C) 3/2 D) 15
A) 3/2 B) 3 C) 1 D) 6
A) Graphing B) Substitution C) Matrix inversion D) Cramer's rule
A) Only three variables B) Additional variables C) Zero variables D) Only two variables
A) Linear systems B) Complex number topology C) Differential geometry D) Calculus of variations
A) Engineering, physics, chemistry, computer science, and economics B) In ancient history and literature C) Solely in manual accounting D) Only in theoretical philosophy
A) Only positive integers B) Only irrational numbers C) Only prime numbers D) Real or complex numbers
A) Gröbner basis B) Linearization C) Numerical linear algebra D) Tropical geometry
A) Simplifying polynomials B) Solving equations with complex numbers C) Approximating non-linear equations D) Finding the best integer solutions among many
A) Linear algebra B) Geometry C) Calculus D) Statistics
A) a B) n C) b D) x
A) Polynomials B) Tensors C) Matrices D) Vectors
A) Euclidean space B) Topological manifold C) Abstract algebraic structure D) Metric space
A) The total number of equations B) The unknown index C) The equation index D) The constant index
A) The basis B) The dimension C) The span D) The module
A) Zero vectors B) Linearly dependent vectors C) Linearly independent vectors D) Vectors with only one element
A) Solution set B) Equation set C) Variable set D) Linear set
A) A plane B) A curve C) A point D) A line
A) A point B) A line C) A plane D) A sphere
A) A line B) A hyperplane C) A cube D) A point
A) Underdetermined system B) Inconsistent system C) Overdetermined system D) Unique system
A) Consistent system B) Underdetermined system C) Hyperplane system D) Overdetermined system
A) Infinitely many solutions B) No solution C) A single unique solution D) Two solutions
A) A curve B) A flat C) A point D) A sphere
A) One point B) A line C) A plane D) Empty
A) A unique solution B) An underdetermined system C) No solution D) Infinitely many solutions
A) Independence B) Equivalence C) Linearity D) Summation
A) Consistent B) Inconsistent C) Overdetermined D) Independent
A) Perpendicular lines B) Parallel lines C) Intersecting lines D) Coincident lines
A) Always inconsistent B) Always consistent C) Requires a unique solution D) Sometimes inconsistent
A) Yes, they can. B) Only if the system is inconsistent. C) No, there is only one valid description. D) Only if the system has a finite number of solutions.
A) Back-substitution B) Forward elimination C) Matrix factorization D) Cross-multiplication
A) 5 - 3y + 2z B) 5 - 2z + 3y C) 5 + 2z - 3y D) 5 + 3y - 2z
A) 7 B) 8 C) -15 D) 2
A) 2 B) 5 C) 8 D) -15
A) Vector substitution B) Scalar transformation C) Matrix inversion D) Gaussian elimination
A) A determinant change B) An elementary row operation C) An invalid operation D) A basis change
A) An inconsistent system B) The determinant of the matrix C) The original system D) Reduced row echelon form
A) It requires the use of complex numbers B) Computing large determinants is cumbersome C) It is not theoretically valid for large systems D) It only works for 2x2 matrices
A) It is preferred for floating-point calculations B) It has very poor numerical properties C) It is extremely stable for large systems D) It is perfectly accurate for all data types
A) SVD B) QR decomposition C) Cholesky decomposition D) LU decomposition
A) Pivoting B) Cholesky decomposition C) Jacobi method D) Levinson recursion
A) Gaussian elimination B) Jacobi method C) Levinson recursion D) LU decomposition
A) Quantum algorithms B) Cracovian methods C) Iterative methods D) Direct methods
A) A triangular component T B) A sparse component S C) An identity component I D) A non-diagonal component L + U
A) Identity B) Singular C) Non-singular D) Orthogonal
A) r + u B) ru C) r - u D) u / r
A) Null space B) Column space C) Determinant D) Row space
A) p + v B) p * v C) v / p D) p - v
A) A translation B) A projection C) A rotation D) A reflection |