2024/10/29 by Jonathan Niño-Cortés, Cynthia Vinzant, Nino-Cortes, Jonathan +1 · 1 citation
Computer Science · Mathematics · #14Q30 #14h50 #15A60 (Primary) #52A10 #81P73 (Secondary) #Advanced Optimization Algorithms Research #Algebraic Geometry (math.AG) #FOS: Mathematics #Functional Analysis (math.FA) #Matrix Theory and Algorithms #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.2410.21625
openalex publication_date 2024/10/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex geometry of these sets, including a generalization of Kippenhahn's theorem, and describe an algorithm to explicitly calculate the higher-rank numerical range of a given matrix.