Algorithms for the matrix sector function
From MaRDI portal
Publication:964060
Recommendations
- Halley's method for the matrix sector function
- Matrix sector functions and their applications to systems theory
- Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function
- A Padé family of iterations for the matrix sector function and the matrix \(p\)th root
- The Generalized Matrix Sector Function and the Separation of Matrix Eigenvalues
Cited in
(14)- Matrix sector functions and their applications to systems theory
- The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function
- Approximating the matrix sign function using a novel iterative method
- Halley's method for the matrix sector function
- A binary powering Schur algorithm for computing primary matrix roots
- Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root
- A Padé family of iterations for the matrix sector function and the matrix \(p\)th root
- A Padé family of iterations for the matrix sign function and related problems.
- The Generalized Matrix Sector Function and the Separation of Matrix Eigenvalues
- An algorithm to calculate generalized Seifert matrices
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- An Algorithm for the Matrix Lambert $W$ Function
- 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: Algorithms for the matrix sector function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964060)