Spectrum through pseudospectrum
Ioannis Koutis
Abstract
We present an iteration for the computation of simple eigenvalues using a pseudospectrum approach. The most appealing characteristic of the proposed iteration is that it reduces the computation of a single eigenvalue to a small number of eigenvalue computations on Hermitian matrices. We show that this number is directly associated with the matrix pseudospectrum. We present numerical results and we discuss advantages and drawbacks of the method. We also discuss its relationship with an iteration that was proposed independently in [Stewart, O' Leary, ETNA, Vol 8, 1998].
Create a lesson
Related papers
Sensitivity Calculus and its Numerical Implementation for Multi-D Hyperbolic Balance Laws
Olivia Dreßen, Michael Herty, Adrian Kolb et al.
A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New
Wanjie Lyu, Xiaojie Wang, Bin Yang
Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers
Nilo Schwencke, Roland Maier
Incremental Column Subset Selection via Conditional Determinantal Point Processes
Laura Grigori, Zhipeng Xue
A Hybrid High-Order Method for the Elasticity Problem with Linear Slip Interface
Erik Burman, Peiqi Huang
Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model
Stefan Schnake, Miroslav Stoyanov, Eirik Endeve et al.