Sylvester-based preconditioning for the waveguide eigenvalue problem
From MaRDI portal
Abstract: We consider a nonlinear eigenvalue problem (NEP) arising from absorbing boundary conditions in the study of a partial differential equation (PDE) describing a waveguide. We propose a new computational approach for this large scale NEP based on residual inverse iteration (Resinv) with preconditioned iterative solves. Similar to many preconditioned iterative methods for discretized PDEs, this approach requires the construction of an accurate and efficient preconditioner. For the waveguide eigenvalue problem, the associated linear system can be formulated as a generalized Sylvester equation. The equation is approximated by a low-rank correction of a Sylvester equation, which we use as a preconditioner. The action of the preconditioner is efficiently computed using the matrix equation version of the Sherman-Morrison-Woodbury (SMW) formula. We show how the preconditioner can be integrated into Resinv. The results are illustrated by applying the method to large-scale problems.
Recommendations
- The waveguide eigenvalue problem and the tensor infinite Arnoldi method
- Approximate inverse preconditioner by computing approximate solution of Sylvester equation
- A preconditioned block Arnoldi method for large Sylvester matrix equations
- Preconditioned Galerkin and minimal residual methods for solving Sylvester equations
- Preconditioned iterative methods for a class of nonlinear eigenvalue problems
Cites work
- A block Newton method for nonlinear eigenvalue problems
- A Dirichlet-to-Neumann approach for the exact computation of guided modes in photonic crystal waveguides
- A linear eigenvalue algorithm for the nonlinear eigenvalue problem
- A low-rank in time approach to PDE-constrained optimization
- A numerical method for nonlinear eigenvalue problems using contour integrals
- A rational Krylov method based on Hermite interpolation for nonlinear eigenvalue problems
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Algorithms for the Nonlinear Eigenvalue Problem
- An Arnoldi method for nonlinear eigenvalue problems
- An efficient reduced basis solver for stochastic Galerkin matrix equations
- An integral method for solving nonlinear eigenvalue problems
- An introduction to domain decomposition methods. Algorithms, theory, and parallel implementation
- Analyzing the convergence factor of residual inverse iteration
- Backward Error of Polynomial Eigenproblems Solved by Linearization
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Compact rational Krylov methods for nonlinear eigenvalue problems
- Computational Methods for Linear Matrix Equations
- Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations
- Efficient Computation of the Solutions to Modified Lyapunov Equations
- Floquet multipliers of periodic waveguides via Dirichlet-to-Neumann maps
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
- Low-rank solvers for fractional differential equations
- Matrix-equation-based strategies for convection-diffusion equations
- NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
- NLEVP, a collection of nonlinear eigenvalue problems
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- Nonlinear eigenvalue problems: Newton-type methods and nonlinear Rayleigh functionals
- Parallel iterative methods for sparse linear systems
- Recycling BICG with an application to model reduction
- Recycling BiCGSTAB with an application to parametric model order reduction
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Residual Inverse Iteration for the Nonlinear Eigenvalue Problem
- Sherman-Morrison-Woodbury formula for Sylvester and T-Sylvester equations with applications
- The waveguide eigenvalue problem and the tensor infinite Arnoldi method
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
Cited in
(8)- Residual-based iterations for the generalized Lyapunov equation
- Greedy low-rank algorithm for spatial connectome regression
- On the convergence of Krylov methods with low-rank truncations
- Numerical solution of a class of quasi-linear matrix equations
- Solving rank-structured Sylvester and Lyapunov equations
- Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations
- The waveguide eigenvalue problem and the tensor infinite Arnoldi method
- Sylvester theorem and the multichannel transfer matrix method for arbitrary transverse potential profile inside a wave guide
This page was built for publication: Sylvester-based preconditioning for the waveguide eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002792)
