共查询到20条相似文献,搜索用时 0 毫秒
1.
Shu-Fang Xu 《BIT Numerical Mathematics》1993,33(4):695-702
In this paper, we give a perturbation bound for the solution of the Jacobi matrix inverse eigenvalue problem.China State Major Key Project for Basic Researches. 相似文献
2.
In this paper, an inverse complementarity power iteration method (ICPIM) for solving eigenvalue complementarity problems (EiCPs) is proposed. Previously, the complementarity power iteration method (CPIM) for solving EiCPs was designed based on the projection onto the convex cone K. In the new algorithm, a strongly monotone linear complementarity problem over the convex cone K is needed to be solved at each iteration. It is shown that, for the symmetric EiCPs, the CPIM can be interpreted as the well‐known conditional gradient method, which requires only linear optimization steps over a well‐suited domain. Moreover, the ICPIM is closely related to the successive quadratic programming (SQP) via renormalization of iterates. The global convergence of these two algorithms is established by defining two nonnegative merit functions with zero global minimum on the solution set of the symmetric EiCP. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithms. 相似文献
3.
Kh. D. Ikramov 《Computational Mathematics and Mathematical Physics》2009,49(5):743-747
Let s 1, ..., s n be arbitrary complex scalars. It is required to construct an n × n normal matrix A such that s i is an eigenvalue of the leading principal submatrix A i , i = 1, 2, ..., n. It is shown that, along with the obvious diagonal solution diag(s 1, ..., s n ), this problem always admits a much more interesting nondiagonal solution A. As a rule, this solution is a dense matrix; with the diagonal solution, it shares the property that each submatrix A i is itself a normal matrix, which implies interesting connections between the spectra of the neighboring submatrices A i and A i + 1. 相似文献
4.
Yu Ping Wang Wenju Zhao Chung Tsun Shieh 《Mathematical Methods in the Applied Sciences》2019,42(18):6660-6671
The authors present a constructive algorithm for the numerical solution to a class of the inverse transmission eigenvalue problem. The numerical experiments are provided to demonstrate the efficiency of our algorithms by a numerical example. 相似文献
5.
6.
7.
Anthony G. Cronin 《Linear and Multilinear Algebra》2018,66(3):435-446
We present and compare three constructive methods for realizing nonreal spectra with three nonzero elements in the nonnegative inverse eigenvalue problem. We also provide some necessary conditions for realizability and numerical examples. In particular, we utilize the companion matrix. 相似文献
8.
In this paper, we consider the linear parameterized inverse eigenvalue problem of bisymmetric matrices which is described as follows: 相似文献
9.
D. Paul Phillips 《Journal of Mathematical Analysis and Applications》2005,312(1):248-260
We investigate a certain inverse problem involving the Sturm-Liouville equation. In particular, given a finite list of target values, when can a potential function of a given form be found that produces these numbers as eigenvalues? 相似文献
10.
Mikló s Horvá th 《Transactions of the American Mathematical Society》2006,358(11):5161-5177
Recently A. G. Ramm (1999) has shown that a subset of phase shifts , , determines the potential if the indices of the known shifts satisfy the Müntz condition . We prove the necessity of this condition in some classes of potentials. The problem is reduced to an inverse eigenvalue problem for the half-line Schrödinger operators.
11.
12.
A new look at the doubling algorithm for a structured palindromic quadratic eigenvalue problem 下载免费PDF全文
Recently, Guo and Lin [SIAM J. Matrix Anal. Appl., 31 (2010), 2784–2801] proposed an efficient numerical method to solve the palindromic quadratic eigenvalue problem (PQEP) (λ2AT+λQ + A)z = 0 arising from the vibration analysis of high speed trains, where have special structures: both Q and A are, among others, m × m block matrices with each block being k × k (thus, n = mk), and moreover, Q is block tridiagonal, and A has only one nonzero block in the (1,m)th block position. The key intermediate step of the method is the computation of the so‐called stabilizing solution to the n × n nonlinear matrix equation X + ATX−1A = Q via the doubling algorithm. The aim of this article is to propose an improvement to this key step through solving a new nonlinear matrix equation having the same form but of only k × k in size. This new and much smaller matrix equation can also be solved by the doubling algorithm. For the same accuracy, it takes the same number of doubling iterations to solve both the larger and the new smaller matrix equations, but each doubling iterative step on the larger equation takes about 4.8 as many flops than the step on the smaller equation. Replacing Guo's and Lin's key intermediate step by our modified one leads to an alternative method for the PQEP. This alternative method is faster, but the improvement in speed is not as dramatic as just for solving the respective nonlinear matrix equations and levels off as m increases. Numerical examples are presented to show the effectiveness of the new method. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
13.
14.
Rosário Fernandes 《Linear and Multilinear Algebra》2013,61(7):673-682
In 1979, Ferguson characterized the periodic Jacobi matrices with given eigenvalues and showed how to use the Lanzcos Algorithm to construct each such matrix. This article provides general characterizations and constructions for the complex analogue of periodic Jacobi matrices. As a consequence of the main procedure, we prove that the multiplicity of an eigenvalue of a periodic Jacobi matrix is at most 2. 相似文献
15.
We propose a Ulm-like method for solving inverse eigenvalue problems, which avoids solving approximate Jacobian equations comparing with other known methods. A convergence analysis of this method is provided and the R-quadratic convergence property is proved under the assumption of the distinction of given eigenvalues. Numerical experiments as well as the comparison with the inexact Newton-like method are given in the last section. 相似文献
16.
We consider the quadratic eigenvalue problem (or the QEP) , where and are Hermitian with positive definite. The QEP is called hyperbolic if 4(x^*Ax)(x^*Cx)$"> for all nonzero . We show that a relatively efficient test for hyperbolicity can be obtained by computing the eigenvalues of the QEP. A hyperbolic QEP is overdamped if is positive definite and is positive semidefinite. We show that a hyperbolic QEP (whose eigenvalues are necessarily real) is overdamped if and only if its largest eigenvalue is nonpositive. For overdamped QEPs, we show that all eigenpairs can be found efficiently by finding two solutions of the corresponding quadratic matrix equation using a method based on cyclic reduction. We also present a new measure for the degree of hyperbolicity of a hyperbolic QEP.
17.
18.
In this paper we consider an inverse problem for a damped vibration system from the noisy measured eigendata, where the mass, damping, and stiffness matrices are all symmetric positive‐definite matrices with the mass matrix being diagonal and the damping and stiffness matrices being tridiagonal. To take into consideration the noise in the data, the problem is formulated as a convex optimization problem involving quadratic constraints on the unknown mass, damping, and stiffness parameters. Then we propose a smoothing Newton‐type algorithm for the optimization problem, which improves a pre‐existing estimate of a solution to the inverse problem. We show that the proposed method converges both globally and quadratically. Numerical examples are also given to demonstrate the efficiency of our method. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
19.
In this paper, we propose an inverse inexact iteration method for the computation of the eigenvalue with the smallest modulus and its associated eigenvector for a large sparse matrix. The linear systems of the traditional inverse iteration are solved with accuracy that depends on the eigenvalue with the second smallest modulus and iteration numbers. We prove that this approach preserves the linear convergence of inverse iteration. We also propose two practical formulas for the accuracy bound which are used in actual implementation. © 1997 John Wiley & Sons, Ltd. 相似文献
20.