The Generalized Newton Iteration forthe Matrix Sign Function
From MaRDI portal
Recommendations
Cited in
(14)- An efficient GPU-based fractional-step domain decomposition scheme for the reaction-diffusion equation
- A modified matrix sign function method for projected Lyapunov equations
- Perturbation analysis for the sign functions of regular matrix pairs.
- Approximating the matrix sign function using a novel iterative method
- Effective condition numbers and small sample statistical condition estimation for the generalized Sylvester equation
- Infinite- and finite-buffer Markov fluid queues: a unified analysis
- A Newton-like method for computing deflating subspaces
- A generalized Steffensen's method for matrix sign function
- High-performance direct algorithms for computing the sign function of triangular matrices.
- scientific article; zbMATH DE number 3963088 (Why is no real title available?)
- An arithmetic for matrix pencils: theory and new algorithms
- Partial stabilization of descriptor systems using spectral projectors
- Extraction of deflating subspaces using disk function of a matrix pencil via matrix sign function with application in generalized eigenvalue problem
- Spectral division methods for block generalized Schur decompositions
This page was built for publication: The Generalized Newton Iteration forthe Matrix Sign Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785941)