1
$\begingroup$

hello.

I am looking for an approximate diagonalization method. I need method which can generate orthogonal transformation to reduce off diagonal elements, but not necessarily make them zero. my option right now is Jacoby, but then looking for other options.

If you know of one, can you direct me to article/resource? thank you

Improve this question
$\endgroup$

2 Answers 2

Reset to default
2
$\begingroup$

You might consider iterative and black-box methods, and particularly Arnoldi.

Improve this answer
$\endgroup$
2
$\begingroup$

You might consider the "QR algorithm": given A, factor A as QR (Q orthogonal and R triangular), then let A' = RQ. Repeat with A' as the new A, ad infinitum.

In a way, though, all implementable diagonalization algorithms are approximate, since it's impossible to diagonalize a general matrix in a finite number of elementary operations.

Improve this answer
$\endgroup$

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.