p-Norm Bounds for Matrix Inverses with a Sparse Ostrowski–Brauer Extension

We derive upper bounds for induced matrix inverse p-norms, 1<p<∞, by combining row and column information through Hölder’s and Young’s inequalities. The bounds incorporate an S-partition scaling, an explicit norm-equivalence factor, and optimization over a scalar parameter. We prove that, whenever the classical unscaled row and column diagonal-dominance estimates are applicable, the optimized direct bound is at least as sharp as their endpoint interpolation. A nonsymmetric example shows that an interior exponent can yield a strict improvement even over separately optimized endpoint bounds. For p=2, the comparison matrix becomes symmetric, which allows the S-strict diagonal-dominance assumption to be replaced by the more general S-sparse Ostrowski–Brauer condition. This gives explicit bounds for both ∥A−1∥2 and the smallest singular value. In a 54-state whole-body pharmacokinetic model, the optimized bounds improve on separately optimized endpoint interpolation at all tested exponents and metabolic-clearance levels, with a 9.65% reduction for p=2 for the baseline parameter setting.

Authors

Institutions

Publication Details

Journal
AppliedMath
Published
2026-11-18
DOI
https://doi.org/10.3390/appliedmath6110198
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

p-Norm Bounds for Matrix Inverses with a Sparse Ostrowski–Brauer Extension

Ernest Šanca, Dragana Lj. Cvetković, Ksenija Doroslovački
1 links
AppliedMath
Matrix Theory and Algorithms
article

p-Norm Bounds for Matrix Inverses with a Sparse Ostrowski–Brauer Extension

Ernest Šanca, Dragana Lj. Cvetković, Ksenija Doroslovački
article en

Abstract

We derive upper bounds for induced matrix inverse p-norms, 1<p<∞, by combining row and column information through Hölder’s and Young’s inequalities. The bounds incorporate an S-partition scaling, an explicit norm-equivalence factor, and optimization over a scalar parameter. We prove that, whenever the classical unscaled row and column diagonal-dominance estimates are applicable, the optimized direct bound is at least as sharp as their endpoint interpolation. A nonsymmetric example shows that an interior exponent can yield a strict improvement even over separately optimized endpoint bounds. For p=2, the comparison matrix becomes symmetric, which allows the S-strict diagonal-dominance assumption to be replaced by the more general S-sparse Ostrowski–Brauer condition. This gives explicit bounds for both ∥A−1∥2 and the smallest singular value. In a 54-state whole-body pharmacokinetic model, the optimized bounds improve on separately optimized endpoint interpolation at all tested exponents and metabolic-clearance levels, with a 9.65% reduction for p=2 for the baseline parameter setting.

AppliedMathVol. 6(11)
University of Novi Sad (RS)
Provincial Secretariat for Science and Technological Development
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.

Laika access coming soon