On the public citation graph

Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials

0 signed · 42 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/978-3-0348-0606-0openalex-snapshot
Separable Type Representations of Matrices and Fast Algorithms
inferredcites →https://doi.org/10.1007/s00211-018-0969-zopenalex-snapshot
Block Kronecker linearizations of matrix polynomials and their backward errors
inferredcites →https://doi.org/10.1007/s10543-012-0381-5openalex-snapshot
Chebyshev interpolation for nonlinear eigenvalue problems
inferredcites →https://doi.org/10.1007/s11075-012-9579-5openalex-snapshot
An algorithm for computing the eigenvalues of block companion matrices
inferredcites →https://doi.org/10.1016/c2013-0-01959-7openalex-snapshot
Lambda-Matrices and Vibrating Systems
inferredcites →https://doi.org/10.1016/j.laa.2013.02.024openalex-snapshot
Solving polynomial eigenvalue problems by means of the Ehrlich–Aberth method
inferredcites →https://doi.org/10.1016/j.laa.2015.05.029openalex-snapshot
Designing rational filter functions for solving eigenvalue problems by contour integration
inferredcites →https://doi.org/10.1016/s0024-3795(99)00063-4openalex-snapshot
Backward error and condition of polynomial eigenvalue problems
inferredcites →https://doi.org/10.1023/a:1021966001542openalex-snapshot
Perturbation Analysis for the Eigenvalue Problem of a Formal Product of Matrices
inferredcites →https://doi.org/10.1090/conm/658/13137openalex-snapshot
A note on companion pencils
inferredcites →https://doi.org/10.1090/s0025-5718-1995-1262279-2openalex-snapshot
Polynomial Roots from Companion Matrix Eigenvalues
inferredcites →https://doi.org/10.1093/comjnl/4.3.265openalex-snapshot
The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
inferredcites →https://doi.org/10.1093/comjnl/4.4.332openalex-snapshot
The QR Transformation--Part 2
inferredcites →https://doi.org/10.1117/12.130915openalex-snapshot
Periodic Schur decomposition: algorithms and applications
inferredcites →https://doi.org/10.1137/050628283openalex-snapshot
The Conditioning of Linearizations of Matrix Polynomials
inferredcites →https://doi.org/10.1137/050628350openalex-snapshot
Vector Spaces of Linearizations for Matrix Polynomials
inferredcites →https://doi.org/10.1137/050628362openalex-snapshot
Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
inferredcites →https://doi.org/10.1137/0710024openalex-snapshot
An Algorithm for Generalized Matrix Eigenvalue Problems
inferredcites →https://doi.org/10.1137/1.9780898718027openalex-snapshot
Accuracy and Stability of Numerical Algorithms
inferredcites →https://doi.org/10.1137/100809167openalex-snapshot
Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm
inferredcites →https://doi.org/10.1137/130935665openalex-snapshot
On Deflations in Extended QR Algorithms
inferredcites →https://doi.org/10.1137/140983434openalex-snapshot
Fast and Backward Stable Computation of Roots of Polynomials
inferredcites →https://doi.org/10.1137/s0036144504443110openalex-snapshot
Product Eigenvalue Problems
inferredcites →https://doi.org/10.1137/s0895479895284804openalex-snapshot
On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
inferredcites →https://doi.org/10.1145/2427023.2427024openalex-snapshot
NLEVP
inferredcites →https://doi.org/10.48550/arxiv.1703.08767openalex-snapshot
On the application of Laguerre's method to the polynomial eigenvalue problem
inferredcites →https://doi.org/10.5860/choice.34-0981openalex-snapshot
Accuracy and stability of numerical algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nla.2261openalex-snapshot
Nonsingular systems of generalized Sylvester equations: An algorithmic approach
inferred← citeshttps://doi.org/10.1002/nla.2266openalex-snapshot
When is a matrix unitary or Hermitian plus low rank?
inferred← citeshttps://doi.org/10.1007/978-3-030-04088-8_7openalex-snapshot
Factoring Block Fiedler Companion Matrices
inferred← citeshttps://doi.org/10.1007/s00211-019-01080-4openalex-snapshot
Fast QR iterations for unitary plus low rank matrices
inferred← citeshttps://doi.org/10.1007/s10013-020-00408-0openalex-snapshot
Pole-Swapping Algorithms for Alternating and Palindromic Eigenvalue Problems
inferred← citeshttps://doi.org/10.1007/s10543-023-01006-5openalex-snapshot
On the stability radius for linear time-delay systems
inferred← citeshttps://doi.org/10.1007/s10915-022-01777-zopenalex-snapshot
Orthogonal Iterations on Companion-Like Pencils
inferred← citeshttps://doi.org/10.1007/s13398-019-00760-yopenalex-snapshot
A note on generalized companion pencils in the monomial basis
inferred← citeshttps://doi.org/10.1109/tac.2025.3545711openalex-snapshot
Achieving Local Consensus Over Compact Submanifolds
inferred← citeshttps://doi.org/10.1109/tim.2026.3736162openalex-snapshot
Root-ESPRIT: A Unified Polynomial Rooting Framework for Rotational Invariant DoA Estimation
inferred← citeshttps://doi.org/10.1137/19m1280363openalex-snapshot
Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form
inferred← citeshttps://doi.org/10.1137/20m1375115openalex-snapshot
Rank-Structured QR for Chebyshev Rootfinding
inferred← citeshttps://doi.org/10.1553/etna_vol52s480openalex-snapshot
On pole-swapping algorithms for the eigenvalue problem
inferred← citeshttps://doi.org/10.48550/arxiv.1808.04012openalex-snapshot
A note on eigenvector error bounds for polynomial eigenvalue problems
inferred← citeshttps://doi.org/10.48550/arxiv.2104.10946openalex-snapshot
Orthogonal iterations on Structured Pencils
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.