On the public citation graph

Practical improvement of the divide-and-conquer eigenvalue algorithms

https://doi.org/10.1007/bf02241709
0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01389480openalex-snapshot
Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
inferredcites →https://doi.org/10.1007/bf01396012openalex-snapshot
Rank-one modification of the symmetric eigenproblem
inferredcites →https://doi.org/10.1007/bf01396757openalex-snapshot
A divide and conquer method for the symmetric tridiagonal eigenproblem
inferredcites →https://doi.org/10.1016/0885-064x(87)90022-7openalex-snapshot
On the worst-case arithmetic complexity of approximating zeros of polynomials
inferredcites →https://doi.org/10.1016/0885-064x(90)90032-9openalex-snapshot
Simple algorithms for approximating all roots of a polynomial with real roots
inferredcites →https://doi.org/10.1063/1.4822961openalex-snapshot
Savitzky-Golay Smoothing Filters
inferredcites →https://doi.org/10.1093/imamat/12.2.209openalex-snapshot
Eigenvalues of Symmetric Tridiagonal Matrices: A Fast, Accurate and Reliable Algorithm
inferredcites →https://doi.org/10.1137/0908018openalex-snapshot
A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
inferredcites →https://doi.org/10.1137/0911010openalex-snapshot
An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
inferredcites →https://doi.org/10.1137/1.9781611971163openalex-snapshot
The Symmetric Eigenvalue Problem
inferredcites →https://doi.org/10.2307/2007453openalex-snapshot
The Symmetric Eigenvalue Problem.
inferredcites →https://doi.org/10.5555/127787.127855openalex-snapshot
Parallel complexity of tridiagonal symmetric Eigenvalue problem
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bfb0046705openalex-snapshot
A distributed divide-and-conquer approach to the parallel tridiagonal symmetric eigenvalue problem
inferred← citeshttps://doi.org/10.1007/s002110050035openalex-snapshot
Iteration schemes for the divide-and-conquer eigenvalue solver
inferred← citeshttps://doi.org/10.1016/0893-9659(92)90012-xopenalex-snapshot
Improving the solution of the symmetric eigenvalue problem and an extension
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.12.010openalex-snapshot
Efficient parallel factorization and solution of structured and unstructured linear systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.06.009openalex-snapshot
Nearly optimal refinement of real roots of a univariate polynomial
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.008openalex-snapshot
Computations with quasiseparable polynomials and matrices
inferred← citeshttps://doi.org/10.1023/a:1019146505291openalex-snapshot
Bisection acceleration for the symmetric tridiagonal eigenvalue problem
inferred← citeshttps://doi.org/10.1109/empdp.1998.647173openalex-snapshot
Exploiting the parallel divide-and-conquer method to solve the symmetric tridiagonal eigenproblem
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267780openalex-snapshot
The power of combining the techniques of algebraic and numerical computing: improved approximate multipoint polynomial evaluation and improved multipole algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492469openalex-snapshot
Efficient parallel solution of sparse eigenvalue and eigenvector problems
inferred← citeshttps://doi.org/10.1109/spdp.1994.346126openalex-snapshot
On the convergence of a parallel algorithm for finding polynomial zeros
inferred← citeshttps://doi.org/10.1109/tac.2020.3032496openalex-snapshot
Cooperative Output Regulation of Heterogeneous Multiagent Systems: A Global Distributed Control Synthesis Approach
inferred← citeshttps://doi.org/10.1137/1034049openalex-snapshot
Complexity of Computations with Matrices and Polynomials
inferred← citeshttps://doi.org/10.1137/s0036144595288554openalex-snapshot
Solving a Polynomial Equation: Some History and Recent Progress
inferred← citeshttps://doi.org/10.1137/s0097539790182482openalex-snapshot
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
inferred← citeshttps://doi.org/10.1145/2465506.2465938openalex-snapshot
On the boolean complexity of real root refinement
inferred← citeshttps://doi.org/10.1515/9783110883237.3885openalex-snapshot
Divide and conquer techniques for the polynomial root-finding problem
inferred← citeshttps://doi.org/10.3390/e25081115openalex-snapshot
Centrality Learning: Auralization and Route Fitting
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.