Pregled bibliografske jedinice broj: 264172
Efficient Eigenvalue Computation by Block Modification of the Indefinite One-Sided Jacobi Algorithm
Efficient Eigenvalue Computation by Block Modification of the Indefinite One-Sided Jacobi Algorithm // ICNAAM, International Conference on Numerical and Applied Mathematics 2005 / Simos, T. E. et al. (ur.).
Weinheim: Wiley-VCH, 2005. str. 230-233 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 264172 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Efficient Eigenvalue Computation by Block Modification of the Indefinite One-Sided Jacobi Algorithm
Autori
Hari, Vjeran ; Singer, Sanja ; Singer, Saša ;
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
ICNAAM, International Conference on Numerical and Applied Mathematics 2005
/ Simos, T. E. et al. - Weinheim : Wiley-VCH, 2005, 230-233
Skup
International Conference on Numerical and Applied Mathematics 2005
Mjesto i datum
Rodos, Grčka, 15.09.2005. - 20.09.2005
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Eigenvalue computation; indefinite Jacobi algorithm; block algorithm
Sažetak
Besides accuracy a modern eigenvalue algorithm should have comparable efficiency with other algorithms for the same purpose. We show how to improve performance of the one-sided Jacobi algorithm. It can be ``blocked'' in a similar manner as the ordinary one, but instead of the ordinary CS decomposition, we need an indefinite version of the CS decomposition.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
