The Schur multiplier norm and its dual norm

For a complex self-adjoint n × n matrix A we show that its Schur multiplier norm is determined by ‖ A ‖ S = min ⁡ { ‖ diag ( P ) ‖ ∞ : − P ≤ A ≤ P } . For a norm ‖ | . ‖ | on M ( m , n ) ( C ) we define for an X in M ( m , n ) ( C ) the dual norm, ‖ | X ‖ | ⁎ , of X by the formula: ‖ | X ‖ | ⁎ : = sup ⁡ { | Tr n ( Y ⁎ X ) | : Y ∈ M ( m , n ) ( C ) , ‖ | Y ‖ | ≤ 1 } . For a vector λ in C n we let Δ ( λ ) denote the diagonal n × n matrix with entries from λ . The dual norm of the Schur multiplier norm on M n ( C ) is for a self-adjoint matrix A given by the formula: ‖ A ‖ S ⁎ = min ⁡ { Tr n ( Δ ( λ ) ) : λ ∈ R n , − Δ ( λ ) ≤ A ≤ Δ ( λ ) } . We study this minimization problem as a formal linear program.

Authors

Institutions

Publication Details

Journal
Linear Algebra and its Applications
Published
2026-04-23
DOI
https://doi.org/10.1016/j.laa.2026.04.022
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Schur multiplier norm and its dual norm

Erik Christensen
Linear Algebra and its Applications
Matrix Theory and Algorithms
article

The Schur multiplier norm and its dual norm

Erik Christensen
article en

Abstract

For a complex self-adjoint n × n matrix A we show that its Schur multiplier norm is determined by ‖ A ‖ S = min ⁡ { ‖ diag ( P ) ‖ ∞ : − P ≤ A ≤ P } . For a norm ‖ | . ‖ | on M ( m , n ) ( C ) we define for an X in M ( m , n ) ( C ) the dual norm, ‖ | X ‖ | ⁎ , of X by the formula: ‖ | X ‖ | ⁎ : = sup ⁡ { | Tr n ( Y ⁎ X ) | : Y ∈ M ( m , n ) ( C ) , ‖ | Y ‖ | ≤ 1 } . For a vector λ in C n we let Δ ( λ ) denote the diagonal n × n matrix with entries from λ . The dual norm of the Schur multiplier norm on M n ( C ) is for a self-adjoint matrix A given by the formula: ‖ A ‖ S ⁎ = min ⁡ { Tr n ( Δ ( λ ) ) : λ ∈ R n , − Δ ( λ ) ≤ A ≤ Δ ( λ ) } . We study this minimization problem as a formal linear program.

Linear Algebra and its ApplicationsVol. 743
University of Copenhagen (DK)
Openalex Percentile: Top 98%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.