A note on a one-sided Jacobi algorithm
A variant of Jacobi's diagonalization algorithm for positive definite matrices A is proposed that has the advantage of a better vectorization due to the fact that the matrix to be updated is accessed only by columns. In a first step the given matrix A is formally replaced by \(\hat A\) that is obtained by a step of the symmetric LR algorithm. In principle the matrix \(\hat A\) is diagonalized by a sequence of plane rotations in an implicit way by using one-sided rotations to the Cholesky factor L of \(A=LL^ t\). The high efficiency of the proposed algorithm in comparison with the QL algorithm is outlined.
- An improved parallel Jacobi method for diagonalizing a symmetric matrix
- scientific article; zbMATH DE number 1893760
- On One-Sided Jacobi Methods for Parallel Computation
- A One-Sided Jacobi Algorithm for Computing the Singular Value Decomposition on a Vector Computer
- Efficient eigenvalue computation by block modification of the indefinite one-sided Jacobi algorithm
- A One-Sided Jacobi Algorithm for Computing the Singular Value Decomposition on a Vector Computer
- A one-sided transformation method for the singular value decomposition and algebraic eigenproblem
- Adaptation of the Jacobi Method for a Computer with Magnetic-tape Backing Store
- An overview of parallel algorithms for the singular value and symmetric eigenvalue problems
- Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
- Das Jacobi-Verfahren fürAx = λBx
- Fast givens rotations for orthogonal similarity transformations
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Inversion of Matrices by Biorthogonalization and Related Results
- On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
- On Jacobi Methods for Singular Value Decompositions
- On One-Sided Jacobi Methods for Parallel Computation
- The JK method: a procedure for finding the eigenvectors and eigenvalues of a real symmetric matrix
- The natural factor formulation of the stiffness for the matrix displacement method
- Über explizite, halbimplizite und implizite Algorithmen zur endlichen und iterativen Transformation von Matrizenpaaren
- Quadratic convergence of a special quasi-cyclic Jacobi method
- A Jacobi eigenreduction algorithm for definite matrix pairs
- On the global and cubic convergence of a quasi-cyclic Jacobi method
- An SVD-like matrix decomposition and its applications
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Convergence to diagonal form of block Jacobi-type methods
- A real algorithm for the Hermitian eigenvalue decomposition
- Accelerating the SVD block-Jacobi method
- Quadratic convergence estimate of scaled iterates by \(J\)-symmetric Jacobi method
- Efficient eigenvalue computation by block modification of the indefinite one-sided Jacobi algorithm
- On One-Sided Jacobi Methods for Parallel Computation
- Jacobi's Algorithm on Compact Lie Algebras
- On the global convergence of the Jacobi method for symmetric matrices of order 4 under parallel strategies
- Novel modifications of parallel Jacobi algorithms
- Computing accurate eigenvalues using a mixed-precision Jacobi algorithm
- Accelerating preconditioned Jacobi methods via perturbation-inspired pivoting
This page was built for publication: A note on a one-sided Jacobi algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262697)
