相关论文: Computation of multiple eigenvalues and generalize…

We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…

In this article, we propose a reduced basis method for parametrized non-symmetric eigenvalue problems arising in the loading pattern optimization of a nuclear core in neutronics. To this end, we derive a posteriori error estimates for the…

Computing more than one eigenvalue for (large sparse) one-parameter polynomial and general nonlinear eigenproblems, as well as for multiparameter linear and nonlinear eigenproblems, is a much harder task than for standard eigenvalue…

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…

In this paper, an inexact Newton method for solving real-valued nonlinear eigenvalue problems with eigenvector dependency (NEPv) is introduced that is able to solve the problem on a matrix level. Our main contribution is to derive a variant…

The Jordan Canonical Form of a matrix is highly sensitive to perturbations, and its numerical computation remains a formidable challenge. This paper presents a regularization theory that establishes a well-posed least squares problem of…

A defective eigenvalue is well documented to be hypersensitive to data perturbations and round-off? errors, making it a formidable challenge in numerical computation particularly when the matrix is known through approximate data. This paper…

We consider an approximate computation of several minimal eigenpairs of large Hermitian matrices which come from high--dimensional problems. We use the tensor train format (TT) for vectors and matrices to overcome the curse of…

The eigenvalue problem plays a central role in linear algebra and its applications in control and optimization methods. In particular, many matrix decompositions rely upon computation of eigenvalue-eigenvector pairs, such as diagonal or…

We give formulae for first and second derivatives of generalized eigenvalues/eigenvectors of symmetric matrices and generalized singular values/singular vectors of rectangular matrices when the matrices are linear or nonlinear functions of…

We present a practical Newton-based method for computing left eigenvalues of quaternion matrices. It uses only standard real/complex linear-algebra kernels via embeddings and applies to matrices of any size. Extensive tests on literature…

Broyden's method is a general method commonly used for nonlinear systems of equations, when very little information is available about the problem. We develop an approach based on Broyden's method for nonlinear eigenvalue problems. Our…

In this paper, we first describe a matricial Newton-type algorithm designed to solve the multivariable spectrum approximation problem. We then prove its global convergence. Finally, we apply this approximation procedure to multivariate…

We investigate how invariant subspaces corresponding to a single eigenvalue will change when a matrix is perturbed. We focus on the invariant subspaces corresponding to an eigenvalue associated with the Jordan blocks that have the same…

This paper describes and develops a fast and accurate path following algorithm that computes the field of values boundary curve for every conceivable complex or real square matrix $A$. It relies on a matrix flow decomposition method that…

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…

The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation…

We present a new approach to compute selected eigenvalues and eigenvectors of the two-parameter eigenvalue problem. Our method requires computing generalized eigenvalue problems of the same size as the matrices of the initial two-parameter…

We compute the parametrized post-Newtonian parameter $\gamma$ in the case of a static point source for multiscalar-tensor gravity with completely general nonderivative couplings and potential in the Jordan frame. Similarly to the single…