Questions tagged [preconditioning]
For questions regarding design and implementation of preconditioners for solving linear systems.
120
questions
1
vote
0
answers
45
views
Interpreting iterative smoothers and solvers as krylov preconditioners
Various literature and library implementations like petsc use preconditioners based on simple smoothers that themselves could be used the solve the systems directly. e.g. say I have a function
...
- 2,345
1
vote
0
answers
46
views
What is the current state of preconditioning highly heterogeneous equations? Where do I start?
Consider the simple standard Laplacian in 2D or 3D:
$$\nabla (\alpha \nabla u) =f $$
with $\alpha$ being a scalar. $\alpha$ can take values that can vary largely between 1e-8 and 1 throughout the ...
- 395
6
votes
1
answer
229
views
Creating a preconditioner for conjugate gradient with a known approximate solution
I am working on solving Poisson's eq. $\Delta u = -f$ using conjugate gradient method. I am using scipy's linalg.cg function. In this problem, the source function $f$ changes slightly in each ...
- 61
2
votes
1
answer
171
views
Solution of linear system doesn't work, in parallel
I'm solving $Ax = b$ with PETSc, $A$ sparse and asymmetric.
I'm using BCGS or FGMRES or TFQMR as a solver, and ILU as a preconditioner.
When I use 1 core, everything works as expected. But with 8 ...
- 243
0
votes
1
answer
57
views
How to combine multigrid preconditioner with jacobi preconditioner?
I have not found any relevant information in the literature on the following rather simple problem:
How to combine (geometric) multigrid preconditioned conjugate gradient (MGPCG) with an additional ...
- 1
1
vote
0
answers
68
views
Implementations of the Eisenstat-trick for SSOR
Where can I find a source code for the SSOR method with Eisenstat's trick?
The original paper includes pseudo code but also seems to have minor typos. For that reason, I would be very happy to see an ...
- 3,590
4
votes
0
answers
76
views
Can you left-precondition least squares?
Suppose I want to solve an overdetermined linear least squares problem
$$
x = \operatorname*{argmin}_{x\in\mathbb{R}^n} \| Ax - b\|^2
$$
where $A \in \mathbb{R}^{m\times n}$ has full column rank. I ...
- 350
1
vote
1
answer
72
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 ...
- 157
3
votes
3
answers
131
views
How to find the optimal SSOR parameter
The symmetric successive overrelaxation method features the iteration matrix
$$P=\left(\frac{D}{\omega}+L\right)\frac{\omega}{2-\omega}D^{-1}\left(\frac{D}{\omega}+U\right)$$
Either as a stationary ...
- 3,590
11
votes
2
answers
302
views
What makes a good preconditioner when only a few approximate iterations are needed?
For deterministic solver of $Xw=y$, one recommendation is to pick $P$ such that $P^{-1}X$ has a low condition number. However, this condition only really matters when you want to reduce initial error ...
- 2,049
3
votes
2
answers
840
views
Why does this preconditioner effectively reduce the condition number of a random SPD matrix?
Consider some randomly generated matrix $B\in\mathbb{R}^{100\times100}$ and let $A:=BB^{\top}$
On MATLAB I computed the condition number of $A$, I obtained a value of $2.8377\mathrm{e}+04$
However if ...
- 133
3
votes
0
answers
33
views
Reference for preconditioning nonlinear conjugate gradient with LU decomposition of jacobian
When solving non-linear systems of equations, @Arnold Neumaier suggested in How can I precondition a non-linear problem before linearization? to use an approximate LU decomposition of an approximate ...
- 31
0
votes
2
answers
128
views
Where can I find matrices and it's preconditioner for testing?
I want to find some kinds of matrices for testing my code such as GMRES , MINRES and so on. But I can't find some testing matrices and corresponding preconditioner to verify my program.
I know some ...
- 3
1
vote
0
answers
52
views
Hessian-free preconditioner for non linear least squares
I am solving a nonlinear least squares problem using Gauss Newton method. Due to the large dimension of the problem, I use the Hessian-free approach. As a linear solver I use either MINRES or CG. To ...
2
votes
1
answer
77
views
ICCG negative residual products $r^TM^{-1}r$
I have a linear system $Ax=b$ resulting from a finite element discretization of the Poisson equation. I am applying an IC0 (incomplete Cholesky ($LDL^T$) with the same sparsity as the original matrix) ...
- 971
3
votes
1
answer
399
views
Incomplete Cholesky preconditioner for CG efficiency
I am currently solving the harmonic equation using a P1 FEM discretisation. The resulting matrix $A$ is SPD and fairly sparse so I use a preconditioned conjugate gradients (CG) solver to find a ...
- 971
3
votes
1
answer
511
views
When do not use preconditioners for sparse linear system of equations?
I'm implementing a solver of Finite Element Method, and to solve the linear system of equations I'm using gmres from MKL of Intel. Exists the option with and without a preconditioning. In what case it ...
- 515
1
vote
1
answer
149
views
What is the difference between Adittive Schwarz as a preprocessor and a solver?
As we all know, the Additive Schwarz approach can be used as either solver or preconditioner, however, my question is, what is the difference between the two? In other words, how to use AS as solver, ...
- 13
3
votes
1
answer
199
views
Preconditioning a least-squares problem?
I need to solve an equation system
$$
\begin{pmatrix}
A \\
I
\end{pmatrix}
x
=
\begin{pmatrix}
b_0\\b_1
\end{pmatrix}
$$
in the least-squares sense. Let's assume $I$ is the $n$-by-$n$ identity matrix, ...
- 3,108
2
votes
0
answers
133
views
Confusion about preconditioner for incompressible Navier-Stokes equation with implicit-explicit method
Consider the time-dependent Navier-Stokes equation
$$u_t + (u \cdot \nabla) u - \Delta u + \nabla p = f$$
$$\operatorname{div}(u)=0$$
Looking at deal.ii tutorials, I've notice that there are ...
- 299
1
vote
3
answers
176
views
preconditioner for Laplace "without" boundary values
I'm looking at solving systems with the FEM discretization
$$
-\int_\Omega (\Delta u) v = \int_\Omega \nabla u \cdot \nabla v - \int_\Gamma (n\cdot\nabla u) v.
$$
without applying Dirichlet- or ...
- 3,108
3
votes
1
answer
320
views
Preconditioning vs. regularization
I used to be more of a numerical linear algebra and computational science person, but recently, I've crossed into stats and machine learning.
For this discussion, let's focus on matrices that are not ...
- 281
3
votes
0
answers
136
views
What is this QR-factorization-based preconditioning called?
I have recently started to delve into someone else's code, and there is a part in there I don't quite understand. The authors of the code use some form of pre-conditioning to speed up the optimization....
- 203
-1
votes
1
answer
43
views
Automatic selection of the SLE solver and preconditioner during simulation
To simulate the physical process necessary to solve the arising systems of linear algebraic equations. The SLE matrix has a highly sparse form. There are a couple dozen non-zero elements in the string,...
2
votes
0
answers
47
views
"black box" preconditioner for shifted linear systems?
Does anyone know of any strategies for creating a preconditioner $P^{-1}_\sigma \approx (A+\sigma I)^{-1}$ given a preconditioner $P^{-1} \approx A^{-1}$, preferably such that the precomputation doesn'...
- 233
1
vote
1
answer
92
views
preconditioner for $u''(x)=\sin(x)$
I am interested in finding preconditioner to solve the problem for one dimensional problem $u''(x)=\sin(x), u(0)=u(1)=0$ using Dirichlet-Neumann method.
The preconditioner $M$ coming from Dirichlet-...
- 41
1
vote
0
answers
147
views
Upper bound on condition number in linear preconditioning
I'm studying iterative methods for solving linear system, and I find the following setting in Wikipedia:
Consider a matrix splitting $A = M-N$, where $A,M,N$ are all symmetric and positive definite ...
- 11
2
votes
0
answers
73
views
Does incomplete LU preconditioning improve the asymptotic scaling of Krylov subspace methods?
It is well known that unpreconditioned Krylov subspace methods applied to the finite-difference-discretised Poisson equation with $n$ grid points per direction require $O(n \, |\log(\varepsilon)|)$ ...
- 425
0
votes
0
answers
94
views
Preconditioning the $[1 \quad-2 \quad 1]$ Finite Difference matrix
Let $A$ be the well known tridiagonal matrix coming from the 1D Finite difference discretization of the Laplacian, with stencil $\frac{[1 \quad-2 \quad 1]}{h^2}$.
The system $Ax = b$ is very large, so ...
- 299
5
votes
1
answer
322
views
Non-negative least squares with very small numbers
(I have asked this question on StackOverflow previously but it has been pointed to me that CSSE or MSE could be more appropriate)
I have to solve a constrained optimization problem of the following ...
- 51
0
votes
1
answer
171
views
Library to solve dense linear system with GMRES
I have a fortran 90 code and I want to solve a dense linear system with GMRES. I would prefer the restarted GMRES with preconditioning. Is there some library that you know of that I could use? Now I ...
- 43
3
votes
0
answers
160
views
Solving saddle point problem having non-invertible top-left block with a PETSc nested matrix
My system is a symmetric FE problem with lagrange multipliers:
$Z=\begin{pmatrix}A & C^T \\ C & 0\end{pmatrix}$
The matrix $A$ is positive semi-definite, non-invertible. The whole matrix is ...
- 151
3
votes
1
answer
102
views
Are there any other better methods than block diagnoal and block upper triangular precondtioner for saddle point problems?
For stokes problems,
$$
-\Delta \vec{u} + \nabla p =\vec{f},\qquad \nabla . \vec{u} = 0;
$$
with appropriate boundary conditions which guarantee there is a unique solution.
Using FDM or FEM, ...
- 961
1
vote
1
answer
64
views
Accelerating Conjugate Gradients fitting for small localized kernel (like cubic B-spline)
Question:
Is there some pre-conditioner for Conjugate-Gradient (CG) cheap enough, that it is worth using even if my operator is very local (i.e. already has a low number of non-zero elements), as it ...
- 907
2
votes
1
answer
256
views
Why do many people use FDM method to solve Stokes equations, i.e., saddle point matrix?
For numerical methods of the Stokes equations, with appropriate boundary:
$$-\nabla^{2} \vec{u}+\nabla p=\overrightarrow{0}$$
$$\nabla \cdot \vec{u}=0$$
one may use FDM (finite difference method) ...
- 961
3
votes
2
answers
614
views
Why iterative method: AMG preconditioned PCG is slower than Matlab direct method 'A\b'?
Recently, I have met a question that
a saying goes that for large linear system: iterative methods are required because of memory problem of direct methods.
But when I implement some experiments ...
- 961
6
votes
1
answer
353
views
Iterative linear solver for "ugly" saddle point system
I am a graduate student majoring scientific computing. The numeric model I made caused a very ugly-looking saddle-point linear system. It is not symmetric at all and I will attach the sparsity pattern ...
1
vote
1
answer
198
views
Iterative solution of ill-conditioned matrix systems
I want to solve a matrix system of the form $Ax=b$ where $A$ is ill-conditioned. The matrix system comes from a structural simulation problem which was discretized using finite elements. I do not have ...
- 840
8
votes
0
answers
178
views
Why not use the preconditioned residual as termination criterion for preconditioned CG?
I have a Poisson equation with wildly varying material parameters (1 .. 1000), wildly varying element sizes (5 nm .. 100 um) and some quite anisotropic (tetrahedral) elements (100 nm x 100 um). I use (...
- 2,141
4
votes
1
answer
354
views
Optimality of block-Jacobi preconditioner
For a dense $N \times N$ matrix $A$, is the block-Jacobi preconditioner comprising the inverse of the diagonal blocks of $A$ the optimal block-diagonal preconditioner? Could there exist another matrix ...
- 663
1
vote
0
answers
75
views
Kinetic preconditioning
Publication arXiv:0804.2583 describes a method for doing self-consistent iteration without having to diagonalize the Hamiltonian operator at every step.
IX. PRECONDITIONING
As already mentioned, ...
- 331
8
votes
0
answers
106
views
How to construct an effective preconditioner for this particular problem
A quick introduction to my problem
I am currently developing a method for simulation of water waves in three dimensions based on potential flow theory. The computational bottleneck of the method is ...
- 115
3
votes
1
answer
448
views
Re-using LU factorization within iterative (?) setup for a sum of two matrices
So, I would love to make at least some use of my preexisting data, no matter how small, and just out of ideas. Maybe I am just a prisoner of a Kahneman-like theatre-ticket paradox, and don't know ...
- 8,592
0
votes
1
answer
186
views
PCJACOBI works but the default PCBJACOBI failed in PETSc
I am using PETSc and libmesh to solve a simple linear elastic problem with quite complicated geometry, using linear tetrahedral elements. I am always using the KSP CG as the solver.
I noticed that ...
- 163
1
vote
1
answer
152
views
Simplest way to precondition Uzawa iteration
I have a diffusion problem with an internal circular dirichlet constraint and a side condition which shall enforce a certain global volume integral.
$\nabla(D \nabla u(x)) = 0$
outer boundary ...
- 2,621
2
votes
1
answer
77
views
Right-preconditioning and fixed point linear iterations
Given a linear system $A\textbf{x}=\textbf{b}$, we can express it into the easier-to-solve right-preconditioned form:
$$ AM^{-1}\textbf{y}=\textbf{b}, \quad \textbf{y}= M\textbf{x} $$
On the other ...
3
votes
0
answers
88
views
Numerical analysis, pivoting and incomplete LU decomposition
When doing LU decomposition, the algorithm will break down if any of the diagonal element $x_{ii}$ is zero. Therefore, we can use pivoting on the matrix such that $x_{ii}$ is no longer zero. That is ...
- 31
3
votes
1
answer
545
views
Multigrid preconditioner for conjugate gradient methods
When solving $A*x=b$ using preconditioned conjugate gradient methods one has to solve $z=K^{-1}*r$ for the preconditioning where $K$ is the preconditioner of $A$ and $r$ is the residual vector.
...
- 840
-4
votes
1
answer
175
views
what is Sherman-Morrison formula
Can someone please explain what is the Sherman-Morrison formula and it's specialities when it comes to matrix calculations? I'm a little bit confused on understanding how the preconditioning works ...
3
votes
0
answers
88
views
Element Preconditioner
Im just working on a preconditioner for the linear equation system $Ax = b$ arising in FEM for elliptic PDE. $A$ is a s.p.d Matrix with real valued entries. I read something about the element by ...
user29088