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,351
Accepted

How is Krylov-accelerated Multigrid (using MG as a preconditioner) motivated?

In some cases, (F)MG provides an algorithm with optimal properties. For instance, properly tuned FMG can solve some elliptic problems in a small number of "work units", where a work unit is defined to ...
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, ...
• 51.6k
Accepted

• 9,065
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,311
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 ...
• 51.6k
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,189

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 ...
• 861

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,408

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$. ...
• 697
Accepted

Appropriate iterative linear solver for an eigenvalue problem

If your matrices are large, why not use a library like ARPACK? The shift-and-invert mode of ARPACK will help you calculate the eigenvalues close to $\sigma$. There are interfaces to ARPACK for most ...
• 2,116

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: ...
• 9,065
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 ...
• 401
Accepted

Algorithm to calculate the exponential of an Hessenberg matrix

Since expokit seems to use a Krylov subspace method, usually (at least, the hope is that) the upper Hessenberg matrices are of small dimension, say $m \sim 100$. For matrices of these sizes, there ...
• 406

Choosing preconditioner for unsymmetric pressure-velocity coupled system

Both ILU and diagonal scaling are not efficient preconditioners for "real" problems, i.e., if you let the size of your discrete problem become large. In other words, if you insist on timing GPUs vs ...
• 51.6k

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,451

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) ...
• 29.9k

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$; ...
• 861
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,189
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 ...
• 9,065

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,311