PARALLEL SPECTRAL DIVISION USING THE MATRIX SIGN FUNCTION FOR THE GENERALIZED EIGENPROBLEM
Publication:2711493
DOI10.1142/S0129053300000084zbMath0973.65028OpenAlexW2042209861MaRDI QIDQ2711493
Enrique S. Quintana-Ortí, Xiaobai Sun, Yuan-Jye Y. Wu, Steven Huss-Lederman
Publication date: 3 December 2001
Published in: International Journal of High Speed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129053300000084
numerical experimentsparallel computationgeneralized eigenproblemmatrix sign functiondivide and conquer algorithmspectral division algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items (3)
Uses Software
Cites Work
- Rang revealing QR factorizations
- A parallel implementation of the QR-algorithm
- On stabilization methods of descriptor systems
- Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor
- Parallel algorithm for solving some spectral problems of linear algebra
- Solving stable generalized Lyapunov equations with the matrix sign function
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- A generalization of the matrix-sign-function solution for algebraic Riccati equations
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Computing rank-revealing QR factorizations of dense matrices
- The Spectral Decomposition of Nonsymmetric Matrices on Distributed Memory Parallel Computers
- Using the Matrix Sign Function to Compute Invariant Subspaces
- Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality
- An Algorithm for Generalized Matrix Eigenvalue Problems
This page was built for publication: PARALLEL SPECTRAL DIVISION USING THE MATRIX SIGN FUNCTION FOR THE GENERALIZED EIGENPROBLEM