Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
Abstract
We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterativemore »
- Authors:
-
- Katholieke Univ. Leuven, Heverlee (Belgium)
- Koc Univ. (Turkey)
- Publication Date:
- Research Org.:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Org.:
- USDOE Office of Science (SC)
- OSTI Identifier:
- 1525243
- Grant/Contract Number:
- AC02-05CH11231
- Resource Type:
- Accepted Manuscript
- Journal Name:
- IMA Journal of Numerical Analysis
- Additional Journal Information:
- Journal Volume: 37; Journal Issue: 4; Journal ID: ISSN 0272-4979
- Publisher:
- Oxford University Press/Institute of Mathematics and its Applications
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Meerbergen, Karl, Michiels, Wim, Van Beeumen, Roel, and Mengi, Emre. Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems. United States: N. p., 2017.
Web. doi:10.1093/imanum/drw065.
Meerbergen, Karl, Michiels, Wim, Van Beeumen, Roel, & Mengi, Emre. Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems. United States. https://doi.org/10.1093/imanum/drw065
Meerbergen, Karl, Michiels, Wim, Van Beeumen, Roel, and Mengi, Emre. Wed .
"Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems". United States. https://doi.org/10.1093/imanum/drw065. https://www.osti.gov/servlets/purl/1525243.
@article{osti_1525243,
title = {Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems},
author = {Meerbergen, Karl and Michiels, Wim and Van Beeumen, Roel and Mengi, Emre},
abstractNote = {We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.},
doi = {10.1093/imanum/drw065},
journal = {IMA Journal of Numerical Analysis},
number = 4,
volume = 37,
place = {United States},
year = {Wed Jan 11 00:00:00 EST 2017},
month = {Wed Jan 11 00:00:00 EST 2017}
}
Web of Science
Figures / Tables:
Works referenced in this record:
Pseudospectra and stability radii for analytic matrix functions with application to time-delay systems
journal, October 2006
- Michiels, Wim; Green, Kirk; Wagenknecht, Thomas
- Linear Algebra and its Applications, Vol. 418, Issue 1
An Iterative Method for Computing the Pseudospectral Abscissa for a Class of Nonlinear Eigenvalue Problems
journal, January 2012
- Michiels, Wim; Guglielmi, Nicola
- SIAM Journal on Scientific Computing, Vol. 34, Issue 4
A Krylov Method for the Delay Eigenvalue Problem
journal, January 2010
- Jarlebring, Elias; Meerbergen, Karl; Michiels, Wim
- SIAM Journal on Scientific Computing, Vol. 32, Issue 6
On the Pseudospectra of Matrix Polynomials
journal, January 2005
- Lancaster, Peter; Psarrakos, Panayiotis
- SIAM Journal on Matrix Analysis and Applications, Vol. 27, Issue 1
Characterization and Computation of $\mathcal{H}_{\infty}$ Norms for Time-Delay Systems
journal, January 2010
- Michiels, Wim; Gumussoy, Suat
- SIAM Journal on Matrix Analysis and Applications, Vol. 31, Issue 4
Hydrodynamic Stability Without Eigenvalues
journal, July 1993
- Trefethen, L. N.; Trefethen, A. E.; Reddy, S. C.
- Science, Vol. 261, Issue 5121
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
journal, October 1996
- Lehoucq, R. B.; Sorensen, D. C.
- SIAM Journal on Matrix Analysis and Applications, Vol. 17, Issue 4
Vector Spaces of Linearizations for Matrix Polynomials
journal, January 2006
- Mackey, D. Steven; Mackey, Niloufer; Mehl, Christian
- SIAM Journal on Matrix Analysis and Applications, Vol. 28, Issue 4
NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
journal, January 2014
- Güttel, Stefan; Van Beeumen, Roel; Meerbergen, Karl
- SIAM Journal on Scientific Computing, Vol. 36, Issue 6
The Quadratic Eigenvalue Problem
journal, January 2001
- Tisseur, Françoise; Meerbergen, Karl
- SIAM Review, Vol. 43, Issue 2
Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius
journal, January 2014
- Kressner, Daniel; Vandereycken, Bart
- SIAM Journal on Matrix Analysis and Applications, Vol. 35, Issue 1
A curve tracing algorithm for computing the pseudospectrum
journal, September 1996
- Brühl, Martin
- BIT Numerical Mathematics, Vol. 36, Issue 3
More on pseudospectra for polynomial eigenvalue problems and applications in control theory
journal, August 2002
- Higham, Nicholas J.; Tisseur, Françoise
- Linear Algebra and its Applications, Vol. 351-352
ARPACK Users' Guide
book, January 1998
- Lehoucq, R. B.; Sorensen, D. C.; Yang, C.
- Software, Environments, and Tools
A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L∞-norm
journal, July 1990
- Boyd, S.; Balakrishnan, V.
- Systems & Control Letters, Vol. 15, Issue 1
A fast algorithm to compute the of a transfer function matrix
journal, April 1990
- Bruinsma, N. A.; Steinbuch, M.
- Systems & Control Letters, Vol. 14, Issue 4
Stability and Stabilization of Time-Delay Systems
book, January 2007
- Michiels, Wim; Niculescu, Silviu-Iulian
Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
journal, January 2001
- Tisseur, Françoise; Higham, Nicholas J.
- SIAM Journal on Matrix Analysis and Applications, Vol. 23, Issue 1
Localization Transitions in Non-Hermitian Quantum Mechanics
journal, July 1996
- Hatano, Naomichi; Nelson, David R.
- Physical Review Letters, Vol. 77, Issue 3
A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
journal, September 1988
- Byers, Ralph
- SIAM Journal on Scientific and Statistical Computing, Vol. 9, Issue 5
Numerical Optimization of Eigenvalues of Hermitian Matrix Functions
journal, January 2014
- Mengi, Emre; Yildirim, E. Alper; Kiliç, Mustafa
- SIAM Journal on Matrix Analysis and Applications, Vol. 35, Issue 2
Pseudospectra and delay differential equations
journal, November 2006
- Green, Kirk; Wagenknecht, Thomas
- Journal of Computational and Applied Mathematics, Vol. 196, Issue 2
Pseudo–spectra, the harmonic oscillator and complex resonances
journal, February 1999
- Davies, E. B.
- Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, Vol. 455, Issue 1982
Structured pseudospectra for nonlinear eigenvalue problems
journal, March 2008
- Wagenknecht, T.; Michiels, W.; Green, K.
- Journal of Computational and Applied Mathematics, Vol. 212, Issue 2
A Newton-based method for the calculation of the distance to instability
journal, December 2011
- Freitag, M. A.; Spence, A.
- Linear Algebra and its Applications, Vol. 435, Issue 12
Robust stability and a criss-cross algorithm for pseudospectra
journal, July 2003
- Burke, J. V.
- IMA Journal of Numerical Analysis, Vol. 23, Issue 3
Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
journal, October 2011
- Guglielmi, Nicola; Overton, Michael L.
- SIAM Journal on Matrix Analysis and Applications, Vol. 32, Issue 4
Reliably computing all characteristic roots of delay differential equations in a given right half plane using a spectral method
journal, March 2012
- Wu, Zhen; Michiels, Wim
- Journal of Computational and Applied Mathematics, Vol. 236, Issue 9
Linearization of matrix polynomials expressed in polynomial bases
journal, February 2008
- Amiraslani, A.; Corless, R. M.; Lancaster, P.
- IMA Journal of Numerical Analysis, Vol. 29, Issue 1
Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
journal, January 2015
- Van Beeumen, Roel; Meerbergen, Karl; Michiels, Wim
- SIAM Journal on Matrix Analysis and Applications, Vol. 36, Issue 2
Pseudospectra of rectangular matrices
journal, October 2002
- Wright, T. G.
- IMA Journal of Numerical Analysis, Vol. 22, Issue 4
On eigenvalues of matrices dependent on a parameter
journal, December 1964
- Lancaster, P.
- Numerische Mathematik, Vol. 6, Issue 1
Cobra: Parallel path following for computing the matrix pseudospectrum
journal, December 2001
- Bekas, C.; Gallopoulos, E.
- Parallel Computing, Vol. 27, Issue 14
The notion of approximate eigenvalues applied to an integral equation of laser theory
journal, January 1977
- Landau, H. J.
- Quarterly of Applied Mathematics, Vol. 35, Issue 1
A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
journal, January 2017
- Mengi, Emre
- SIAM Journal on Optimization, Vol. 27, Issue 1
Figures / Tables found in this record: