Computing the square roots of matrices with central symmetry
For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were proposed by Bj¨ork and Hammarling [3], for square roots of general complex matrices, and by Higham [10], for real square ro...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2007
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/6378 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/6378 |