# Tag Info

Accepted

### What are the major differences between GMRES and FOM?

There is one major difference between GMRES over FOM. It is also the reason why I would recommend GMRES over FOM. In exact arithmetic, the residuals obtained by GMRES form a decreasing sequence. You ...
• 1,391
Accepted

### role of initial guess for iterative linear solver

Practical experience shows that trying to get good initial iterates has little value. For example, in the context of solving partial differential equations, if you take the solution from one mesh, ...
• 55.5k
Accepted

• 11.4k
Accepted

### How to implement flexible gmres in matlab?

First of all, MATLAB's gmres assumes that the preconditioner you use is linear. This is important! Actually it is the main difference between FGMRES and GMRES. ...
• 2,656
Accepted

### Does LAPACK offer routines for Krylov sub-space based solvers and nonlinear solvers?

As far as I know, there are no such methods in LAPACK. Since LAPACK is the linear algebra package, no nonlinear solvers are included. However, you can use the underlying BLAS for implementing ...
• 451
Accepted

### Why minimizing with respect to A-norm?

In some sense it doesn't matter: In finite dimensions, all norms are equivalent, so if an algorithm conveniently has the property that proving convergence in one norm is easy, then that's what people ...
• 55.5k

### For which problems Krylov subspace methods are preferred over multigrid methods?

This question is pretty well discussed in literature. However, there are lots of questions concerning multigrid on SciComp, so I decided to compose more or less detailed answer. I. When multigrid ...
• 901

### Why does conjugate gradient work with this nonsymmetric preconditioner?

In short, orthogonalization of the Krylov vectors occurs with respect to the operator, but not with respect to the preconditioner. Alright, so say we want to solve $Ax=b$ with preconditioner $B$. ...
• 767

### role of initial guess for iterative linear solver

It can be even harmful. In Liesen/Strakos Krylov subspace methods principles and analysis (Chapter 5.8.3) it is reported that a nonzero initial x0 makes a GMRes ...
• 3,418

### How GMRES method finds smallest singular value and the corresponding singular vectors of a matrix?

How GMRES method finds smallest singular value and the corresponding singular vectors of a matrix? It doesn't. GMRES solves linear systems. Your citation probably refers to other Krylov methods: ...
• 11.4k
Accepted

### What's wrong with the **PCG and MINRES** in matlab?

While very similar, each method is slightly different and you should definitely take this into account. The GMRES method is the simplest, it will construct an orthogonal basis for $\mathcal{K}_k(A,b)$...
• 1,693

### Ways to fix block Lanczos tridiagonalisation numerical instability for matrix with degenerate, closely spaced eigenvalues?

I'll expand into a full answer to get more space. The algorithms from LAPACK can provide both the eigenvectors and the eigenvalues. On symmetric/hermitian systems, like those for which Lanczos is ...
• 4,862
Accepted

### How to understand the storage of the Hessenberg matrix of Krylov subspace matrix?

Your view is correct, Matlab does store the zeros. As pointed out by @rchilton1980, this particular non-optimization that you are pointing out here is not too harmful, since the bulk of the storage in ...
• 11.4k
Accepted

### How to understand the choice of Krylov subspace orthonormal basis?

I doubt I can explain this better than the author, but I'll give it a shot. Let's say that $r_0 = \sum \alpha_i x_i$, with $x_i$ an eigenvector with eigenvalue $\lambda_i$. We can then write the ...
• 1,693

In order to understand these results, you need to know how minimization and projection problems are connected. Namely, Let $\mathbb V$ be a subspace of $\mathbb C^n$ and take $y \in \mathbb C^n$; ...
• 901

### role of initial guess for iterative linear solver

This answer is an addition to the one from Wolfgang Bangerth. It is certainly not worth to bother with the initial guess for the iterative linear solver if there is any work to be done: coding, ...
• 8,672

### PetSc vs Sundials for serial numerical computations?

As mentioned in Geoff Oxberry's more complete answer, it should be noted that PETSc includes TSSUNDIALS, an interface to SUNDIALS. If you configure PETSc with the ...

### PetSc vs Sundials for serial numerical computations?

In general, you can do more with PETSc. SUNDIALS is a collection of ODE solvers (in CVODE, Adams-Bashforth and BDF methods; in ARKODE, ARKIMEX methods) and DAE solvers (IDAS implements a BDF method) ...
• 30.4k

### CG without division by 0 in a solution

Either of $p_k$ or $r_k$ being zero implies exact convergence in exact arithmetic, so that is never a problem. Conjugate gradient was used as a direct solver for linear systems of equations much ...
• 2,656

### Does LAPACK offer routines for Krylov sub-space based solvers and nonlinear solvers?

LAPACK doesn't include any iterative solvers. The routines in LAPACK are for eigenvalues, matrix factorizations, and solutions of systems of equations involving dense matrices while iterative methods ...
• 18.7k

• 211