×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

Solutions for Chapter 13.3: Trigonometric Functions of General Angles

California Algebra 2: Concepts, Skills, and Problem Solving | 1st Edition | ISBN: 9780078778568 | Authors: Berchie Holliday

Full solutions for California Algebra 2: Concepts, Skills, and Problem Solving | 1st Edition

ISBN: 9780078778568

California Algebra 2: Concepts, Skills, and Problem Solving | 1st Edition | ISBN: 9780078778568 | Authors: Berchie Holliday

Solutions for Chapter 13.3: Trigonometric Functions of General Angles

Solutions for Chapter 13.3
4 5 0 315 Reviews
21
5
Textbook: California Algebra 2: Concepts, Skills, and Problem Solving
Edition: 1
Author: Berchie Holliday
ISBN: 9780078778568

Chapter 13.3: Trigonometric Functions of General Angles includes 65 full step-by-step solutions. This textbook survival guide was created for the textbook: California Algebra 2: Concepts, Skills, and Problem Solving, edition: 1. Since 65 problems in chapter 13.3: Trigonometric Functions of General Angles have been answered, more than 44291 students have viewed full step-by-step solutions from this chapter. California Algebra 2: Concepts, Skills, and Problem Solving was written by and is associated to the ISBN: 9780078778568. This expansive textbook survival guide covers the following chapters and their solutions.

Key Math Terms and definitions covered in this textbook
  • Back substitution.

    Upper triangular systems are solved in reverse order Xn to Xl.

  • Block matrix.

    A matrix can be partitioned into matrix blocks, by cuts between rows and/or between columns. Block multiplication ofAB is allowed if the block shapes permit.

  • Cofactor Cij.

    Remove row i and column j; multiply the determinant by (-I)i + j •

  • Conjugate Gradient Method.

    A sequence of steps (end of Chapter 9) to solve positive definite Ax = b by minimizing !x T Ax - x Tb over growing Krylov subspaces.

  • Dimension of vector space

    dim(V) = number of vectors in any basis for V.

  • Elimination.

    A sequence of row operations that reduces A to an upper triangular U or to the reduced form R = rref(A). Then A = LU with multipliers eO in L, or P A = L U with row exchanges in P, or E A = R with an invertible E.

  • Four Fundamental Subspaces C (A), N (A), C (AT), N (AT).

    Use AT for complex A.

  • Fundamental Theorem.

    The nullspace N (A) and row space C (AT) are orthogonal complements in Rn(perpendicular from Ax = 0 with dimensions rand n - r). Applied to AT, the column space C(A) is the orthogonal complement of N(AT) in Rm.

  • Hermitian matrix A H = AT = A.

    Complex analog a j i = aU of a symmetric matrix.

  • Inverse matrix A-I.

    Square matrix with A-I A = I and AA-l = I. No inverse if det A = 0 and rank(A) < n and Ax = 0 for a nonzero vector x. The inverses of AB and AT are B-1 A-I and (A-I)T. Cofactor formula (A-l)ij = Cji! detA.

  • lA-II = l/lAI and IATI = IAI.

    The big formula for det(A) has a sum of n! terms, the cofactor formula uses determinants of size n - 1, volume of box = I det( A) I.

  • Pascal matrix

    Ps = pascal(n) = the symmetric matrix with binomial entries (i1~;2). Ps = PL Pu all contain Pascal's triangle with det = 1 (see Pascal in the index).

  • Reduced row echelon form R = rref(A).

    Pivots = 1; zeros above and below pivots; the r nonzero rows of R give a basis for the row space of A.

  • Row picture of Ax = b.

    Each equation gives a plane in Rn; the planes intersect at x.

  • Schur complement S, D - C A -} B.

    Appears in block elimination on [~ g ].

  • Simplex method for linear programming.

    The minimum cost vector x * is found by moving from comer to lower cost comer along the edges of the feasible set (where the constraints Ax = b and x > 0 are satisfied). Minimum cost at a comer!

  • Singular Value Decomposition

    (SVD) A = U:E VT = (orthogonal) ( diag)( orthogonal) First r columns of U and V are orthonormal bases of C (A) and C (AT), AVi = O'iUi with singular value O'i > O. Last columns are orthonormal bases of nullspaces.

  • Standard basis for Rn.

    Columns of n by n identity matrix (written i ,j ,k in R3).

  • Stiffness matrix

    If x gives the movements of the nodes, K x gives the internal forces. K = ATe A where C has spring constants from Hooke's Law and Ax = stretching.

  • Transpose matrix AT.

    Entries AL = Ajj. AT is n by In, AT A is square, symmetric, positive semidefinite. The transposes of AB and A-I are BT AT and (AT)-I.

×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
×
Reset your password