A novel iterative method for polar decomposition and matrix sign function
From MaRDI portal
Publication:1723445
DOI10.1155/2015/649423zbMath1418.65060OpenAlexW2161783783WikidataQ57717604 ScholiaQ57717604MaRDI QIDQ1723445
Predrag S. Stanimirović, Igor Stojanović, Fazlollah Soleymani
Publication date: 19 February 2019
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/649423
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Numerically stable improved Chebyshev-Halley type schemes for matrix sign function ⋮ Several numerical methods for computing unitary polar factor of a matrix
Uses Software
Cites Work
- The matrix sign decomposition and its relation to the polar decomposition
- Approximating the matrix sign function using a novel iterative method
- The iterative methods for computing the polar decomposition of rank-deficient matrix
- Computing simple roots by an optimal sixteenth-order class
- A fast convergent numerical method for matrix sign function with application in SDEs
- On a fourth-order matrix method for computing polar decomposition
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Algorithms for the Polar Decomposition
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- On Halley's Iteration Method
- Computing the Polar Decomposition—with Applications
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- A family of Chebyshev-Halley type methods in Banach spaces
- Rational Iterative Methods for the Matrix Sign Function
- Functions of Matrices
This page was built for publication: A novel iterative method for polar decomposition and matrix sign function
