Sylvester-based preconditioning for the waveguide eigenvalue problem

DOI10.1016/j.laa.2017.06.027zbMath1418.65050arXiv1610.06784OpenAlexW2541440312MaRDI QIDQ2002792

Elias Jarlebring, Johan Karlsson, Giampaolo Mele, Emil Ringh

Publication date: 12 July 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

preconditioningiterative methodsnonlinear eigenvalue problemsmatrix equationsgeneralized Sylvester equationsPDE-eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonlinear eigenvalue problems and nonlinear spectral theory for PDEs (35P30) Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items

Solving Rank-Structured Sylvester and Lyapunov Equations ⋮ Greedy low-rank algorithm for spatial connectome regression ⋮ Numerical solution of a class of quasi-linear matrix equations ⋮ Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations ⋮ On the convergence of Krylov methods with low-rank truncations ⋮ Residual-based iterations for the generalized Lyapunov equation

Uses Software

• NLEVP
• NLEIGS
• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-rank solvers for fractional differential equations
• Matrix-equation-based strategies for convection-diffusion equations
• An integral method for solving nonlinear eigenvalue problems
• A linear eigenvalue algorithm for the nonlinear eigenvalue problem
• Analyzing the convergence factor of residual inverse iteration
• A block Newton method for nonlinear eigenvalue problems
• An Arnoldi method for nonlinear eigenvalue problems
• Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
• Floquet multipliers of periodic waveguides via Dirichlet-to-Neumann maps
• A numerical method for nonlinear eigenvalue problems using contour integrals
• Sherman–Morrison–Woodbury formula for Sylvester andT-Sylvester equations with applications
• An Efficient Reduced Basis Solver for Stochastic Galerkin Matrix Equations
• Recycling BiCG with an Application to Model Reduction
• Computational Methods for Linear Matrix Equations
• NLEVP
• Recycling BiCGSTAB with an Application to Parametric Model Order Reduction
• A Low-Rank in Time Approach to PDE-Constrained Optimization
• An Introduction to Domain Decomposition Methods
• Backward Error of Polynomial Eigenproblems Solved by Linearization
• Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations
• Recycling Krylov Subspaces for Sequences of Linear Systems
• Residual Inverse Iteration for the Nonlinear Eigenvalue Problem
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
• Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
• A Rational Krylov Method Based on Hermite Interpolation for Nonlinear Eigenvalue Problems
• NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
• Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
• The Waveguide Eigenvalue Problem and the Tensor Infinite Arnoldi Method
• Efficient Computation of the Solutions to Modified Lyapunov Equations
• A Dirichlet-to-Neumann Approach for The Exact Computation of Guided Modes in Photonic Crystal Waveguides
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Algorithms for the Nonlinear Eigenvalue Problem