mirror of
https://github.com/MartinThoma/LaTeX-examples.git
synced 2025-04-26 06:48:04 +02:00
misc
This commit is contained in:
parent
143d1a2f7e
commit
926b53d5a0
3 changed files with 16 additions and 6 deletions
|
@ -1,7 +1,7 @@
|
|||
\section*{Aufgabe 1}
|
||||
\subsection*{Teilaufgabe a)}
|
||||
|
||||
\textbf{Gegeben:}
|
||||
\paragraph{Gegeben:}
|
||||
|
||||
\[A := \begin{pmatrix}
|
||||
4 & 2 & 8\\
|
||||
|
@ -9,9 +9,10 @@
|
|||
8 & 8 & 29
|
||||
\end{pmatrix}\]
|
||||
|
||||
\textbf{Aufgabe:} Cholesky-Zerlegung $A = L \cdot L^T$ berechnen
|
||||
\paragraph{Aufgabe:} Cholesky-Zerlegung $A = \overline{L} \cdot \overline{L}^T$ berechnen
|
||||
|
||||
\textbf{Rechenweg:}
|
||||
\paragraph{Rechenweg:}
|
||||
Entweder mit dem Algorithmus:
|
||||
\begin{algorithm}[H]
|
||||
\begin{algorithmic}
|
||||
\Function{Cholesky}{$A \in \mathbb{R}^{n \times n}$}
|
||||
|
@ -29,9 +30,17 @@
|
|||
\label{alg:seq1}
|
||||
\end{algorithm}
|
||||
|
||||
\textbf{Lösung:}
|
||||
oder über die LR-Zerlegung:
|
||||
\begin{align}
|
||||
A &= L\cdot R\\
|
||||
&= L\cdot(D\cdot L^T)\\
|
||||
&= L\cdot(D^\frac{1}{2} \cdot D^\frac{1}{2})\cdot L^T\\
|
||||
&= \underbrace{(L\cdot D^\frac{1}{2})}_{=: \overline{L}} \cdot (D^\frac{1}{2} \cdot L^T)
|
||||
\end{align}
|
||||
|
||||
\paragraph{Lösung:}
|
||||
$
|
||||
L =
|
||||
\overline{L} =
|
||||
\begin{pmatrix}
|
||||
2 & 0 & 0 \\
|
||||
1 & 2 & 0 \\
|
||||
|
|
|
@ -49,7 +49,8 @@ In diesem Fall bedeutet das konkret:
|
|||
|
||||
Insgesamt ergibt sich also
|
||||
\begin{align}
|
||||
p(x) &= 7 + (x-\underbrace{(-1)}_{x_0}) \cdot (-6) + (x-\underbrace{(-1)}_{x_0}) \cdot (x-\underbrace{(0)}_{x_1}) \cdot 2 + (x+1) \cdot x \cdot (x-1)
|
||||
p(x) &= 7 + (x-\underbrace{(-1)}_{x_0}) \cdot (-6) + (x-\underbrace{(-1)}_{x_0}) \cdot (x-\underbrace{(0)}_{x_1}) \cdot 2 + (x+1) \cdot x \cdot (x-1)\\
|
||||
&= 7 -6 (x+1) + 2x(x+1) + x(x+1)(x-1)
|
||||
\end{align}
|
||||
|
||||
(Siehe erste Spalte mit $x_0$)
|
||||
|
|
Binary file not shown.
Loading…
Add table
Add a link
Reference in a new issue