- Chapter Chapter 1: COMPLEX NUMBERS
- Chapter Chapter 10: APPLICATIONS OF CONFORMAL MAPPING
- Chapter Chapter 11: THE SCHWARZ-CHRISTOFFEL TRANSFORMATION
- Chapter Chapter 12: INTEGRAL FORMULAS OF THE POISSON TYPE
- Chapter Chapter 2: ANALYTIC FUNCTIONS
- Chapter Chapter 3: Elementary Functions
- Chapter Chapter 4: INTEGRALS
- Chapter Chapter 5: SERIES
- Chapter Chapter 6: RESIDUES AND POLES
- Chapter Chapter 7: APPLICATIONS OF RESIDUES
- Chapter Chapter 8: MAPPING BY ELEMENTARY FUNCTIONS
- Chapter Chapter 9: CONFORMAL MAPPING
Complex Variables and Applications 9th Edition - Solutions by Chapter
Full solutions for Complex Variables and Applications | 9th Edition
Adjacency matrix of a graph.
Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected). Adjacency matrix of a graph. Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected).
Big formula for n by n determinants.
Det(A) is a sum of n! terms. For each term: Multiply one entry from each row and column of A: rows in order 1, ... , nand column order given by a permutation P. Each of the n! P 's has a + or - sign.
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.
z = a - ib for any complex number z = a + ib. Then zz = Iz12.
A = S-1 AS. A = eigenvalue matrix and S = eigenvector matrix of A. A must have n independent eigenvectors to make S invertible. All Ak = SA k S-I.
Hilbert matrix hilb(n).
Entries HU = 1/(i + j -1) = Jd X i- 1 xj-1dx. Positive definite but extremely small Amin and large condition number: H is ill-conditioned.
Krylov subspace Kj(A, b).
The subspace spanned by b, Ab, ... , Aj-Ib. Numerical methods approximate A -I b by x j with residual b - Ax j in this subspace. A good basis for K j requires only multiplication by A at each step.
Least squares solution X.
The vector x that minimizes the error lie 112 solves AT Ax = ATb. Then e = b - Ax is orthogonal to all columns of A.
Multiplicities AM and G M.
The algebraic multiplicity A M of A is the number of times A appears as a root of det(A - AI) = O. The geometric multiplicity GM is the number of independent eigenvectors for A (= dimension of the eigenspace).
Normal equation AT Ax = ATb.
Gives the least squares solution to Ax = b if A has full rank n (independent columns). The equation says that (columns of A)·(b - Ax) = o.
If N NT = NT N, then N has orthonormal (complex) eigenvectors.
Saddle point of I(x}, ... ,xn ).
A point where the first derivatives of I are zero and the second derivative matrix (a2 II aXi ax j = Hessian matrix) is indefinite.
Semidefinite matrix A.
(Positive) semidefinite: all x T Ax > 0, all A > 0; A = any RT R.
Similar matrices A and B.
Every B = M-I AM has the same eigenvalues as A.
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.
Special solutions to As = O.
One free variable is Si = 1, other free variables = o.
Standard basis for Rn.
Columns of n by n identity matrix (written i ,j ,k in R3).
Sum V + W of subs paces.
Space of all (v in V) + (w in W). Direct sum: V n W = to}.
Unitary matrix UH = U T = U-I.
Orthonormal columns (complex analog of Q).
Volume of box.
The rows (or the columns) of A generate a box with volume I det(A) I.