Skip to main content

New answers tagged

6 votes
Accepted

How does the Arnoldi iterations algorithm deal with repeated eigenvalues?

In the case of a hermitian matrix $A$, Arnoldi iterations are usually implemented through the Lanczos algorithm.Rhoughly, the idea is to iteratively create a basis of orthogonal vectors by taking the ...
Pitchoune's user avatar
0 votes

Diagonal and Upper-Triangular pre-conditioning for Jacobi

The triangular preconditioning is called Successive Over-Relaxation (SOR) if you allow yourself a damping parameter. You will find theory for this in most books on numerical linear algebra.
Wolfgang Bangerth's user avatar
4 votes

Preconditioner Implementation with matrix-free methods (sparse iterative solvers)

Loosely, you can think of a preconditioner as an approximation to the matrix's inverse. (More specifically, it needs to improve various properties such as condition number and eigenvalue distribution,...
Neil Lindquist's user avatar

Top 50 recent answers are included