Using the Matrix Sign Function to Compute Invariant Subspaces
From MaRDI portal
Recommendations
- The Matrix Sign Function Method and the Computation of Invariant Subspaces
- scientific article; zbMATH DE number 4151736
- scientific article; zbMATH DE number 3983386
- Some matrix iterations for computing matrix sign function
- Computing enclosures for the inverse square root and the sign function of a matrix
- Computing invariant subspaces of a regular linear pencil of matrices
- The matrix sign function
- Invariant theoretic characterization of subdiscriminants of matrices
- Signature of invertible symmetric matrices
- A novel procedure for constructing invariant subspaces of a set of matrices
Cited in
(37)- Computation of invariant subspaces associated with certain eigenvalues using an approach based on matrix sign function
- Newton-Based Mixed Precision Iterative Refinement for Large-Scale Sparse Continuous-Time Algebraic Riccati Equations
- The Generalized Newton Iteration forthe Matrix Sign Function
- A modified matrix sign function method for projected Lyapunov equations
- Computing enclosures for the inverse square root and the sign function of a matrix
- Perturbation analysis for the sign functions of regular matrix pairs.
- Low-rank generalized alternating direction implicit iteration method for solving matrix equations
- Approximating the matrix sign function using a novel iterative method
- The matrix sign function for solving surface wave problems in homogeneous and laterally periodic elastic half-spaces
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- An efficient iterative method for matrix sign function with application in stability analysis of control systems using spectrum splitting
- Perturbation of the matrix sign function
- Convex invertible sets and matrix sign function
- A structure-preserving doubling algorithm for continuous-time algebraic Riccati equations
- Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction
- Solving matrix polynomial equations arising in queueing problems
- The coninvolutory decomposition and its computation for a complex matrix
- Parallel spectral division using the matrix sign function for the generalized eigenproblem
- Nonlinear eigenvalue and frequency response problems in industrial practice
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Fast linear algebra is stable
- The matrix sign function
- Separating eigenvalues using the matrix sign function
- An invariant subspace method for large-scale algebraic Riccati equation
- scientific article; zbMATH DE number 1899860 (Why is no real title available?)
- scientific article; zbMATH DE number 3963088 (Why is no real title available?)
- An arithmetic for matrix pencils: theory and new algorithms
- Computing the matrix sign and absolute value functions
- Calculating a function of a matrix with a real spectrum
- Extraction of deflating subspaces using disk function of a matrix pencil via matrix sign function with application in generalized eigenvalue problem
- Separation of matrix eigenvalues and structural decomposition of large-scale systems
- Some new algorithms for the spectral dichotomy methods
- Solution of f(A)x=b with projection methods for the matrix A
- Spectral division methods for block generalized Schur decompositions
- The Matrix Sign Function Method and the Computation of Invariant Subspaces
- A globally convergent variant of mid-point method for finding the matrix sign
- Constructing a high-order globally convergent iterative method for calculating the matrix sign function
This page was built for publication: Using the Matrix Sign Function to Compute Invariant Subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389070)
