Abstract. Scaling is a commonly used technique for standard eigenvalue problems to improve the sensitivity of the eigenvalues. In this paper we investigate scaling for generalized and polynomial eigenvalue problems (PEPs) of arbitrary degree. It is shown that an optimal diagonal scaling of a PEP with respect to an eigenvalue can be described by the ratio of its normwise and componentwise condition number. Furthermore, the effect of linearization on optimally scaled polynomials is investi-gated. We introduce a generalization of the diagonal scaling by Lemonnier and Van Dooren to PEPs that is especially effective if some information about the magnitude of the wanted eigenvalues is available and also discuss variable transformations of the typ...
Abstract. The standard way of solving the polynomial eigenvalue problem of degree m in n×n matrices ...
AbstractThis work is concerned with eigenvalue problems for structured matrix polynomials, including...
The standard way of solving the polynomial eigenvalue problem of degree $m$ in $n\times n$ matrices ...
Abstract. Scaling is a commonly used technique for standard eigenvalue problems to improve the sensi...
Scaling is a commonly used technique for standard eigenvalue problems to improve the sensitivity of ...
Scaling is a commonly used technique for standard eigenvalue problems to improve the sensitivity of ...
We propose a minimax scaling procedure for second order polynomial matrices that aims to minimize th...
[[abstract]]We propose a minimax scaling procedure for second order polynomial matrices that aims to...
Large Solving polynomial eigenvalue problems by a scaled block companion linearization Marc Van Bare...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Abstract. The standard way of solving the polynomial eigenvalue problem of degree m in n×n matrices ...
AbstractThis work is concerned with eigenvalue problems for structured matrix polynomials, including...
The standard way of solving the polynomial eigenvalue problem of degree $m$ in $n\times n$ matrices ...
Abstract. Scaling is a commonly used technique for standard eigenvalue problems to improve the sensi...
Scaling is a commonly used technique for standard eigenvalue problems to improve the sensitivity of ...
Scaling is a commonly used technique for standard eigenvalue problems to improve the sensitivity of ...
We propose a minimax scaling procedure for second order polynomial matrices that aims to minimize th...
[[abstract]]We propose a minimax scaling procedure for second order polynomial matrices that aims to...
Large Solving polynomial eigenvalue problems by a scaled block companion linearization Marc Van Bare...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Minisymposia "Matrix Scaling - Theory and Algorithms"International audienceWe study the behaviour of...
Abstract. The standard way of solving the polynomial eigenvalue problem of degree m in n×n matrices ...
AbstractThis work is concerned with eigenvalue problems for structured matrix polynomials, including...
The standard way of solving the polynomial eigenvalue problem of degree $m$ in $n\times n$ matrices ...