Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A state-of-the-art review on theory and engineering applications of eigenvalue and eigenvector derivatives
Eigenvalue and eigenvector derivatives with respect to system design variables and their
applications have been and continue to be one of the core issues in the design, control and …
applications have been and continue to be one of the core issues in the design, control and …
Nonsmooth optimization and robust control
AS Lewis - Annual Reviews in Control, 2007 - Elsevier
Many questions of robust control analysis and synthesis fundamentally involve nonsmooth
sets and functions, and their variational properties. Central examples include distances to …
sets and functions, and their variational properties. Central examples include distances to …
Numerical optimization of eigenvalues of Hermitian matrix functions
This work concerns the global minimization of a prescribed eigenvalue or a weighted sum of
prescribed eigenvalues of a Hermitian matrix-valued function depending on its parameters …
prescribed eigenvalues of a Hermitian matrix-valued function depending on its parameters …
[KNJIGA][B] The polynomial eigenvalue problem
M Berhanu - 2005 - search.proquest.com
In this thesis, we consider polynomial eigenvalue problems. We extend results on
eigenvalue and eigenvector condition numbers of matrix polynomials to condition numbers …
eigenvalue and eigenvector condition numbers of matrix polynomials to condition numbers …
Optimal trajectory design accounting for robust stability of path-following controller
This study presents an optimal control framework that designs an optimal trajectory while
additionally accounting for the stability of a path-deviation error controller that is dependent …
additionally accounting for the stability of a path-deviation error controller that is dependent …
Generalized eigenvalue problems with specified eigenvalues
We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix
pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value …
pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value …
Characterization and construction of the nearest defective matrix via coalescence of pseudospectral components
Let A be a matrix with distinct eigenvalues and let w (A) be the distance from A to the set of
defective matrices (using either the 2-norm or the Frobenius norm). Define Λϵ, the ϵ …
defective matrices (using either the 2-norm or the Frobenius norm). Define Λϵ, the ϵ …
Pseudospectra, critical points and multiple eigenvalues of matrix polynomials
We develop a general framework for perturbation analysis of matrix polynomials. More
specifically, we show that the normed linear space Lm (Cn× n) of n-by-n matrix polynomials …
specifically, we show that the normed linear space Lm (Cn× n) of n-by-n matrix polynomials …
On pseudospectra of matrix polynomials and their boundaries
In the first part of this paper (Sections 2–4), the main concern is with the boundary of the
pseudospectrum of a matrix polynomial and, particularly, with smoothness properties of the …
pseudospectrum of a matrix polynomial and, particularly, with smoothness properties of the …
Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity
E Mengi - Numerische Mathematik, 2011 - Springer
The Wilkinson distance of a matrix A is the two-norm of the smallest perturbation E so that A+
E has a multiple eigenvalue. Malyshev derived a singular value optimization …
E has a multiple eigenvalue. Malyshev derived a singular value optimization …