Parallel algorithm for solving some spectral problems of linear algebra
From MaRDI portal
An algorithm for the computation of the projection matrices \(P\) and \((I- P)\) onto the deflating subspaces of matrix pencils corresponding to the eigenvalues inside and outside the unit circle is described. Furthermore, the convergence of this algorithm and its implementation on parallel computers with shared memory are discussed.
Recommendations
- scientific article; zbMATH DE number 1526541
- scientific article; zbMATH DE number 1247167
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
- A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
Cites work
- A Generalized Eigenvalue Approach for Solving Riccati Equations
- A Storage-Efficient WY Representation for Products of Householder Transformations
- AB-algorithm and its modifications for the spectral problems of linear pencils of matrices
- An Algorithm for Generalized Matrix Eigenvalue Problems
- An effectively calculable parameter for the stability property of a system of linear differential equations with constant coefficients
- An estimate of the Green matrix and the continuity of the dichotomy parameter
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Circular dichotomy of the matrix spectrum
- Computing integrals involving the matrix exponential
- Computing invariant subspaces of a regular linear pencil of matrices
- Computing stable eigendecompositions of matrices
- Computing stable eigendecompositions of matrix pencils
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Guaranteed accuracy in spectral problems of linear algebra. II
- scientific article; zbMATH DE number 3889360 (Why is no real title available?)
- scientific article; zbMATH DE number 3818965 (Why is no real title available?)
- scientific article; zbMATH DE number 46587 (Why is no real title available?)
- scientific article; zbMATH DE number 3435336 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- On solution of large systems of linear equations with block-Toeplitz banded matrices
- On the Sensitivity of the Eigenvalue Problem Ax = \lambda Bx
- Problem of the dichotomy of the spectrum of a matrix
- The computation of Kronecker's canonical form of a singular pencil
- The WY Representation for Products of Householder Matrices
Cited in
(29)- Structured doubling algorithms for weakly stabilizing Hermitian solutions of algebraic Riccati equations
- Computation of pseudospectra via spectral projectors
- Stability and inertia theorems for generalized Lyapunov equations
- Some new algorithms for the spectral dichotomy methods
- Fast linear algebra is stable
- An arithmetic for matrix pencils: theory and new algorithms
- A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem
- Elliptic dichotomy of a matrix spectrum
- Parallel spectral division using the matrix sign function for the generalized eigenproblem
- On modifications to the spectral dichotomy algorithm
- Partial stabilization of descriptor systems using spectral projectors
- scientific article; zbMATH DE number 527505 (Why is no real title available?)
- On Parabolic and Elliptic Spectral Dichotomy
- Topological analysis of eigenvalues in engineering computations
- Structure-Preserving Algorithms for Periodic Discrete-Time Algebraic Riccati Equations
- Parallel solvers for discrete‐time algebric Riccati equations
- Spectral division methods for block generalized Schur decompositions
- Evaluating products of matrix pencils and collapsing matrix products
- Using permuted graph bases in \(\mathcal{H}_\infty\) control
- Circular trichotomy of the spectrum of regular matrix pencils
- Stability analysis and model order reduction of coupled systems
- A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- METHOD OF SPECTRAL DICHOTOMY OF A MATRIX WITH RESPECT TO A CIRCLE OR AN ELLIPSE NOT CENTERED AT THE ORIGIN
- A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
- Decay estimates of Green's matrices for discrete-time linear periodic systems
- Fast and inverse-free algorithms for deflating subspaces
- Generalized pseudospectral shattering and inverse-free matrix pencil diagonalization
- Efficient computation of the spectral projections of regular matrix pairs
This page was built for publication: Parallel algorithm for solving some spectral problems of linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260798)
