Pub Date : 2025-12-15DOI: 10.1016/j.laa.2025.12.010
John Byrne
For a graph family , let and denote the maximum number of edges and maximum spectral radius of an n-vertex -free graph, respectively, and let and denote the corresponding sets of extremal graphs. Wang, Kang, and Xue showed that if and then for n large enough. Fang, Tait, and Zhai extended this result by showing if then for n large enough, and asked for the maximum constant such that guarantees such containment. In this paper we determine exactly for all .
{"title":"A sharp spectral extremal result for general non-bipartite graphs","authors":"John Byrne","doi":"10.1016/j.laa.2025.12.010","DOIUrl":"10.1016/j.laa.2025.12.010","url":null,"abstract":"<div><div>For a graph family <span><math><mi>F</mi></math></span>, let <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> and <span><math><mrow><mi>spex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> denote the maximum number of edges and maximum spectral radius of an <em>n</em>-vertex <span><math><mi>F</mi></math></span>-free graph, respectively, and let <span><math><mrow><mi>EX</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> and <span><math><mrow><mi>SPEX</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> denote the corresponding sets of extremal graphs. Wang, Kang, and Xue showed that if <span><math><mi>r</mi><mo>≥</mo><mn>2</mn></math></span> and <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo><mo>=</mo><mi>e</mi><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>r</mi></mrow></msub><mo>)</mo><mo>+</mo><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> then <span><math><mrow><mi>SPEX</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo><mo>⊆</mo><mrow><mi>EX</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> for <em>n</em> large enough. Fang, Tait, and Zhai extended this result by showing if <span><math><mi>e</mi><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>r</mi></mrow></msub><mo>)</mo><mo>≤</mo><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo><mo><</mo><mi>e</mi><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>r</mi></mrow></msub><mo>)</mo><mo>+</mo><mo>⌊</mo><mi>n</mi><mo>/</mo><mn>2</mn><mi>r</mi><mo>⌋</mo></math></span> then <span><math><mrow><mi>SPEX</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo><mo>⊆</mo><mrow><mi>EX</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> for <em>n</em> large enough, and asked for the maximum constant <span><math><mi>c</mi><mo>(</mo><mi>r</mi><mo>)</mo></math></span> such that <span><math><mrow><mi>ex</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>F</mi><mo>)</mo><mo>≤</mo><mi>e</mi><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>r</mi></mrow></msub><mo>)</mo><mo>+</mo><mo>(</mo><mi>c</mi><mo>(</mo><mi>r</mi><mo>)</mo><mo>−</mo><mi>ε</mi><mo>)</mo><mi>n</mi></math></span> guarantees such containment. In this paper we determine <span><math><mi>c</mi><mo>(</mo><mi>r</mi><mo>)</mo></math></span> exactly for all <span><math><mi>r</mi><mo>≥</mo><mn>3</mn></math></span>.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"733 ","pages":"Pages 75-115"},"PeriodicalIF":1.1,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145788852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-12DOI: 10.1016/j.laa.2025.12.008
Filip Jonsson Kling
Consider a standard graded artinian k-algebra B and an extension of B by a new variable, for some . We will show how maximal rank properties for powers of a general linear form on A can be determined by maximal rank properties for different powers of general linear forms on B. This is then used to study Lefschetz properties of algebras that can be obtained via such extensions. In particular, it allows for a new proof that monomial complete intersections have the strong Lefschetz property over a field of characteristic zero. Moreover, it gives a recursive formula for the determinants that show up in that case. Finally, for algebras over a field of characteristic zero, we give a classification for what properties B must have for all extensions to have the weak or the strong Lefschetz property.
{"title":"Preserving Lefschetz properties after extension of variables","authors":"Filip Jonsson Kling","doi":"10.1016/j.laa.2025.12.008","DOIUrl":"10.1016/j.laa.2025.12.008","url":null,"abstract":"<div><div>Consider a standard graded artinian <em>k</em>-algebra <em>B</em> and an extension of <em>B</em> by a new variable, <span><math><mi>A</mi><mo>=</mo><mi>B</mi><msub><mrow><mo>⊗</mo></mrow><mrow><mi>k</mi></mrow></msub><mi>k</mi><mo>[</mo><mi>x</mi><mo>]</mo><mo>/</mo><mo>(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>d</mi></mrow></msup><mo>)</mo></math></span> for some <span><math><mi>d</mi><mo>≥</mo><mn>1</mn></math></span>. We will show how maximal rank properties for powers of a general linear form on <em>A</em> can be determined by maximal rank properties for different powers of general linear forms on <em>B</em>. This is then used to study Lefschetz properties of algebras that can be obtained via such extensions. In particular, it allows for a new proof that monomial complete intersections have the strong Lefschetz property over a field of characteristic zero. Moreover, it gives a recursive formula for the determinants that show up in that case. Finally, for algebras over a field of characteristic zero, we give a classification for what properties <em>B</em> must have for all extensions <span><math><mi>B</mi><msub><mrow><mo>⊗</mo></mrow><mrow><mi>k</mi></mrow></msub><mi>k</mi><mo>[</mo><mi>x</mi><mo>]</mo><mo>/</mo><mo>(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>d</mi></mrow></msup><mo>)</mo></math></span> to have the weak or the strong Lefschetz property.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"733 ","pages":"Pages 26-60"},"PeriodicalIF":1.1,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145788850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-08DOI: 10.1016/j.laa.2025.12.005
Hwa-Long Gau , Chi-Kwong Li , Kuo-Zhong Wang
For an complex matrix A, we study the value , which is the maximum size of an orthonormal set such that lie on the boundary of for . We give a complete characterization of matrices A with , and determine when such a matrix has reducing subspaces. Furthermore, we characterize companion matrices and nonnegative upper triangular the Toeplitz matrices A with .
{"title":"Matrices with all diagonal entries lying on the boundary of the numerical range","authors":"Hwa-Long Gau , Chi-Kwong Li , Kuo-Zhong Wang","doi":"10.1016/j.laa.2025.12.005","DOIUrl":"10.1016/j.laa.2025.12.005","url":null,"abstract":"<div><div>For an <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> complex matrix <em>A</em>, we study the value <span><math><mi>k</mi><mo>(</mo><mi>A</mi><mo>)</mo></math></span>, which is the maximum size of an orthonormal set <span><math><mo>{</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span> such that <span><math><msubsup><mrow><mi>x</mi></mrow><mrow><mi>j</mi></mrow><mrow><mo>⁎</mo></mrow></msubsup><mi>A</mi><msub><mrow><mi>x</mi></mrow><mrow><mi>j</mi></mrow></msub></math></span> lie on the boundary of <span><math><mi>W</mi><mo>(</mo><mi>A</mi><mo>)</mo></math></span> for <span><math><mi>j</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi></math></span>. We give a complete characterization of matrices <em>A</em> with <span><math><mi>k</mi><mo>(</mo><mi>A</mi><mo>)</mo><mo>=</mo><mi>n</mi></math></span>, and determine when such a matrix has reducing subspaces. Furthermore, we characterize companion matrices and nonnegative upper triangular the Toeplitz matrices <em>A</em> with <span><math><mi>k</mi><mo>(</mo><mi>A</mi><mo>)</mo><mo>=</mo><mi>n</mi></math></span>.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"733 ","pages":"Pages 1-25"},"PeriodicalIF":1.1,"publicationDate":"2025-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145711964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-05DOI: 10.1016/j.laa.2025.12.004
Mao-Ting Chien , Hiroshi Nakazato
The ternary form of an matrix A is defined by , where and . If the algebraic curve has no singular points, the Helton-Vinnikov theorem asserts that there are non-unitarily similar symmetric matrices S satisfying , where . We compare the operator norms of the symmetric matrices that share the same numerical range of A.
{"title":"Comparing the operator norms of symmetric matrices sharing the same numerical range","authors":"Mao-Ting Chien , Hiroshi Nakazato","doi":"10.1016/j.laa.2025.12.004","DOIUrl":"10.1016/j.laa.2025.12.004","url":null,"abstract":"<div><div>The ternary form of an <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> matrix <em>A</em> is defined by <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>A</mi></mrow></msub><mo>(</mo><mi>t</mi><mo>,</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo><mo>=</mo><mrow><mi>det</mi></mrow><mo>(</mo><mi>t</mi><msub><mrow><mi>I</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>+</mo><mi>x</mi><mo>ℜ</mo><mo>(</mo><mi>A</mi><mo>)</mo><mo>+</mo><mi>y</mi><mo>ℑ</mo><mo>(</mo><mi>A</mi><mo>)</mo><mo>)</mo></math></span>, where <span><math><mo>ℜ</mo><mo>(</mo><mi>A</mi><mo>)</mo><mo>=</mo><mo>(</mo><mi>A</mi><mo>+</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>)</mo><mo>/</mo><mn>2</mn></math></span> and <span><math><mo>ℑ</mo><mo>(</mo><mi>A</mi><mo>)</mo><mo>=</mo><mo>(</mo><mi>A</mi><mo>−</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>)</mo><mo>/</mo><mo>(</mo><mn>2</mn><mi>i</mi><mo>)</mo></math></span>. If the algebraic curve <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>A</mi></mrow></msub><mo>(</mo><mi>t</mi><mo>,</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span> has no singular points, the Helton-Vinnikov theorem asserts that there are <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>g</mi></mrow></msup></math></span> non-unitarily similar symmetric matrices <em>S</em> satisfying <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>A</mi></mrow></msub><mo>(</mo><mi>t</mi><mo>,</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo><mo>=</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>t</mi><mo>,</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo></math></span>, where <span><math><mi>g</mi><mo>=</mo><mo>(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>(</mo><mi>n</mi><mo>−</mo><mn>2</mn><mo>)</mo><mo>/</mo><mn>2</mn></math></span>. We compare the operator norms of the <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>g</mi></mrow></msup></math></span> symmetric matrices that share the same numerical range of <em>A</em>.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"732 ","pages":"Pages 207-228"},"PeriodicalIF":1.1,"publicationDate":"2025-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145733919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-04DOI: 10.1016/j.laa.2025.12.002
Krzysztof Szczygielski
We characterize covariant positive decomposable maps between unital C*-algebras in terms of a dilation theorem, which generalizes a seminal result by H. Scutaru from (1979) [7]. As a case study, we provide a certain characterization of the operator sum representation of maps on , covariant with respect to the maximal commutative subgroup of . A connection to quantum dynamics is established by specifying sufficient and necessary conditions for covariance of D-divisible (decomposably divisible) quantum evolution families, recently introduced in Szczygielski (2023) [11].
{"title":"Covariant decomposable maps on C*-algebras and quantum dynamics","authors":"Krzysztof Szczygielski","doi":"10.1016/j.laa.2025.12.002","DOIUrl":"10.1016/j.laa.2025.12.002","url":null,"abstract":"<div><div>We characterize covariant positive decomposable maps between unital C*-algebras in terms of a dilation theorem, which generalizes a seminal result by H. Scutaru from (1979) <span><span>[7]</span></span>. As a case study, we provide a certain characterization of the operator sum representation of maps on <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>C</mi><mo>)</mo></math></span>, covariant with respect to the maximal commutative subgroup of <span><math><mi>U</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span>. A connection to quantum dynamics is established by specifying sufficient and necessary conditions for covariance of D-divisible (decomposably divisible) quantum evolution families, recently introduced in Szczygielski (2023) <span><span>[11]</span></span>.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"732 ","pages":"Pages 126-161"},"PeriodicalIF":1.1,"publicationDate":"2025-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145682616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-03DOI: 10.1016/j.laa.2025.11.023
Grigory Ivanov
We prove the following colorful Helly-type result: Fix . Assume are finite sets (colors) of nonzero vectors in . If for every rainbow sub-selection R from these sets of size at most , the system has at least k linearly independent solutions, then at least one of the systems , has at least k linearly independent solutions.
A rainbow sub-selection from several sets refers to choosing at most one element from each set (color).
The Helly number and the number of colors are optimal.
Our key observation is a certain colorful Carathéodory-type result for positive bases.
{"title":"Colorful positive bases decomposition and Helly-type results for cones","authors":"Grigory Ivanov","doi":"10.1016/j.laa.2025.11.023","DOIUrl":"10.1016/j.laa.2025.11.023","url":null,"abstract":"<div><div>We prove the following colorful Helly-type result: Fix <span><math><mi>k</mi><mo>∈</mo><mo>[</mo><mi>d</mi><mo>−</mo><mn>1</mn><mo>]</mo></math></span>. Assume <span><math><msub><mrow><mi>A</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>d</mi><mo>+</mo><mo>(</mo><mi>d</mi><mo>−</mo><mi>k</mi><mo>)</mo><mo>+</mo><mn>1</mn></mrow></msub></math></span> are finite sets (colors) of nonzero vectors in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span>. If for every rainbow sub-selection <em>R</em> from these sets of size at most <span><math><mi>max</mi><mo></mo><mo>{</mo><mi>d</mi><mo>+</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>(</mo><mi>d</mi><mo>−</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>)</mo><mo>}</mo></math></span>, the system <span><math><mrow><mo>〈</mo><mi>a</mi><mo>,</mo><mi>x</mi><mo>〉</mo></mrow><mo>≤</mo><mn>0</mn><mo>,</mo><mspace></mspace><mi>a</mi><mo>∈</mo><mi>R</mi></math></span> has at least <em>k</em> linearly independent solutions, then at least one of the systems <span><math><mrow><mo>〈</mo><mi>a</mi><mo>,</mo><mi>x</mi><mo>〉</mo></mrow><mo>≤</mo><mn>0</mn><mo>,</mo><mspace></mspace><mi>a</mi><mo>∈</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, <span><math><mi>i</mi><mo>∈</mo><mo>[</mo><mi>d</mi><mo>+</mo><mo>(</mo><mi>d</mi><mo>−</mo><mi>k</mi><mo>)</mo><mo>+</mo><mn>1</mn><mo>]</mo></math></span> has at least <em>k</em> linearly independent solutions.</div><div>A <em>rainbow sub-selection</em> from several sets refers to choosing at most one element from each set (color).</div><div>The Helly number <span><math><mi>max</mi><mo></mo><mo>{</mo><mi>d</mi><mo>+</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>(</mo><mi>d</mi><mo>−</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>)</mo><mo>}</mo></math></span> and the number of colors <span><math><mi>d</mi><mo>+</mo><mo>(</mo><mi>d</mi><mo>−</mo><mi>k</mi><mo>)</mo><mo>+</mo><mn>1</mn></math></span> are optimal.</div><div>Our key observation is a certain colorful Carathéodory-type result for positive bases.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"732 ","pages":"Pages 108-125"},"PeriodicalIF":1.1,"publicationDate":"2025-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145682613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-03DOI: 10.1016/j.laa.2025.12.001
Michał Buchała
The aim of this paper is to obtain m-isometric dilation of expansive m-concave operator on Hilbert space. The obtained dilation is shown to be minimal. The matrix representation of this dilation is given. It is also proved that in case of 3-concave operators the assumption on expansivity is not necessary. The paper contains an example showing that minimal m-isometric dilations may not be isomorphic.
{"title":"Every expansive m-concave operator has m-isometric dilation","authors":"Michał Buchała","doi":"10.1016/j.laa.2025.12.001","DOIUrl":"10.1016/j.laa.2025.12.001","url":null,"abstract":"<div><div>The aim of this paper is to obtain <em>m</em>-isometric dilation of expansive <em>m</em>-concave operator on Hilbert space. The obtained dilation is shown to be minimal. The matrix representation of this dilation is given. It is also proved that in case of 3-concave operators the assumption on expansivity is not necessary. The paper contains an example showing that minimal <em>m</em>-isometric dilations may not be isomorphic.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"732 ","pages":"Pages 93-107"},"PeriodicalIF":1.1,"publicationDate":"2025-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145682612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-02DOI: 10.1016/j.laa.2025.11.018
Erin Carson , Kathryn Lund , Yuxin Ma , Eda Oktay
Interest in communication-avoiding orthogonalization schemes for high-performance computing has been growing recently. This manuscript addresses open questions about the numerical stability of various block classical Gram-Schmidt variants that have been proposed in the past few years. An abstract framework is employed, the flexibility of which allows for new rigorous bounds on the loss of orthogonality in these variants. We first analyze a generalization of (reorthogonalized) block classical Gram-Schmidt and show that a “strong” intrablock orthogonalization routine is only needed for the very first block in order to maintain orthogonality on the level of the unit roundoff. In particular, this “strong” first step does not have to be a reorthogonalized QR itself and subsequent steps can use less stable QR variants, thus keeping the overall communication costs low.
Then, using this variant, which has four synchronization points per block column, we remove the synchronization points one at a time and analyze how each alteration affects the stability of the resulting method. Our analysis shows that the variant requiring only one synchronization per block column, equivalent to a variant previously proposed in the literature, cannot be guaranteed to be stable in practice, as stability begins to degrade with the first reduction of synchronization points. As a negative result, we conclude that this particular block algorithm should be avoided in practice.
Our analysis of block methods also provides new, more positive theoretical results for the single-column case. In particular, it is proven that DCGS2 from (Bielich et al., 2022 [5]) and CGS-2 from (Świrydowicz et al., 2021 [10]) are as stable as Householder QR. Numerical examples from the BlockStab toolbox are included throughout, to help compare variants and illustrate the effects of different choices of intraorthogonalization subroutines.
最近,人们对用于高性能计算的避免通信的正交化方案越来越感兴趣。这篇手稿解决了关于过去几年提出的各种块经典Gram-Schmidt变异体的数值稳定性的开放问题。采用抽象框架,其灵活性允许在这些变体中对正交性损失的新的严格界限。我们首先分析了(重新正交化)块经典Gram-Schmidt的推广,并表明为了在单位舍入水平上保持正交性,只需要在第一个块上使用“强”块内正交化例程。特别是,这个“强”的第一步不必是重新正交化的QR本身,后续步骤可以使用不太稳定的QR变体,从而保持整体通信成本较低。然后,使用这种每个块列有四个同步点的变体,我们一次删除一个同步点,并分析每次更改如何影响结果方法的稳定性。我们的分析表明,每个块列只需要一个同步的变体,相当于以前在文献中提出的变体,不能保证在实践中是稳定的,因为随着同步点的首次减少,稳定性开始下降。作为否定的结果,我们得出结论,在实践中应该避免这种特殊的块算法。我们对块方法的分析也为单列情况提供了新的、更积极的理论结果。特别是证明了(Bielich et al., 2022[5])中的DCGS2和(Świrydowicz et al., 2021[10])中的CGS-2与Householder QR一样稳定。从BlockStab工具箱中的数值示例包括在整个过程中,以帮助比较变量,并说明不同选择的内正交化子例程的影响。
{"title":"On the loss of orthogonality in low-synchronization variants of reorthogonalized block classical Gram-Schmidt","authors":"Erin Carson , Kathryn Lund , Yuxin Ma , Eda Oktay","doi":"10.1016/j.laa.2025.11.018","DOIUrl":"10.1016/j.laa.2025.11.018","url":null,"abstract":"<div><div>Interest in communication-avoiding orthogonalization schemes for high-performance computing has been growing recently. This manuscript addresses open questions about the numerical stability of various block classical Gram-Schmidt variants that have been proposed in the past few years. An abstract framework is employed, the flexibility of which allows for new rigorous bounds on the loss of orthogonality in these variants. We first analyze a generalization of (reorthogonalized) block classical Gram-Schmidt and show that a “strong” intrablock orthogonalization routine is only needed for the very first block in order to maintain orthogonality on the level of the unit roundoff. In particular, this “strong” first step does not have to be a reorthogonalized QR itself and subsequent steps can use less stable QR variants, thus keeping the overall communication costs low.</div><div>Then, using this variant, which has four synchronization points per block column, we remove the synchronization points one at a time and analyze how each alteration affects the stability of the resulting method. Our analysis shows that the variant requiring only one synchronization per block column, equivalent to a variant previously proposed in the literature, cannot be guaranteed to be stable in practice, as stability begins to degrade with the first reduction of synchronization points. As a negative result, we conclude that this particular block algorithm should be avoided in practice.</div><div>Our analysis of block methods also provides new, more positive theoretical results for the single-column case. In particular, it is proven that DCGS2 from (Bielich et al., 2022 <span><span>[5]</span></span>) and CGS-2 from (Świrydowicz et al., 2021 <span><span>[10]</span></span>) are as stable as Householder QR. Numerical examples from the <span>BlockStab</span> toolbox are included throughout, to help compare variants and illustrate the effects of different choices of intraorthogonalization subroutines.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"732 ","pages":"Pages 162-206"},"PeriodicalIF":1.1,"publicationDate":"2025-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145733920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01DOI: 10.1016/j.laa.2025.11.022
Jean-Christophe Bourin , Eun-Young Lee
Any contraction can be dilated (1) into an involution with operator norm and (2) into a projection with . The bounds and 3 are the smallest possible ones.
{"title":"Dilating contractions into involutions and projections","authors":"Jean-Christophe Bourin , Eun-Young Lee","doi":"10.1016/j.laa.2025.11.022","DOIUrl":"10.1016/j.laa.2025.11.022","url":null,"abstract":"<div><div>Any contraction <span><math><mi>A</mi><mo>∈</mo><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> can be dilated (1) into an involution <span><math><mi>S</mi><mo>∈</mo><msub><mrow><mi>M</mi></mrow><mrow><mn>2</mn><mi>n</mi></mrow></msub></math></span> with operator norm <span><math><msub><mrow><mo>‖</mo><mi>S</mi><mo>‖</mo></mrow><mrow><mo>∞</mo></mrow></msub><mo>≤</mo><mn>1</mn><mo>+</mo><msqrt><mrow><mn>2</mn></mrow></msqrt></math></span> and (2) into a projection <span><math><mi>E</mi><mo>∈</mo><msub><mrow><mi>M</mi></mrow><mrow><mn>2</mn><mi>n</mi></mrow></msub></math></span> with <span><math><msub><mrow><mo>‖</mo><mi>E</mi><mo>‖</mo></mrow><mrow><mo>∞</mo></mrow></msub><mo>≤</mo><mn>3</mn></math></span>. The bounds <span><math><mn>1</mn><mo>+</mo><msqrt><mrow><mn>2</mn></mrow></msqrt></math></span> and 3 are the smallest possible ones.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"732 ","pages":"Pages 26-32"},"PeriodicalIF":1.1,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145682611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-27DOI: 10.1016/j.laa.2025.11.019
Ivan Stanković
For and , let . Considering also as a binary matrix with rows and n columns, let denote the binary rank of . We disprove here the conjecture of Stevanović [Linear Algebra Appl. 311 (2000) 35–44] that the components of NEPS of connected, bipartite graphs are almost cospectral whenever the basis of NEPS satisfies the condition .
{"title":"A note on almost cospectrality of components of NEPS of bipartite graphs","authors":"Ivan Stanković","doi":"10.1016/j.laa.2025.11.019","DOIUrl":"10.1016/j.laa.2025.11.019","url":null,"abstract":"<div><div>For <span><math><mi>B</mi><mo>⊂</mo><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup><mo>−</mo><mo>{</mo><mo>(</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><mn>0</mn><mo>)</mo><mo>}</mo></math></span> and <span><math><mi>S</mi><mo>⊂</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>n</mi><mo>}</mo></math></span>, let <span><math><mrow><mi>Ann</mi></mrow><mo>(</mo><mi>B</mi><mo>,</mo><mi>S</mi><mo>)</mo><mo>=</mo><mo>{</mo><mi>β</mi><mo>∈</mo><mi>B</mi><mo>:</mo><mo>(</mo><mo>∀</mo><mi>i</mi><mo>∈</mo><mi>S</mi><mo>)</mo><msub><mrow><mi>β</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>=</mo><mn>0</mn><mo>}</mo></math></span>. Considering <span><math><mi>B</mi></math></span> also as a binary matrix with <span><math><mo>|</mo><mi>B</mi><mo>|</mo></math></span> rows and <em>n</em> columns, let <span><math><mi>r</mi><mo>(</mo><mi>B</mi><mo>)</mo></math></span> denote the binary rank of <span><math><mi>B</mi></math></span>. We disprove here the conjecture of Stevanović [Linear Algebra Appl. 311 (2000) 35–44] that the components of NEPS of connected, bipartite graphs are almost cospectral whenever the basis <span><math><mi>B</mi></math></span> of NEPS satisfies the condition <span><math><mrow><mi>Ann</mi></mrow><mo>(</mo><mi>B</mi><mo>,</mo><mi>S</mi><mo>)</mo><mo>≠</mo><mo>∅</mo><mspace></mspace><mo>⇒</mo><mspace></mspace><mo>|</mo><mi>S</mi><mo>|</mo><mo>+</mo><mi>r</mi><mo>(</mo><mrow><mi>Ann</mi></mrow><mo>(</mo><mi>B</mi><mo>,</mo><mi>S</mi><mo>)</mo><mo>)</mo><mo>≤</mo><mi>r</mi><mo>(</mo><mi>B</mi><mo>)</mo></math></span>.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"732 ","pages":"Pages 18-25"},"PeriodicalIF":1.1,"publicationDate":"2025-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145682610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}