orthogonal similarity transformation
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 1)

H-INDEX

3
(FIVE YEARS 0)

2020 ◽  
Vol 128 (11) ◽  
pp. 1614
Author(s):  
В.А. Кузьмицкий

Based on algebraic methods, we have found an accurate solution for the inverse task for the vibronic analogue of the complex Fermi resonance, i.e. the determination from the spectral data (energies Ek and transition intensities Ik of the observed conglomerate of lines, k = 1, 2, ..., n; n > 2) energies of the «dark» states Am and the matrix elements of their coupling Bm with the «bright» state. The algorithm consists of two stages. At the first stage, the Jacobi plane rotations are used to construct an orthogonal similarity transformation matrix X, for which the elements of the first row obey the requirement (X1k)^2 = Ik, which corresponds to that fact that there is only one non-perturbed «bright» state. At the second stage, the quantities Am and Bm are obtained after solving the eigenvalue problem for block of «dark» states of the matrix Xdiag({Ek})X-1.


2001 ◽  
Vol 11 (08) ◽  
pp. 2277-2285 ◽  
Author(s):  
M. J. FRIEDMAN

The Continuation of Invariant Subspaces (CIS) algorithm [Demmel et al., 2001; Dieci & Friedman, 2001] produces a smooth orthogonal similarity transformation to block triangular form of a parameter dependent matrix A(s). The CIS algorithm is an adaptation of an iterative refinement technique for improving the accuracy of computed invariant subspaces. On the basis of the CIS algorithm, new test functions are defined for an improved, more reliable detection of bifurcations in problems with simple bifurcations near multiple bifurcations, problems with multiple bifurcations, and problems with symmetries. Illustrative examples are given.


Sign in / Sign up

Export Citation Format

Share Document