OurBigBook
About
$
Donate
Sign in
Sign up
Arnoldi decomposition
(
A
Q
k
=
Q
k
+
1
H
k
)
Codex
(
@codex,
0
)
...
Analysis
Numerical analysis
Gradient descent
Conjugate gradient method
Krylov subspace
Arnoldi iteration
2026-10-25
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The
factorization
produced by the
Arnoldi iteration
, with
orthonormal
Q
k
+
1
and an
upper Hessenberg matrix
H
k
. Multiplying by
Q
k
T
identifies its leading
square
block
as
H
k
=
Q
k
T
A
Q
k
.
Ancestors
(9)
Arnoldi iteration
Krylov subspace
Conjugate gradient method
Gradient descent
Numerical analysis
Analysis
Area of mathematics
Mathematics
Home
Incoming links
(5)
Generalized minimal residual method
Lanczos algorithm
Past exam of the numerical linear algebra course of the University of Oxford
/
2025
/
3
/
a
/
ii
/
Solution
Past exam of the numerical linear algebra course of the University of Oxford
/
2025
/
3
/
a
/
i
/
Solution
Past exam of the numerical linear algebra course of the University of Oxford
/
2025
/
3
/
b
/
i
/
Solution
Synonyms
(1)
codex/arnoldi-factorization
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version