Napredna pretraga

Pregled bibliografske jedinice broj: 679736

Componentwise backward error bounds of the relaxed forms of the fast Bunch--Parlett and the bounded Bunch--Kaufman algorithm


Manhart, Martina
Componentwise backward error bounds of the relaxed forms of the fast Bunch--Parlett and the bounded Bunch--Kaufman algorithm // Mathematical communications (2013) (znanstveni, poslan)


Naslov
Componentwise backward error bounds of the relaxed forms of the fast Bunch--Parlett and the bounded Bunch--Kaufman algorithm

Autori
Manhart, Martina

Vrsta, podvrsta
Radovi u časopisima, znanstveni

Izvornik
Mathematical communications (2013)

Status rada
Poslan

Ključne riječi
Symmetric indefinite factorization; componentwise backward error bounds; relaxed pivoting strategies

Sažetak
A nonsingular symmetric matrix $H$ can be factored as $P H P^t = L D L^t$, where $P$ is a permutation matrix, $L$ is unit lower triangular, and $D$ is a block diagonal matrix with diagonal blocks of order 1 or 2. For the relaxed forms of the bounded Bunch--Kaufman and the fast Bunch--Parlett strategy, we derive componentwise error bounds.

Izvorni jezik
Engleski

Znanstvena područja
Matematika



POVEZANOST RADA


Projekt / tema
037-1193086-2771 - Numeričke metode u geofizičkim modelima (Saša Singer, )

Ustanove
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb

Autor s matičnim brojem:
Martina Manhart, (298843)

Časopis indeksira:


  • Web of Science Core Collection (WoSCC)
    • Science Citation Index Expanded (SCI-EXP)
    • SCI-EXP, SSCI i/ili A&HCI
  • Scopus