Spectral division methods for block generalized Schur decompositions
From MaRDI portal
Recommendations
- Parallel spectral division using the matrix sign function for the generalized eigenproblem
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- Efficient computation of the spectral projections of regular matrix pairs
- The Generalized Newton Iteration forthe Matrix Sign Function
- Some new algorithms for the spectral dichotomy methods
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4038256 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1154412 (Why is no real title available?)
- scientific article; zbMATH DE number 3435336 (Why is no real title available?)
- A BLAS-3 Version of the QR Factorization with Column Pivoting
- A generalization of the matrix-sign-function solution for algebraic Riccati equations
- AB-algorithm and its modifications for the spectral problems of linear pencils of matrices
- An Algorithm for Generalized Matrix Eigenvalue Problems
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- Circular dichotomy of the matrix spectrum
- Computing rank-revealing QR factorizations of dense matrices
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- On stabilization methods of descriptor systems
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
- Parallel algorithm for solving some spectral problems of linear algebra
- Rang revealing QR factorizations
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Rational Iterative Methods for the Matrix Sign Function
- Solving stable generalized Lyapunov equations with the matrix sign function
- The Spectral Decomposition of Nonsymmetric Matrices on Distributed Memory Parallel Computers
- Using the Matrix Sign Function to Compute Invariant Subspaces
Cited in
(17)- Analysis of the multiplicative Schwarz method for matrices with a special block structure
- Perturbation analysis for the sign functions of regular matrix pairs.
- MORLAB -- the model order reduction laboratory
- Effective condition numbers and small sample statistical condition estimation for the generalized Sylvester equation
- Infinite- and finite-buffer Markov fluid queues: a unified analysis
- On the numerical solution of large-scale sparse discrete-time Riccati equations
- A generalized structured doubling algorithm for the numerical solution of linear quadratic optimal control problems
- A structure-preserving doubling algorithm for nonsymmetric algebraic Riccati equation
- An arithmetic for matrix pencils: theory and new algorithms
- Two structure-preserving-doubling like algorithms for obtaining the positive definite solution to a class of nonlinear matrix equation
- Partial stabilization of descriptor systems using spectral projectors
- Efficient computation of the spectral projections of regular matrix pairs
- A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
- Extraction of deflating subspaces using disk function of a matrix pencil via matrix sign function with application in generalized eigenvalue problem
- Stable and efficient computation of generalized polar decompositions
- Spectral characterization and enforcement of negative imaginariness for descriptor systems
- The structure-preserving doubling algorithms for positive definite solution to a system of nonlinear matrix equations
This page was built for publication: Spectral division methods for block generalized Schur decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813611)
