Cited by 223Matrix Theory and AlgorithmsSpectral Theory in Mathematical PhysicsNumerical methods in inverse problems

A survey of matrix inverse eigenvalue problems

Open access
Boley, D, Golub, G H·1987·Inverse Problems

Abstract

The authors present a survey of some recent results regarding direct methods for solving certain symmetric inverse eigenvalue problems. The problems they discuss are those of generating a symmetric matrix either Jacobi, banded, or some variation thereof, given only some information on the eigenvalues of the matrix itself and some of its principal submatrices. Much of the motivation for the problems discussed came about from an interest in the inverse Sturm-Liouville problem.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/0266-5611/3/4/010

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Given an eigenvalue spectrum satisfying Eq. (5), the corresponding coupling constants can be uniquely determined.

    “Given an eigenvalue spectrum { E k } satisfying Eq. (5), the corresponding coupling constants { ω j , λ j } can be uniquely determined.”
  • The eigenvalues of the Hamiltonian must be non-degenerate.

    “The eigenvalues, which must be non-degenerate [25], and the corresponding eigenvectors are denoted by E k and | e k 〉 respectively.”
  • The eigenvector |e_k> has exactly k-1 sign changes in the position basis.

    “On the other hand, it is known [25] that the eigenvector | e k 〉 has exactly k -1 sign changes in the position basis {| j 〉} .”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. Lin. Alg. Appl. 21 245-60 York: McGraw Hill) Comput. 35 79-84 eigenvalue problems SIAM J. Num. Anal. 24 634-67 Appl. Math. 38 169-74
  2. Golub G H and Van Loan C 1983 Matrix Computations (Baltimore: Johns Hopkins University Press)
  3. Rutishauser H 1963 On Jacobi rotation patterns; Experimental Arithmetic, High Speed Computing and Mathematics, Proc. Symp. Appl. Math. 15 (American Mathematics Society) pp 2 19-39
  4. Smith B T, Boyle J M, Ikebe Y, Klema V C and Moler C B 1970 Matrix Eigenvalue Routines, EISPACK Guide 2nd edn (New York: Springer)

Cited by

Sorted by citations

Authors
Boley, D., & Golub, G. H.
Affiliations
University of Minnesota (US)
Venue
Inverse Problems
Published
1987-11-01
Volume
3
Issue
4
Pages
595-622
ISSN
  • 0266-5611 (ISSN-L)
  • 1361-6420
OpenAlex
W1970376871
Cited by
223
References
21
Citations by year
2026: 3 · 2025: 2 · 2024: 4 · 2023: 6 · 2022: 5 · 2021: 5 · 2020: 5 · 2019: 7 · 2018: 4 · 2017: 3 · 2016: 5 · 2015: 9 · 2014: 10 · 2013: 12 · 2012: 4
FWCI
1.39
Type
journal article
Language
en
Open access
Locations
Inverse Problems (publishedVersion)
Funders
National Science Foundation
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Mathematics › Mathematical Physics › Spectral Theory in Mathematical Physics
  • Physical Sciences › Mathematics › Mathematical Physics › Numerical methods in inverse problems
Keywords
symmetric matrices, direct method, Jacobi matrices, banded matrices, eigenvalues, principal submatrices, inverse Sturm-Liouville problem

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review