On the public citation graph
An accelerated bisection method for the calculation of eigenvalues of a symmetric tridiagonal matrix
0 signed · 19 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01386333openalex-snapshot
Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection
inferredcites →https://doi.org/10.1007/bf01396441openalex-snapshot
A modified bisection algorithm for the determination of the eigenvalues of a symmetric tridiagonal matrix
inferredcites →https://doi.org/10.1007/bf02162154openalex-snapshot
Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0371062-9openalex-snapshot
Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973)
inferredcites →https://doi.org/10.2172/4412175openalex-snapshot
NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX
inferredcites →https://doi.org/10.2307/2005713openalex-snapshot
Algorithms for Minimization Without Derivatives
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44942-6_30openalex-snapshot
An Efficient Parallel Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
inferred← citeshttps://doi.org/10.1007/3-540-48158-3_47openalex-snapshot
A Parallel Implementation of the Eigenproblem for Large, Symmetric and Sparse Matrices
inferred← citeshttps://doi.org/10.1007/bf02252736openalex-snapshot
Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices
inferred← citeshttps://doi.org/10.1007/s40314-023-02364-0openalex-snapshot
An algorithm for estimating non-convex volumes and other integrals in n dimensions
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90060-kopenalex-snapshot
A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
inferred← citeshttps://doi.org/10.1023/a:1019146505291openalex-snapshot
Bisection acceleration for the symmetric tridiagonal eigenvalue problem
inferred← citeshttps://doi.org/10.1080/01495739808947361openalex-snapshot
PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES∗
inferred← citeshttps://doi.org/10.1137/0909039openalex-snapshot
Optimizing Givens’ Algorithm for Multiprocessors
inferred← citeshttps://doi.org/10.1137/0911013openalex-snapshot
Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
inferred← citeshttps://doi.org/10.2316/journal.202.2004.4.204-0447openalex-snapshot
Solving Eigenproblems on Multicomputers: Two Different Approaches
inferred← citeshttps://doi.org/10.26512/2014.11.d.18268openalex-snapshot
Aceleração do cálculo de autovalores usando CUDA : uma aplicação em heteroestruturas semicondutoras
inferred← citeshttps://doi.org/10.3390/math10152782openalex-snapshot
A Novel Divisional Bisection Method for the Symmetric Tridiagonal Eigenvalue Problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.