Demo Data from VLDB 2026 / reviewers in the wild / expert
Andrew D. Hall Jr.
dblp:93/5833
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1975
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › numerical linear algebra › eigenvalue computation
eigenvalue approximation |
0.0 | 1 | 1975 | Solving a Problem in Eigenvalue Approximation with a Symbolic Algebra System · SIAM J. Comput. 1975 |
Computational science and engineering
symbolic computation |
0.0 | 1 | 1975 | Solving a Problem in Eigenvalue Approximation with a Symbolic Algebra System · SIAM J. Comput. 1975 |
Methods — techniques the papers use, named apart from their topics
taylor series expansion · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1975 | Solving a Problem in Eigenvalue Approximation with a Symbolic Algebra SystemabstractIn a recent paper by R. A. Handelsman and J. S. Lew [1], it is shown that for a certain family of potentials, the eigenvalues of the one-dimensional time-independent Schrödinger equation are proportional to $u(x,y)^{ - 2} $ with u determined by $u^{1/\beta } = f(xu,yu^{2/\beta })$, where $f(x,y) = \sum_{r = 0}^\infty \sum_{s = 0}^\infty f_{rs} x^s y^r $. Both $\beta $ and the $f_{rs} $ are known constants, with $f_{00} = 1$. In [2], Lew proposed that a system for symbolic algebra be used to compute the Taylor series expansion for $u(x,y)$, although in [1] what is desired is the expansion of $c(x,y) = u(x,y)^{ - 2} $. To illustrate how such a system can be used to solve this and similar problems, three solution methods are described and corresponding programs given. During the attempt to put the output resulting from these programs into a form similar to that given by Lew [1], the general solution was found. We give this solution here but defer the proof to another paper [3]. Andrew D. Hall Jr. |
SIAM J. Comput. | 1 |