A Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm (Q7374657)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm |
No description defined |
Statements
A Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm (English)
0 references
8 October 2026
0 references
math.NA
0 references
Mónica Esquivel-Rosado
0 references
Jared L. Aurentz
0 references
Giovanni Barbarino
0 references
María C. Quintana
0 references
We present a fast, stable, and square-root-free algorithm for computing eigenvalues of unitary matrices using core chasing; it exploits symmetries to reduce computational work while maintaining backward stability.
0 references
Unitary Matrices
0 references
Square-Root-Free
0 references
Core-Chasing Algorithm
0 references
1 reference
1 reference
1 reference
