On the public citation graph
RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
0 signed · 83 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/3-540-08254-9openalex-snapshot
Matrix Eigensystem Routines — EISPACK Guide Extension
inferredcites →https://doi.org/10.1007/bf01389653openalex-snapshot
Computing the CS and the generalized singular value decompositions
inferredcites →https://doi.org/10.1007/bf01390177openalex-snapshot
AB-Algorithm and its modifications for the spectral problems of linear pencils of matrices
inferredcites →https://doi.org/10.1007/bf01396447openalex-snapshot
Computing theCS decomposition of a partitioned orthonormal matrix
inferredcites →https://doi.org/10.1007/bf01934915openalex-snapshot
The generalized singular value decomposition and the general (A-λB)-problem
inferredcites →https://doi.org/10.1007/bfb0062092openalex-snapshot
An approach to solving the spectral problem of A-λB
inferredcites →https://doi.org/10.1007/bfb0062093openalex-snapshot
On computing the Kronecker canonical form of regular (A-λB)-pencils
inferredcites →https://doi.org/10.1007/bfb0062094openalex-snapshot
Reducing subspaces: Definitions, properties and algorithms
inferredcites →https://doi.org/10.1007/bfb0062104openalex-snapshot
A method for computing the generalized singular value decomposition
inferredcites →https://doi.org/10.1007/bfb0062105openalex-snapshot
Perturbation analysis for the generalized eigenvalue and the generalized singular value problem
inferredcites →https://doi.org/10.1016/0024-3795(79)90035-1openalex-snapshot
The computation of Kronecker's canonical form of a singular pencil
inferredcites →https://doi.org/10.1016/0024-3795(79)90140-xopenalex-snapshot
Kronecker's canonical form and the QZ algorithm
inferredcites →https://doi.org/10.1016/0024-3795(82)90119-7openalex-snapshot
A note on Stewart's theorem for definite matrix pairs
inferredcites →https://doi.org/10.1016/0024-3795(82)90120-3openalex-snapshot
Perturbation thèorems for the generalized eigenvalue problem
inferredcites →https://doi.org/10.1016/0041-5553(66)90001-2openalex-snapshot
On a method of solving the complete eigenvalue problem for a degenerate matrix
inferredcites →https://doi.org/10.1016/b978-0-12-208360-0.50015-2openalex-snapshot
Perturbation Theory for the Generalized Eigenvalue Problem
inferredcites →https://doi.org/10.1016/b978-0-12-208360-0.50017-6openalex-snapshot
Linear Differential Equations and Kronecker's Canonical Form
inferredcites →https://doi.org/10.1109/tac.1981.1102559openalex-snapshot
The generalized eigenstructure problem in linear system theory
inferredcites →https://doi.org/10.1137/0707001openalex-snapshot
The Rotation of Eigenvectors by a Perturbation. III
inferredcites →https://doi.org/10.1137/0710024openalex-snapshot
An Algorithm for Generalized Matrix Eigenvalue Problems
inferredcites →https://doi.org/10.1137/0712061openalex-snapshot
A General Matrix Eigenvalue Algorithm
inferredcites →https://doi.org/10.1137/0713009openalex-snapshot
Generalizing the Singular Value Decomposition
inferredcites →https://doi.org/10.1137/0718026openalex-snapshot
Towards a Generalized Singular Value Decomposition
inferredcites →https://doi.org/10.1137/0720040openalex-snapshot
The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
inferredcites →https://doi.org/10.1137/0720041openalex-snapshot
Perturbation Analysis for the Generalized Singular Value Problem
inferredcites →https://doi.org/10.1137/0721013openalex-snapshot
A Note on a Result of Sun Ji-Guang: Sensitivity of the CS and GSV Decompositions
inferredcites →https://doi.org/10.1137/1015095openalex-snapshot
Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
inferredcites →https://doi.org/10.1137/1018113openalex-snapshot
Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
inferredcites →https://doi.org/10.1145/355900.355912openalex-snapshot
An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
inferredcites →https://doi.org/10.1145/355900.355917openalex-snapshot
Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2]
inferredcites →https://doi.org/10.1145/356012.356017openalex-snapshot
Algorithm 590: DSUBSP and EXCHQZ : FORTRAN Subroutines for Computing Deflating Subspaces with Specified Spectrum
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.253openalex-snapshot
Computation and presentation of graphs displaying closure hierarchies of Jordan and Kronecker structures
inferred← citeshttps://doi.org/10.1002/nla.367openalex-snapshot
On the computation of the infimum in H∞‐optimization
inferred← citeshttps://doi.org/10.1006/jsco.1998.0236openalex-snapshot
Computing the Isolated Roots by Matrix Methods
inferred← citeshttps://doi.org/10.1007/11496915_25openalex-snapshot
Combinatorial Analysis of Generic Matrix Pencils
inferred← citeshttps://doi.org/10.1007/978-3-319-22428-2_3openalex-snapshot
Numerical Linear Algebra Methods for Linear Differential-Algebraic Equations
inferred← citeshttps://doi.org/10.1007/bf01091803openalex-snapshot
Construction of a fundamental series of solutions of a pencil of matrices
inferred← citeshttps://doi.org/10.1007/bf02140690openalex-snapshot
Proper deflating subspaces: properties, algorithms and applications
inferred← citeshttps://doi.org/10.1007/bf02168360openalex-snapshot
Methods and algorithms of solving spectral problems for polynomial and rational matrices
inferred← citeshttps://doi.org/10.1007/s10444-020-09752-8openalex-snapshot
Preserving the DAE structure in the Loewner model reduction and identification framework
inferred← citeshttps://doi.org/10.1007/s10958-012-0791-6openalex-snapshot
To solving the eigenvalue problem for polynomial matrices of general form
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90108-xopenalex-snapshot
Computing stable eigendecompositions of matrix pencils
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90003-1openalex-snapshot
An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00362-4openalex-snapshot
The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
inferred← citeshttps://doi.org/10.1016/0024-3795(94)90403-0openalex-snapshot
A new look at pencils of matrix valued functions
inferred← citeshttps://doi.org/10.1016/0167-6911(87)90042-9openalex-snapshot
Computing rank-deficiency of rectangular matrix pencils
inferred← citeshttps://doi.org/10.1016/0377-0427(89)90044-7openalex-snapshot
Dynamic iteration methods applied to linear DAE systems
inferred← citeshttps://doi.org/10.1016/b978-0-444-50617-7.50010-0openalex-snapshot
Eigenvalue computation in the 20th century
inferred← citeshttps://doi.org/10.1016/j.laa.2009.06.039openalex-snapshot
Zero cancellation for general rational matrix functions
inferred← citeshttps://doi.org/10.1016/j.laa.2011.11.020openalex-snapshot
Pencils with prescribed constant subpencils
inferred← citeshttps://doi.org/10.1016/j.ymssp.2021.107896openalex-snapshot
Random vibration of linear systems with singular matrices based on Kronecker canonical forms of matrix pencils
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10122-2openalex-snapshot
Where is the nearest non-regular pencil?
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00413-1openalex-snapshot
Eigenvalue computation in the 20th century
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)37423-2openalex-snapshot
Order of Residual Generators - Bounds and Algorithms
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)49242-1openalex-snapshot
The Constrained Continuous Time Algebraic Riccati Equation
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)54269-xopenalex-snapshot
Computation of Zeros of Generalized State-Space Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)56228-xopenalex-snapshot
Non-linear bounds for the generalized eigensystem of a matrix pencil with distinct eigenvalues
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)08003-1openalex-snapshot
Computational methods for large eigenvalue problems
inferred← citeshttps://doi.org/10.1023/a:1019153528915openalex-snapshot
Extracting partial canonical structure for large scale eigenvalue problems
inferred← citeshttps://doi.org/10.1023/a:1022498301583openalex-snapshot
Bounds for the Distance Between Nearby Jordan and Kronecker Structures in a Closure Hierarchy
inferred← citeshttps://doi.org/10.1093/imamci/dnz031openalex-snapshot
On the Kronecker canonical form of a full row rank matrix pencil and applications
inferred← citeshttps://doi.org/10.1109/9.280787openalex-snapshot
Spectral and inner-outer factorizations through the constrained Riccati equation
inferred← citeshttps://doi.org/10.1109/tac.2002.804484openalex-snapshot
On the numerical computation of a structural decomposition in systems and control
inferred← citeshttps://doi.org/10.1109/tac.2010.2098550openalex-snapshot
Computation of the General $(J,J^{\prime})$-Lossless Factorization
inferred← citeshttps://doi.org/10.1137/0609010openalex-snapshot
Accurate Solutions of Ill-Posed Problems in control theory
inferred← citeshttps://doi.org/10.1137/0611046openalex-snapshot
Estimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates
inferred← citeshttps://doi.org/10.1137/0614017openalex-snapshot
Bounds on Perturbations of Generalized Singular Values and of Associated Subspaces
inferred← citeshttps://doi.org/10.1137/100783315openalex-snapshot
On the Kronecker Canonical Form of Mixed Matrix Pencils
inferred← citeshttps://doi.org/10.1137/100819321openalex-snapshot
Feedback Properties of Descriptor Systems Using Matrix Projectors and Applications to Descriptor Differential Games
inferred← citeshttps://doi.org/10.1137/16m1057516openalex-snapshot
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
inferred← citeshttps://doi.org/10.1137/16m1060406openalex-snapshot
Rank Decisions in Matrix Quotient Decompositions
inferred← citeshttps://doi.org/10.1137/17m111794xopenalex-snapshot
Index Reduction via Unimodular Transformations
inferred← citeshttps://doi.org/10.1137/s0363012994269818openalex-snapshot
Descriptor Systems Without Controllability at Infinity
inferred← citeshttps://doi.org/10.1137/s0895479801384585openalex-snapshot
The Multishift QR Algorithm. Part II: Aggressive Early Deflation
inferred← citeshttps://doi.org/10.1137/s0895479803428795openalex-snapshot
The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach
inferred← citeshttps://doi.org/10.1137/s0895479804442450openalex-snapshot
Combinatorial Analysis of Singular Matrix Pencils
inferred← citeshttps://doi.org/10.1137/s0895479894260900openalex-snapshot
The Set of 2-by-3 Matrix Pencils — Kronecker Structures and Their Transitions under Perturbations
inferred← citeshttps://doi.org/10.1137/s0895479895284634openalex-snapshot
A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
inferred← citeshttps://doi.org/10.1137/s0895479896310184openalex-snapshot
A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part II: A Stratification-Enhanced Staircase Algorithm
inferred← citeshttps://doi.org/10.1137/s089547989833574xopenalex-snapshot
Staircase Failures Explained by Orthogonal Versal Forms
inferred← citeshttps://doi.org/10.1145/152613.152615openalex-snapshot
The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
inferred← citeshttps://doi.org/10.1145/152613.152616openalex-snapshot
The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
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.