相关论文: Jacobi method for symmetric $4\times4$ matrices co…
The paper analyzes special cyclic Jacobi methods for symmetric matrices of order $4$. Only those cyclic pivot strategies that enable full parallelization of the method are considered. These strategies, unlike the serial pivot strategies,…
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…
In this paper we prove the global convergence of the complex Jacobi method for Hermitian matrices for a large class of generalized serial pivot strategies. For a given Hermitian matrix $A$ of order $n$ we find a constant $\gamma<1$…
In this paper, we consider a family of Jacobi-type algorithms for simultaneous orthogonal diagonalization problem of symmetric tensors. For the Jacobi-based algorithm of [SIAM J. Matrix Anal. Appl., 2(34):651--672, 2013], we prove its…
The paper considers the convergence of the complex block Jacobi diagonalization methods under the large set of the generalized serial pivot strategies. The global convergence of the block methods for Hermitian, normal and $J$-Hermitian…
The classic method for computing the spectral decomposition of a real symmetric matrix, the Jacobi algorithm, can be accelerated by using mixed precision arithmetic. The Jacobi algorithm is aiming to reduce the off-diagonal entries…
Jacobi's method is a well-known algorithm in linear algebra to diagonalize symmetric matrices by successive elementary rotations. We report about the generalization of these elementary rotations towards canonical transformations acting in…
Asymptotic rates of convergence of optimal SOR applied to linear systems with consistently ordered 2-cyclic matrices have been extensively studied in the case where the Jacobi eigenvalues are are real and contained in an interval centered…
In this paper, we provide a structure-preserving one-sided cyclic Jacobi method for computing the singular value decomposition of a quaternion matrix. In this method, the columns of the quaternion matrix are orthogonalized in pairs by using…
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
Jacobi-type algorithms for simultaneous approximate diagonalization of real (or complex) symmetric tensors have been widely used in independent component analysis (ICA) because of their good performance. One natural way of choosing the…
This paper presents a Jacobi-type iteration for computing a given specified eigenpair of a symmetric matrix. For a certain class of diagonally dominant matrices, the procedure is shown to converge at a linear rate depending on how the…
We apply the methods of classical approximation theory (extreme properties of polynomials) to study the essential support $\Sigma_{ac}$ of the absolutely continuous spectrum of Jacobi matrices. First, we prove an upper bound on the measure…
In this work the spectral theory of self-adjoint operator $A$ represented by Jacobi matrix is considered. The approach is based on the continued fraction representation of the resolvent matrix element of $A$. Different criteria of absolute…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…
The Eberlein method is a Jacobi-type process for solving the eigenvalue problem of an arbitrary matrix. In each iteration two transformations are applied on the underlying matrix, a plane rotation and a non-unitary elementary…
Convergence problems in coupled-cluster iterations are discussed, and a new iteration scheme is proposed. Whereas the Jacobi method inverts only the diagonal part of the large matrix of equation coefficients, we invert a matrix which also…
Solving symmetric positive semidefinite linear systems is an essential task in many scientific computing problems. While Jacobi-type methods, including the classical Jacobi method and the weighted Jacobi method, exhibit simplicity in their…
Group synchronization plays a crucial role in global pipelines for Structure from Motion (SfM). Its formulation is nonconvex and it is faced with highly corrupted measurements. Cycle consistency has been effective in addressing these…