-
Notifications
You must be signed in to change notification settings - Fork 118
/
pset4.lyx
261 lines (216 loc) · 4.75 KB
/
pset4.lyx
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
#LyX 2.3 created this file. For more info see http://www.lyx.org/
\lyxformat 544
\begin_document
\begin_header
\save_transient_properties true
\origin unavailable
\textclass article
\begin_preamble
\renewcommand{\vec}[1]{\mathbf{#1}}
\renewcommand{\labelenumi}{(\alph{enumi})}
\renewcommand{\labelenumii}{(\roman{enumii})}
\newcommand{\tr}{\operatorname{tr}}
\end_preamble
\use_default_options false
\maintain_unincluded_children false
\language english
\language_package default
\inputencoding auto
\fontencoding global
\font_roman "times" "default"
\font_sans "default" "default"
\font_typewriter "default" "default"
\font_math "auto" "auto"
\font_default_family default
\use_non_tex_fonts false
\font_sc false
\font_osf false
\font_sf_scale 100 100
\font_tt_scale 100 100
\use_microtype false
\use_dash_ligatures true
\graphics default
\default_output_format default
\output_sync 0
\bibtex_command default
\index_command default
\paperfontsize default
\spacing single
\use_hyperref false
\papersize default
\use_geometry true
\use_package amsmath 2
\use_package amssymb 2
\use_package cancel 1
\use_package esint 0
\use_package mathdots 1
\use_package mathtools 1
\use_package mhchem 1
\use_package stackrel 1
\use_package stmaryrd 1
\use_package undertilde 1
\cite_engine basic
\cite_engine_type default
\biblio_style plain
\use_bibtopic false
\use_indices false
\paperorientation portrait
\suppress_date false
\justification true
\use_refstyle 0
\use_minted 0
\index Index
\shortcut idx
\color #008000
\end_index
\topmargin 1in
\secnumdepth 3
\tocdepth 3
\paragraph_separation indent
\paragraph_indentation default
\is_math_indent 0
\math_numbering_side default
\quotes_style english
\dynamic_quotes 0
\papercolumns 2
\papersides 2
\paperpagestyle default
\tracking_changes false
\output_changes false
\html_math_output 0
\html_css_as_file 0
\html_be_strict false
\end_header
\begin_body
\begin_layout Section*
18.335 Problem Set 4
\end_layout
\begin_layout Standard
Due Friday, April 5, 2019.
\end_layout
\begin_layout Subsection*
Problem 1: Almost GMRES
\end_layout
\begin_layout Standard
We use the Arnoldi method to build up an orthogonal basis
\begin_inset Formula $Q_{n}$
\end_inset
for
\begin_inset Formula $\mathcal{K}_{n}$
\end_inset
, with
\begin_inset Formula $AQ_{n}=Q_{n}H_{n}+h_{n+1,n}q_{n+1}e_{n}^{*}=Q_{n+1}\tilde{H}_{n}$
\end_inset
.
GMRES then finds an approximate solution to
\begin_inset Formula $Ax=b$
\end_inset
by minimizing
\begin_inset Formula $\Vert Ax-b\Vert_{2}$
\end_inset
for all
\begin_inset Formula $x\in\mathcal{K}_{n}$
\end_inset
, giving an
\begin_inset Formula $(n+1)\times n$
\end_inset
least-square problem involving the matrix
\begin_inset Formula $\tilde{H}_{n}$
\end_inset
.
\end_layout
\begin_layout Standard
Suppose that we
\series bold
instead
\series default
find an approximate solution to
\begin_inset Formula $Ax=b$
\end_inset
by finding an
\begin_inset Formula $x\in\mathcal{K}_{n}$
\end_inset
where
\begin_inset Formula $b-Ax$
\end_inset
is
\begin_inset Formula $\perp\mathcal{K}_{n}$
\end_inset
.
Derive a small (
\begin_inset Formula $n\times n$
\end_inset
or similar) system of equations that you can solve to find the approximate
solution
\begin_inset Formula $x$
\end_inset
of this method.
\end_layout
\begin_layout Subsection*
Problem 2: Power method
\end_layout
\begin_layout Standard
Suppose
\begin_inset Formula $A$
\end_inset
is a diagonalizable matrix with eigenvectors
\begin_inset Formula $\vec{v}_{k}$
\end_inset
and eigenvalues
\begin_inset Formula $\lambda_{k}$
\end_inset
, in decreasing order
\begin_inset Formula $|\lambda_{1}|\geq|\lambda_{2}|\geq\cdots$
\end_inset
.
Recall that the power method starts with a random
\begin_inset Formula $\vec{x}$
\end_inset
and repeatedly computes
\begin_inset Formula $\vec{x}\gets A\vec{x}/\Vert A\vec{x}\Vert_{2}$
\end_inset
.
\end_layout
\begin_layout Enumerate
Suppose
\begin_inset Formula $|\lambda_{1}|=|\lambda_{2}|>|\lambda_{3}|$
\end_inset
, but
\begin_inset Formula $\lambda_{1}\neq\lambda_{2}$
\end_inset
.
Explain why the power method will not in general converge.
\end_layout
\begin_layout Enumerate
Give a way obtain
\begin_inset Formula $\lambda_{1}$
\end_inset
and
\begin_inset Formula $\lambda_{2}$
\end_inset
and
\begin_inset Formula $\vec{v}_{1}$
\end_inset
and
\begin_inset Formula $\vec{v}_{2}$
\end_inset
from the power method by simply keeping track of the
\emph on
previous
\emph default
iteration's vector in addition to the current iteration.
\end_layout
\begin_layout Subsection*
Problem 3: Shifted-inverse iteration
\end_layout
\begin_layout Standard
Trefethen, problem 27.5.
\end_layout
\begin_layout Subsection*
Problem 4: Arnoldi
\end_layout
\begin_layout Standard
Trefethen, problem 33.2.
\end_layout
\end_body
\end_document