[PDF] Top 20 Adomian's decomposition method for eigenvalue problems

... the Adomian’s decomposition method to work for the general eigenvalue problems, in addition to the existing applications of the method to boundary and initial value ... See full document

... The method we developed here is the Adomian’s decom- position method ...necessary for the nonlinear part. The method has been widely applied to various domains in science and ... See full document

... allows errors in the computation, and can work on an appropriate initial subspace. • With shift-invert enhancement, residual Arnoldi[r] ... See full document

... quadratic eigenvalue problems (QEPs) is proposed by Friswell, Inman and Pilkey 1998, to incorporate the measured model data into the finite element model to produce an adjusted finite element model on the ... See full document

... In this paper, we continue our paper [7] to develop an efficient numerical algorithm for the finite element model updating of quadratic eigenvalue problems (QEPs). This model updating of QEPs is ... See full document

... an eigenvalue shifting technique to modify the original gyroscopic system to a new gyroscopic system, which changes the eigenvalues on the imaginary axis to eigenvalues with nonzero real parts, while keeps other ... See full document

... If only inequality constraints are presented in the constraint set, the cumulative constraint mea- sure that permits representation of large numbers of inequality constra[r] ... See full document

... eigenvalue problems. We first develop a semiorthogonal generalized Arnoldi method where the name comes from the application of a pseudo inner product in the construction of a generalized Arnoldi ... See full document

... Example 6.3 This experiment consists of six benchmark examples from the NLEVP [27]. In the following discussions, we describe each example and the choice of parameters for generating the coefficient matrices of ... See full document

... In this paper, the special pseudo-conjugate directions [9] that parallel the coordinate axes are used for the direct-search S D M algorithm, and one-dimensional search methods, inc[r] ... See full document

... secant method for computing each λ 1 , ...130989 for D 1 and D 2 , respectively, and the matrix sizes of G are 9312 and 13434, ...transmission eigenvalue problem, which plays an important role ... See full document

... where K is the m × r feedback gain matrix. The finite element model in structured dynamics can be found in the book by Friswell and Mottershead [5] for details. It is shown in [11] that if the system described by ... See full document

... nonlinear eigenvalue problems, which are very challenging due to a high-dimensional subspace associated with the eigen- value zero and the fact that the desired eigenvalues (with smallest real part) cluster ... See full document

... 兲 for ␣ sufficiently large, where 关n/2兴=the largest positive integer that is less than or equal to ...that for such N that ␭ 1 共 ␣ , 1兲⬍−2, whenever ␣ ⬎1/sin 2 共 ␲ / ...wavelet method works even ... See full document

... de
ation method for computing successive eigenpairs is developed and ...resulting eigenvalue systems from the nite dierence approximation in cylindrical ... See full document

... proposed for computing interior eigenpairs of large-scale cubic eigenvalue ...deflation method with low-rank updates is developed and ...the eigenvalue system resulting from the finite ... See full document

... Condition numbers and backward errors play an important role in numerical linear algebra. Condition numbers measure the sensitivity of solution of a problem to perturbations in the data and backward errors measure the ... See full document

... proposed method. We use “SL QZ” to denote the method asscoiated with the structured linearization (λZ ? + Z)y = 0, proposed in [12] for the PPEP, to which the QZ algorithm is ... See full document

... the transpose of (1.1), we can easily see that the eigenvalues of (1.1) have a ‘symplectic’ property, that is, they are symmetrically placed with respect to the unit circle, containing both an eigenvalue λ and its ... See full document

... We now try to explain the different accuracies of the algorithms. One important reason may be that Algorithms 5.1 and 5.2 need to solve a linear system in the extrac- tion method of eigenvectors, while Algorithm ... See full document