Pregled bibliografske jedinice broj: 1106368
Finding the closest normal structured matrix
Finding the closest normal structured matrix // Linear algebra and its applications, 617 (2021), 49-77 doi:10.1016/j.laa.2021.01.013 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1106368 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Finding the closest normal structured matrix
Autori
Begović Kovač, Erna
Izvornik
Linear algebra and its applications (0024-3795) 617
(2021);
49-77
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Normal matrices ; Hamiltonian ; skew-Hamiltonian ; per-Hermitian ; perskew-Hermitian ; symplectic ; perplectic ; Jacobi-type algorithm ; Givens rotations ; diagonalization
Sažetak
Given a structured matrix A we study the problem of finding the closest normal matrix with the same structure. The structures of our interest are: Hamiltonian, skew-Hamiltonian, per-Hermitian, and perskew-Hermitian. We develop a structure-preserving Jacobi-type algorithm for finding the closest normal structured matrix and show that such algorithm converges to a stationary point of the objective function.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
HRZZ-UIP-2019-04-5200 - Dekompozicije i aproksimacije matrica i tenzora (DAMAT) (Begović Kovač, Erna, HRZZ - 2019-04) ( CroRIS)
Ustanove:
Fakultet kemijskog inženjerstva i tehnologije, Zagreb
Profili:
Erna Begović Kovač
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
