Eigenvalue perturbation

From Wikipedia, the free encyclopedia

This article may require cleanup to meet Wikipedia's quality standards.
Please improve this article if you can. (May 2007)

This article or section is in need of attention from an expert on the subject.
Please help recruit one or improve this article yourself. See the talk page for details.
Please consider using {{Expert-subject}} to associate this request with a WikiProject

This article does not cite any references or sources. (April 2007)
Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed.

Eigenvalue perturbation is a perturbation approach to solving eigenvalues and eigenvectors of systems perturbed from one with known eigenvectors and eigenvalues. It also allows one to determine the sensitivity of the eigenvalues and eigenvectors with respect to changes in the system.

1 Example
2 Steps
3 Summary
4 Results

[edit] Example

Suppose we have solutions to the generalized eigenvalue problem,

$[K_0] \mathbf{x}_{0i} = \lambda_{0i} [M_0] \mathbf{x}_{0i}. \qquad (1)$

That is, we know $λ 0 i$ and $\mathbf{x}_{0i}$ for $i=1,\dots,N$ . Now suppose we want to change the matrices by a small amount. That is, we want to let

[K] = [K 0] + [δ K]

and

[M] = [M 0] + [δ M]

where all of the $δ$ terms are much smaller than the corresponding term. We expect answers to be of the form

λ i = λ 0 i + δλ 0 i

and

$\mathbf{x}_i = \mathbf{x}_{0i}+\delta\mathbf{x}_{0i}$ .

[edit] Steps

We assume that the matrices are symmetric and positive definite and assume we have scaled the eigenvectors such that

$\mathbf{x}_{0j}^T[M_0]\mathbf{x}_{0i} = \delta_i^j \qquad(2)$

where $\delta_i^j$ is the Kronecker delta. Define $ω i$ as

$\mathbf{x}_{0j}^T[K_0]\mathbf{x}_{0i} = \omega_i^2 \delta_i^j$

Now we want to solve the equation

$[K]\mathbf{x}_i = \lambda_i [M] \mathbf{x}_i$ .

Substituting, we get

$([K_0]+[\delta K])(\mathbf{x}_{0i} + \delta \mathbf{x}_i) = (\lambda_{0i}+\delta\lambda_{i})([M_0]+[\delta M])(\mathbf{x}_{0i}+\delta\mathbf{x}_{0i})$ .

which expands to

$[K_0]\mathbf{x}_{0i}+[\delta K]\mathbf{x}_{0i} + [K_0]\delta \mathbf{x}_i + [\delta K]\delta \mathbf{x}_i$

$= \lambda_{0i}[M_0]\mathbf{x}_{0i}+ \lambda_{0i}[M_0]\delta\mathbf{x}_i + \lambda_{0i}[\delta M]\mathbf{x}_{0i} + \delta\lambda_i[M_0]\mathbf{x}_{0i}$

$+ \lambda_{0i}[\delta M]\delta\mathbf{x}_i + \delta\lambda_i[\delta M]\mathbf{x}_{0i} + \delta\lambda_i[M_0]\delta\mathbf{x}_i + \delta\lambda_i[\delta M]\delta\mathbf{x}_i$ .

Canceling from (1) leaves

$[\delta K]\mathbf{x}_{0i} + [K_0]\delta \mathbf{x}_i + [\delta K]\delta \mathbf{x}_i$

$= \lambda_{0i}[M_0]\delta\mathbf{x}_i + \lambda_{0i}[\delta M]\mathbf{x}_{0i} + \delta\lambda_i[M_0]\mathbf{x}_{0i}$

$+ \lambda_{0i}[\delta M]\delta\mathbf{x}_i + \delta\lambda_i[\delta M]\mathbf{x}_{0i} + \delta\lambda_i[M_0]\delta\mathbf{x}_i + \delta\lambda_i[\delta M]\delta\mathbf{x}_i$ .

Removing the higher-order terms, this simplifies to

$[K_0] \delta\mathbf{x}_i+[\delta K] \mathbf{x}_{0i} = \lambda_{0i}[M_0] \delta \mathbf{x}_i + \lambda_{0i}[\delta M]\mathrm{x}_{0i} + \delta \lambda_i [M_0]\mathbf{x}_{0i}. \qquad(3)$

We note that, when the matrix is symmetric, the unperturbed eigenvectors are orthogonal and so we use them as a basis for the perturbed eigenvectors. That is, we want to construct

$\delta \mathbf{x}_i = \sum_{j=1}^N \epsilon_{ij} \mathbf{x}_{0j} \qquad(4)$

where the $ε i j$ are small constants that are to be determined. Substituting (4) into (3) and rearranging gives

$[K_0]\sum_{j=1}^N \epsilon_{ij} \mathbf{x}_{0j} + [\delta K]\mathbf{x}_{0i} = \lambda_{0i} [M_0] \sum_{j=1}^N \epsilon_{ij} \mathbf{x}_{0j} + \lambda_{0i} [\delta M] \mathbf{x}_{0i} + \delta\lambda_i [M_0] \mathbf{x}_{0i} \qquad (5)$ .

Because the eigenvectors are orthogonal, we can remove the summations by left multiplying by $\mathbf{x}_{0i}$ :

$\mathbf{x}_{0i}^T[K_0] \epsilon_{ii} \mathbf{x}_{0i} + \mathbf{x}_{0i}^T[\delta K]\mathbf{x}_{0i} = \lambda_{0i} \mathbf{x}_{0i}^T[M_0] \epsilon_{ii} \mathbf{x}_{0i} + \lambda_{0i}\mathbf{x}_{0i}^T [\delta M] \mathbf{x}_{0i} + \delta\lambda_i\mathbf{x}_{0i}^T [M_0] \mathbf{x}_{0i} ~~(6)$ .

The two terms containing $ε i i$ are equal because left-multiplying (1) by $\mathbf{x}_{0i}$ gives

$\mathbf{x}_{0i}^T[K_0]\mathbf{x}_{0i} = \lambda_{0i}\mathbf{x}_{0i}^T[M_0]\mathbf{x}_{0i}$ .

Canceling those terms in (6) leaves

$\mathbf{x}_{0i}^T[\delta K]\mathbf{x}_{0i} = \lambda_{0i} \mathbf{x}_{0i}^T[\delta M] \mathbf{x}_{0i} + \delta\lambda_i \mathbf{x}_{0i}^T [M_0] \mathbf{x}_{0i}$ .

Rearranging gives

$\delta\lambda_i = \frac{\mathbf{x}^T_{0i}([\delta K] - \lambda_{0i}[\delta M] )\mathbf{x}_{0i}}{\mathbf{x}_{0i}^T[M_0] \mathbf{x}_{0i}}$

But by (2), this denominator is equal to 1. Thus

$\delta\lambda_i = \mathbf{x}^T_{0i}([\delta K] - \lambda_{0i}[\delta M] )\mathbf{x}_{0i}$ ■

Then

$\epsilon_{ij} = \frac{\mathbf{x}^T_{0i}([\delta K] - \lambda_{0j}[\delta M])\mathbf{x}_{0j}}{\lambda_{0j}-\lambda_{0i}}, \qquad i\neq j$ .

To find $ε i i$ , use

$\mathbf{x}^T_i[M]\mathbf{x}_i = 1 \Rightarrow \epsilon_{ii}=-\frac{1}{2}\mathbf{x}^T_{0i}[\delta M]\mathbf{x}_{0i}$ .

[edit] Summary

$\lambda_i = \lambda_{0i} + \mathbf{x}^T_{0i} ([\delta K] - \lambda_{0i}[\delta M]) \mathbf{x}_{0i}$

and

$\mathbf{x}_i = \mathbf{x}_{0i}(1 - \frac{1}{2} \mathbf{x}^T_{0i}[\delta M] \mathbf{x}_{0i}) + \sum_{j=1\atop j\neq i}^N \frac{\mathbf{x}^T_{0j}([\delta K] - \lambda_{0i}[\delta M])\mathbf{x}_{0i}}{\lambda_{0i}-\lambda_{0j}}\mathbf{x}_{0j}$

[edit] Results

This means it is possible to efficiently do a sensitivity analysis on $λ i$ as a function of changes in the entries of the matrices. (Recall that the matrices are symmetric and so changing $K_{(k\ell)}$ will also change $K_{(\ell k)}$ , hence the $(2-\delta_k^\ell)$ term.)

$\frac{\partial \lambda_i}{\partial K_{(k\ell)}} = \frac{\partial}{\partial K_{(k\ell)}}\left(\lambda_{0i} + \mathbf{x}^T_{0i} ([\delta K] - \lambda_{0i}[\delta M]) \mathbf{x}_{0i}\right) = x_{0i(k)} x_{0i(\ell)} (2-\delta_k^\ell)$

and

$\frac{\partial \lambda_i}{\partial M_{(k\ell)}} = \frac{\partial}{\partial M_{(k\ell)}}\left(\lambda_{0i} + \mathbf{x}^T_{0i} ([\delta K] - \lambda_{0i}[\delta M]) \mathbf{x}_{0i}\right) = \lambda_i x_{0i(k)} x_{0i(\ell)}(2-\delta_k^\ell)$ .

Similarly

$\frac{\partial\mathbf{x}_i}{\partial K_{(k\ell)}} = \sum_{j=1\atop j\neq i}^N \frac{x_{0j(k)} x_{0i(\ell)}(2-\delta_k^\ell)}{\lambda_{0i}-\lambda_{0j}}\mathbf{x}_{0j}$

and

$\frac{\partial \mathbf{x}_i}{\partial M_{(k\ell)}} = -\mathbf{x}_{0i}\frac{x_{0i(k)}x_{0i(\ell)}}{2}(2-\delta_k^\ell) - \sum_{j=1\atop j\neq i}^N \frac{\lambda_{0i}x_{0j(k)} x_{0i(\ell)}}{\lambda_{0i}-\lambda_{0j}}\mathbf{x}_{0j}(2-\delta_k^\ell)$ .

Categories: Perturbation theory

Eigenvalue perturbation

From Wikipedia, the free encyclopedia

Contents

[edit] Example

[edit] Steps

[edit] Summary

[edit] Results

Views

Navigation

Interaction

Search