Skip to main content

Questions tagged [krylov-method]

Referring to Krylov Subspaces and the methods of solutions to linear systems of equations which exploit these spaces.

7 votes
2 answers
487 views

Solving linear systems with a clustered spectrum except for 1 eigenvalue

I have a fairly general question, which I don't think depend a lot on my particular application. Consider a linear system $Ax = b$ that I would like to solve with preconditioned MinRes. Call the ...
FEGirl's user avatar
  • 575
4 votes
0 answers
109 views

Preconditioner for "Generalized stokes" problem

Let $\mu>0$. For the Stokes problem, \begin{align} -\mu \Delta u + \nabla p &= f \\ \nabla \cdot u & = 0 \\ u&= 0 \text{ on } \partial \Omega, \end{align} after discretization (say, ...
vainia's user avatar
  • 191
0 votes
0 answers
88 views

Improving convergence rate of krylov schur iterations?

I am trying to implement krylov schur iterations. I am noticing that although my implementation converges, it does so really, really slowly. For a 40x40 matrix it is taking hundreds of iterations to ...
Makogan's user avatar
  • 473
3 votes
1 answer
240 views

How does the Arnoldi iterations algorithm deal with repeated eigenvalues?

The simplest possible matrix I can think of to use an arnoldi method is the identity matrix. In this case the Krylov sequence is just $\{v, v, v, v, \cdots\}$ for any $v$. Thus the span of the krylov ...
Makogan's user avatar
  • 473
2 votes
0 answers
127 views

Iterative solvers for problems in solid and structural mechanics

I am looking for comprehensive literature (papers, books, reports etc..) on iterative solvers for solid and structural mechanics problems to understand the best iterative solvers and preconditioners ...
Chenna K's user avatar
  • 984
3 votes
0 answers
65 views

Preconditioned GMRES for nearly diagonalizable systems

I have been working with a matrix $A$ and preconditioner $P\approx A^{-1}$ that I've then applied GMRES to the (left) preconditioned linear system \begin{equation} P^{-1}Ax=P^{-1}b \end{equation} $P^{-...
Tucker's user avatar
  • 189
2 votes
0 answers
121 views

Why multigrid is inefficient?

I am trying to solve the Stokes equation containing viscosity nonlinearity using the open source finite element software underworld2 with nested PETSc. The resolution is 2000*200. The solution results ...
Darcy's user avatar
  • 21
4 votes
0 answers
168 views

How is the Alternating Schwarz Method used as a Preconditioner to a Krylov Method?

I am reading "Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations" (Smith 1996), and I am confused as to how the below Alternating Schwarz algorithm ...
Jared's user avatar
  • 269
2 votes
1 answer
226 views

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

I want to run a block Lanczos block-tridiagonalization on a hermitian, sparse matrix (of relatively small size $\sim 10^2 \times 10^2$). However the matrix typically has many eigenvalues that are ...
lm1909's user avatar
  • 21
1 vote
1 answer
243 views

Lanczos memory complexity for dense matrices

Does the Lanczos algorithm remain memory efficient even if the original Hermitian matrix is dense?
user1015426's user avatar
0 votes
0 answers
68 views

Looking for a specific version of the Quasi-Minimal Residual (QMR) method

I'm looking for an alternative formulation of Quasi-Minimal Residual (QMR) from Freund and Nachtigal (1994) based on a Lanczos process for complex valued matrices based on $A^H$ instead of $A^T$. ...
Alexandre Hoffmann's user avatar
1 vote
0 answers
75 views

Does the choice of a complex inner product affect Krylov methods?

As far as I understand there are two definitions of the complex inner product: $$(a,b) = b^H a$$ and $$(a,b) = a^H b$$ I know some linear algebra libraries such as BLAS and Eigen uses the second one. ...
Alexandre Hoffmann's user avatar
1 vote
1 answer
95 views

Reason for why apparent acceleration of algebraic multigrid solve by addition of positive definite diagonal matrix

In passing I was told by someone that $K^{\prime}\in\mathbb{R}^{n\times n}$, will be easier to solve by an algebraic multigrid preconditioned conjugate gradient (CG-AMG) solver than $K$, where $K$ is ...
Tucker's user avatar
  • 189
2 votes
1 answer
251 views

Global convergence behavior of several Krylov solvers in scipy.opt

In the context of mechanical simulation, where I solve the stationary action principle directly (i.e. $\nabla S = 0$ for some scalar function $S$), I use the wrapper ...
G. Fougeron's user avatar
4 votes
0 answers
122 views

Comparing block versus non-block Krylov methods for handling multiple right-hand-sides

Suppose I wish to solve a linear system $AX=B$ iteratively where $A$ is an $m\times m$ matrix and $X,B$ are $m \times s $ matrices (not single vectors). Instead of solving $s$ independent systems I'm ...
Reid.Atcheson's user avatar

15 30 50 per page
1
2 3 4 5 6