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