On the Schur Decomposition of a Matrix for Parallel Computation
From MaRDI portal
Recommendations
- A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
- On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation
- A parallel QR algorithm for the nonsymmetric eigenvalue problem
- A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix
- scientific article; zbMATH DE number 556483
Cited in
(12)- A symplectic acceleration method for the solution of the algebraic Riccati equation on a parallel computer
- A quadratically convergent parallel Jacobi process for diagonally dominant matrices with distinct eigenvalues
- A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
- scientific article; zbMATH DE number 6673365 (Why is no real title available?)
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- The parallel orthogonal decomposition (POD) of a matrix
- Nonlinear matrix decompositions and an application to parallel processing
- An acceleration method for computing the generalized eigenvalue problem on a parallel computer
- A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix
- Some complexity results in parallel matrix-based signal processing
This page was built for publication: On the Schur Decomposition of a Matrix for Parallel Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4725615)