Spectral properties for a type of heptadiagonal symmetric matrices
Pith reviewed 2026-05-24 20:47 UTC · model grok-4.3
The pith
Certain heptadiagonal symmetric matrices have eigenvalues that are the zeros of explicit rational functions.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The eigenvalues of the matrices under consideration are the zeros of certain explicit rational functions. These expressions yield bounds for the eigenvalues and permit the direct calculation of eigenvectors. Formulas independent of any unknown parameter are obtained for the determinant and the inverse of the heptadiagonal matrices.
What carries the argument
Explicit rational functions obtained from the characteristic polynomials of the heptadiagonal symmetric matrices, whose zeros locate the eigenvalues.
Load-bearing premise
The matrices follow a specific pattern of entries that makes their characteristic polynomials reducible to the stated rational functions.
What would settle it
Finding a matrix in the class whose eigenvalues do not coincide with the zeros of the given rational functions would disprove the expressions.
read the original abstract
In this paper we express the eigenvalues of a sort of real heptadiagonal symmetric matrices as the zeros of explicit rational functions establishing upper and lower bounds for each of them. From these prescribed eigenvalues we compute also eigenvectors for these type of matrices. A formula not depending on any unknown parameter for the determinant and the inverse of these heptadiagonal matrices is still provided.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript considers a specific subclass of real symmetric heptadiagonal matrices having constant entries along each of the seven diagonals. It derives the characteristic polynomial via a third-order linear recurrence, expresses the eigenvalues as the zeros of explicit rational functions, establishes upper and lower bounds for each eigenvalue, reconstructs the corresponding eigenvectors, and supplies closed-form, parameter-free expressions for the determinant and the inverse.
Significance. If the derivations hold, the explicit rational-function representation of the characteristic polynomial together with the parameter-free determinant and inverse formulas constitute a useful contribution to the spectral theory of structured banded matrices. The recurrence-based approach that yields both root bounds and eigenvector formulas is a clear methodological strength.
minor comments (4)
- [Introduction] The abstract and opening paragraph repeatedly use the vague qualifier “a sort of”; the precise entry pattern (constant values on each diagonal) should be stated explicitly in the first paragraph of the introduction.
- [§3] Equation (3.4) defines the rational function whose roots are claimed to be the eigenvalues, but the recurrence coefficients are introduced only in §2; an immediate cross-reference would prevent the reader from having to search backward.
- [§4] The eigenvector construction in §4 is given in component form; a short numerical example verifying that the constructed vector indeed lies in the null space of (A−λI) would make the claim more concrete.
- [§2] Notation for the three recurrence sequences (p_n, q_n, r_n) is introduced without a consolidated table; a small notation summary at the end of §2 would improve readability.
Simulated Author's Rebuttal
We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No specific major comments appear in the report.
Circularity Check
No significant circularity
full rationale
The paper restricts to heptadiagonal symmetric matrices with constant entries on each of the seven diagonals. It obtains the characteristic polynomial by solving the standard third-order linear recurrence that arises from the three-term (actually seven-band) determinant expansion; the closed-form solution is an explicit rational function whose roots are the eigenvalues. Bounds follow from sign changes or Sturm comparison on that rational function, eigenvectors are recovered directly from the nullspace of (A-λI), and the determinant/inverse formulas are obtained by evaluating the same recurrence at λ=0 or by Cramer's rule on the recurrence. None of these steps is self-definitional, none renames a fitted quantity as a prediction, and no load-bearing claim rests on a self-citation. The derivation is algebraically self-contained within the stated matrix class.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
J. Anderson, A secular equation for the eigenvalues of a diagona l matrix perturbation, Linear Algebra Appl. 246 (1996) 49–70
work page 1996
-
[2]
Asplund, Finite boundary value problems solved by Green’s mat rix, Math
S.O. Asplund, Finite boundary value problems solved by Green’s mat rix, Math. Scand. 7 (1959) 49–56
work page 1959
-
[3]
D. Bini and M. Capovani, Spectral and computational propertie s of band symmetric Toeplitz matrices, Linear Algebra Appl. 52/53 (1983) 99–126
work page 1983
-
[4]
J.R. Bunch, C.P. Nielsen, D.C. Sorensen, Rank-one modification of the symmetric eigen- problem, Numer. Math. 31 (1978) 31–48
work page 1978
-
[5]
Demko, Inverses of band matrices and local convergence of spline projections, SIAM J
S. Demko, Inverses of band matrices and local convergence of spline projections, SIAM J. Numer. Anal. 14(4) (1977) 616–619
work page 1977
-
[6]
D. Fasino, Spectral and structural properties of some penta diagonal symmetric matrices, Calcolo 25(4) (1988) 301–310
work page 1988
-
[7]
C.F. Fischer and R.A. Usmani, Properties of some tridiagonal matr ices and their application to boundary value problems, SIAM J. Numer. Anal. 6(1) (1969) 127 –142
work page 1969
-
[8]
Haley, Solution of band matrix equations by projection-recur rence, Linear Algebra Appl
S. Haley, Solution of band matrix equations by projection-recur rence, Linear Algebra Appl. 32 (1980) 33–48
work page 1980
-
[9]
Harville, Matrix Algebra From a Statistician’s Perspective, Spr inger-Verlag, 1997
D.A. Harville, Matrix Algebra From a Statistician’s Perspective, Spr inger-Verlag, 1997
work page 1997
- [10]
-
[11]
A.J. Keeping, Band matrices arising from finite difference approx imations to a third order partial differential, SIAM J. Numer. Anal. 7(1) (1970) 142–156
work page 1970
-
[12]
Miller, On the inverse of the sum of matrices, Math
K.S. Miller, On the inverse of the sum of matrices, Math. Mag. 54( 2) (1981) 67–72
work page 1981
-
[13]
Pissanetsky, Sparse Matrix Technology, Academic Press, 1 984
S. Pissanetsky, Sparse Matrix Technology, Academic Press, 1 984
-
[14]
R.A. Usmani, T.H. Andres, D.J. Walton, Error estimation in the inte gration of ordinary differential equations, Int. J. Comput. Math. 5 (1976) 241–256. 18
work page 1976
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.