On the public citation graph
Note on matrices with a very ill-conditioned eigenproblem
0 signed · 75 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/978-3-642-86934-1openalex-snapshot
Handbook for Automatic Computation
inferredcites →https://doi.org/10.1007/978-3-642-86940-2openalex-snapshot
Handbook for Automatic Computation
inferredcites →https://doi.org/10.1007/bf02165404openalex-snapshot
Balancing a matrix for calculation of eigenvalues and eigenvectors
inferredcites →https://doi.org/10.1007/bf02165660openalex-snapshot
Properties of a matrix with a very ill-conditioned eigenproblem
inferredcites →https://doi.org/10.2307/2005673openalex-snapshot
Handbook for Automatic Computation. Vol II, Linear Algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcta.1997.2780openalex-snapshot
Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-14788-3_12openalex-snapshot
Distance Evaluation to the Set of Matrices with Multiple Eigenvalues
inferred← citeshttps://doi.org/10.1007/978-3-031-41724-5_14openalex-snapshot
On the Distance to the Nearest Defective Matrix
inferred← citeshttps://doi.org/10.1007/978-3-319-49182-0_25openalex-snapshot
Error Estimates for the ESPRIT Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-19-3898-6_3openalex-snapshot
Variational Analysis of Approximate Defective Eigenvalues
inferred← citeshttps://doi.org/10.1007/978-981-99-2310-6_13openalex-snapshot
On Nearest Matrix with Partially Specified Eigen-Structure
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf01385508openalex-snapshot
On condition numbers of a nondefective multiple eigenvalue
inferred← citeshttps://doi.org/10.1007/bf01389751openalex-snapshot
On neighbouring matrices with quadratic elementary divisors
inferred← citeshttps://doi.org/10.1007/bf01396310openalex-snapshot
Realistic error bounds for a simple eigenvalue and its associated eigenvector
inferred← citeshttps://doi.org/10.1007/bf01400115openalex-snapshot
On condition numbers and the distance to the nearest ill-posed problem
inferred← citeshttps://doi.org/10.1007/bfb0062091openalex-snapshot
The condition number of equivalence transformations that block diagonalize matrix pencils
inferred← citeshttps://doi.org/10.1007/s00211-010-0326-3openalex-snapshot
Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity
inferred← citeshttps://doi.org/10.1007/s002110050458openalex-snapshot
A formula for the 2-norm distance from a matrix to the set of matrices with multiple eigenvalues
inferred← citeshttps://doi.org/10.1007/s10208-013-9185-5openalex-snapshot
Complexity of Path-Following Methods for the Eigenvalue Problem
inferred← citeshttps://doi.org/10.1007/s12206-024-0729-1openalex-snapshot
A Newton method with characteristic value correction for geometric error calibration of parallel mechanism
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90298-3openalex-snapshot
Computing stable eigendecompositions of matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90131-5openalex-snapshot
On estimating the condition of eigenvalues and eigenvectors
inferred← citeshttps://doi.org/10.1016/0885-064x(87)90027-6openalex-snapshot
The geometry of III-conditioning
inferred← citeshttps://doi.org/10.1016/1385-7258(86)90024-7openalex-snapshot
On the local structure of recursion operators for symmetries
inferred← citeshttps://doi.org/10.1016/j.aam.2011.07.001openalex-snapshot
A numerical algorithm for zero counting. III: Randomization and condition
inferred← citeshttps://doi.org/10.1016/j.amc.2010.02.011openalex-snapshot
On condition numbers of polynomial eigenvalue problems
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126671openalex-snapshot
The verification of multiplicity support of a defective eigenvalue of a real matrix
inferred← citeshttps://doi.org/10.1016/j.cam.2015.11.031openalex-snapshot
Nearest matrix with prescribed eigenvalues and its applications
inferred← citeshttps://doi.org/10.1016/j.crma.2006.05.014openalex-snapshot
General formulas for the smoothed analysis of condition numbers
inferred← citeshttps://doi.org/10.1016/j.jco.2010.01.003openalex-snapshot
Stochastic perturbations and smooth condition numbers
inferred← citeshttps://doi.org/10.1016/j.laa.2004.10.013openalex-snapshot
On sensitivity of eigenvalues and eigendecompositions of matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2008.04.005openalex-snapshot
The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
inferred← citeshttps://doi.org/10.1016/j.laa.2008.07.006openalex-snapshot
Additive preconditioning, eigenspaces, and the inverse iteration
inferred← citeshttps://doi.org/10.1016/j.laa.2008.10.019openalex-snapshot
Pseudospectra, critical points and multiple eigenvalues of matrix polynomials
inferred← citeshttps://doi.org/10.1016/j.laa.2012.01.003openalex-snapshot
Distance bounds for prescribed multiple eigenvalues of matrix polynomials
inferred← citeshttps://doi.org/10.1016/j.laa.2014.10.010openalex-snapshot
Matrix polynomials with specified eigenvalues
inferred← citeshttps://doi.org/10.1016/j.laa.2018.01.010openalex-snapshot
On the distance from a matrix polynomial to matrix polynomials with some prescribed eigenvalues
inferred← citeshttps://doi.org/10.1016/j.matpur.2006.06.001openalex-snapshot
Smoothed analysis of complex conic condition numbers
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00089-0openalex-snapshot
Nearly defective complex eigenvalues in Bessel matrices
inferred← citeshttps://doi.org/10.1016/s0393-0440(97)00077-6openalex-snapshot
Compatibility of symplectic structures adapted to noncommutatively integrable systems
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80203-8openalex-snapshot
Chapter 6 A survey of matrix computations
inferred← citeshttps://doi.org/10.1017/cbo9781139107068.002openalex-snapshot
Smoothed Analysis of Condition Numbers
inferred← citeshttps://doi.org/10.1080/01630568908816301openalex-snapshot
Iterative refinement for defective subspaces of differential operators
inferred← citeshttps://doi.org/10.1080/03081087.2016.1202181openalex-snapshot
On the distance from a matrix polynomial to matrix polynomials with k prescribed distinct eigenvalues
inferred← citeshttps://doi.org/10.1080/03081087.2021.1981809openalex-snapshot
Nearest linearly structured polynomial matrix with some prescribed distinct eigenvalues
inferred← citeshttps://doi.org/10.1090/conm/700/14186openalex-snapshot
Finite element methods for variational eigenvalue problems
inferred← citeshttps://doi.org/10.1090/mcom/3706openalex-snapshot
How well-conditioned can the eigenvector problem be?
inferred← citeshttps://doi.org/10.1090/s0025-5718-08-02060-7openalex-snapshot
The probability that a slightly perturbed numerical analysis problem is difficult
inferred← citeshttps://doi.org/10.1090/s0025-5718-1988-0929546-7openalex-snapshot
The Probability That a Numerical Analysis Problem is Difficult
inferred← citeshttps://doi.org/10.1093/imanum/drz026openalex-snapshot
On the average condition number of tensor rank decompositions
inferred← citeshttps://doi.org/10.1109/cdc.2014.7040394openalex-snapshot
Nearest singular descriptor system having impulsive initial-conditions
inferred← citeshttps://doi.org/10.1109/ijcnn.1998.686020openalex-snapshot
Non-suspiciousness: a generalisation of convexity in the frame of foundations of numerical analysis and learning
inferred← citeshttps://doi.org/10.1109/tsp.2015.2510970openalex-snapshot
Techniques for Generating Analytic Covariance Expressions for Eigenvalues and Eigenvectors
inferred← citeshttps://doi.org/10.1117/1.jrs.17.034507openalex-snapshot
Settlement monitoring data fusion approach for high-speed railways based on GNSS and InSAR
inferred← citeshttps://doi.org/10.1137/0720040openalex-snapshot
The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
inferred← citeshttps://doi.org/10.1137/0733008openalex-snapshot
Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
inferred← citeshttps://doi.org/10.1137/1018113openalex-snapshot
Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
inferred← citeshttps://doi.org/10.1137/130933472openalex-snapshot
Numerical Optimization of Eigenvalues of Hermitian Matrix Functions
inferred← citeshttps://doi.org/10.1137/17m1153236openalex-snapshot
Sensitivity Analysis of Nonlinear Eigenproblems
inferred← citeshttps://doi.org/10.1137/s0036144596300773openalex-snapshot
Computing an Eigenvector with Inverse Iteration
inferred← citeshttps://doi.org/10.1145/355900.355912openalex-snapshot
An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
inferred← citeshttps://doi.org/10.12677/aam.2020.911228openalex-snapshot
The Verification of the Nearest Defective Matrix
inferred← citeshttps://doi.org/10.13001/1081-3810.2921openalex-snapshot
On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
inferred← citeshttps://doi.org/10.2514/3.20424openalex-snapshot
Measures of modal controllability and observability for first- and second-order linear systems
inferred← citeshttps://doi.org/10.33915/etd.6095openalex-snapshot
Covariance expressions for eigenvalue and eigenvector problems
inferred← citeshttps://doi.org/10.3847/2515-5172/ac00c2openalex-snapshot
A Data-driven Approach to X-Ray Spectral Fitting: Quasi-deconvolution
inferred← citeshttps://doi.org/10.4236/alamt.2018.81007openalex-snapshot
The Significance of Solutions Obtained from Ill-Posed Systems of Linear Equations Constituted by Synchrotron Radiation Based Anomalous Small-Angle X-Ray Scattering
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2828openalex-snapshot
Complexity of Path-Following Methods for the Eigenvalue Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2093openalex-snapshot
On the distance from a matrix polynomial to matrix polynomials with $k$ prescribed distinct eigenvalues
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605635openalex-snapshot
Smoothed analysis of complex conic condition numbers
inferred← citeshttps://doi.org/10.5860/choice.51-6222openalex-snapshot
Condition: the geometry of numerical algorithms
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.