Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems

DOI10.1137/22M1537266arXiv2305.17693WikidataQ129749863 ScholiaQ129749863MaRDI QIDQ6180359FDOQ6180359

Carola Kruse, Andrei Dumitrasc, Ulrich Rüde

Publication date: 19 January 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: Deflation techniques are typically used to shift isolated clusters of small eigenvalues in order to obtain a tighter distribution and a smaller condition number. Such changes induce a positive effect in the convergence behavior of Krylov subspace methods, which are among the most popular iterative solvers for large sparse linear systems. We develop a deflation strategy for symmetric saddle point matrices by taking advantage of their underlying block structure. The vectors used for deflation come from an elliptic singular value decomposition relying on the generalized Golub-Kahan bidiagonalization process. The block targeted by deflation is the off-diagonal one since it features a problematic singular value distribution for certain applications. One example is the Stokes flow in elongated channels, where the off-diagonal block has several small, isolated singular values, depending on the length of the channel. Applying deflation to specific parts of the saddle point system is important when using solvers such as CRAIG, which operates on individual blocks rather than the whole system. The theory is developed by extending the existing framework for deflating square matrices before applying a Krylov subspace method like MINRES. Numerical experiments confirm the merits of our strategy and lead to interesting questions about using approximate vectors for deflation.

Full work available at URL: https://arxiv.org/abs/2305.17693

zbMATH Keywords

singular value decompositionStokes equationsaddle point problemsGolub-Kahan bidiagonalizationeigenvalue deflation

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Estimates of eigenvalues in context of PDEs (35P15) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Cites Work

• Title not available (Why is that?)
• Numerical solution of saddle point problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• Minimum residual methods for augmented systems
• On the Sensitivity of Some Spectral Preconditioners
• Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
• Numerical Calculation of Time-Dependent Viscous Incompressible Flow of Fluid with Free Surface
• A Comparison of Deflation and Coarse Grid Correction Applied to Porous Media Flow
• Iterative Krylov Methods for Large Linear Systems
• On the domain geometry dependence of the LBB condition
• Acquired Clustering Properties and Solution of Certain Saddle Point Systems
• The loss of orthogonality in the Gram-Schmidt orthogonalization process
• A framework for deflated and augmented Krylov subspace methods
• An augmented LSQR method
• Numerical Simulation in Fluid Dynamics
• Solution of sparse rectangular systems using LSQR and Craig
• Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
• Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
• Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
• Numerical stability of orthogonalization methods with a non-standard inner product
• Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromodynamics
• Title not available (Why is that?)
• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
• Generalized Golub-Kahan bidiagonalization and stopping criteria
• Recycling Krylov subspaces for efficient large-scale electrical impedance tomography
• Convergence analysis of Krylov subspace methods
• Iterative Solution of Symmetric Quasi-Definite Linear Systems
• Spectral deflation in Krylov solvers: a theory of coordinate space based methods
• Polynomial Based Iteration Methods for Symmetric Linear Systems
• A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity
• GMRES convergence for perturbed coefficient matrices, with application to approximate deflation preconditioning
• Using partial spectral information for block diagonal preconditioning of saddle-point systems
• Textbook Efficiency: Massively Parallel Matrix-Free Multigrid for the Stokes System
• Reaching the superlinear convergence phase of the CG method
• Recycling Krylov Subspaces and Truncating Deflation Subspaces for Solving Sequence of Linear Systems
• A survey of subspace recycling iterative methods
• Inexact inner–outer Golub–Kahan bidiagonalization method: A relaxation strategy

This page was built for publication: Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180359)