Pregled bibliografske jedinice broj: 204040
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 2005 - International Conference on Numerical Analysis and Applied Mathematics 2005 / Simos, T. E. ; Psihoyios G. ; Tsitouras, G. (ur.).
Weinheim: Wiley-VCH, 2005. str. 230-233 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 204040 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 2005 - International Conference on Numerical Analysis and Applied Mathematics 2005
/ Simos, T. E. ; Psihoyios G. ; Tsitouras, G. - Weinheim : Wiley-VCH, 2005, 230-233
Skup
International Conference of Numerical Analysis and Applied Mathematics 2005 (ICNAAM 2005)
Mjesto i datum
Rodos, Grčka, 16.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 the other algorithms for the same purpose. We will show how to improve performance of the one-sided indefinite Jacobi algorithm. It can be ``blocked'' in a similar manner as the ordinary one, but instead of the ordinary CS decomposition we will need an indefinite version of the CS decomposition.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
0037114
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
