Solution of linear equations by diagonalization of coefficients matrix
From MaRDI portal
Publication:3225985
DOI10.1090/qam/88795zbMath0066.10101OpenAlexW2562463829MaRDI QIDQ3225985
No author found.
Publication date: 1955
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/qam/88795
Related Items
On the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition, A Kogbetliantz-type algorithm for the hyperbolic SVD, On Kogbetliantz's SVD algorithm in the presence of clusters, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition, Unnamed Item, Batched Computation of the Singular Value Decompositions of Order Two by the AVX-512 Vectorization, Accuracy of the Kogbetliantz method for scaled diagonally dominant triangular matrices, Vectorization of a Thread-Parallel Jacobi Singular Value Decomposition Method, On high relative accuracy of the Kogbetliantz method, Updating the singular value decomposition, On sharp quadratic convergence bounds for the serial Jacobi methods, A sort-Jacobi algorithm for semisimple Lie algebras, A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD, Convergence to diagonal form of block Jacobi-type methods, On the \(QR\) algorithm and updating the \(SVD\) and the \(URV\) decomposition in parallel, Accuracy of two SVD algorithms for \(2\times 2\) triangular matrices, Singular value decomposition and least squares solutions, On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition, Asymptotic Quadratic Convergence of the Two-Sided Serial and Parallel Block-Jacobi SVD Algorithm, A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil, Linear convergence of the row cyclic Jacobi and Kogbetliantz methods, The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
