On the public citation graph
A general module theoretic framework for vector M-Padé and matrix rational interpolation
0 signed · 66 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-1-4612-6392-0openalex-snapshot
Linear Multivariable Systems
inferredcites →https://doi.org/10.1007/bf02142327openalex-snapshot
The computation of non-perfect Padé-Hermite approximants
inferredcites →https://doi.org/10.1016/0377-0427(90)90056-6openalex-snapshot
A new approach to the rational interpolation problem: the vector case
inferredcites →https://doi.org/10.1016/0377-0427(90)90413-topenalex-snapshot
Minimal vector Padé approximation
inferredcites →https://doi.org/10.1016/0377-0427(90)90438-6openalex-snapshot
A new approach to the rational interpolation problem
inferredcites →https://doi.org/10.1016/0377-0427(92)90039-zopenalex-snapshot
A reliable method for computing M-Padé approximants on arbitrary staircases
inferredcites →https://doi.org/10.1016/b978-0-08-019848-4.50001-1openalex-snapshot
INTERNATIONAL SERIES IN PURE AND APPLIED MATHEMATICS
inferredcites →https://doi.org/10.1016/s0377-0427(05)80008-1openalex-snapshot
A new approach to the rational interpolation problem: The vector case
inferredcites →https://doi.org/10.1109/tac.1974.1100457openalex-snapshot
A minimal realization algorithm for matrix sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-94-011-0970-3_11openalex-snapshot
Matrix Rational Interpolation with Poles as Interpolation Points
inferred← citeshttps://doi.org/10.1007/bf01208432openalex-snapshot
A look-ahead method for computing vector Padé-Hermite approximants
inferred← citeshttps://doi.org/10.1007/bf02575714openalex-snapshot
A fast block Hankel solver based on an inversion formula for block Loewner matrices
inferred← citeshttps://doi.org/10.1007/s00037-004-0185-3openalex-snapshot
On the complexity of computing determinants
inferred← citeshttps://doi.org/10.1007/s11075-009-9355-3openalex-snapshot
Matrix interpretation of multiple orthogonality
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00690-7openalex-snapshot
Schur complements of Bezoutians and the inversion of block Hankel and block Toeplitz matrices
inferred← citeshttps://doi.org/10.1016/0377-0427(95)00037-2openalex-snapshot
Inversion of a block Löwner matrix
inferred← citeshttps://doi.org/10.1016/0377-0427(95)00186-7openalex-snapshot
Duality in vector Padé-Hermite approximation problems
inferred← citeshttps://doi.org/10.1016/j.cam.2012.03.004openalex-snapshot
A type of matrix Padé approximant inspired by scalar component models
inferred← citeshttps://doi.org/10.1016/j.jat.2015.06.006openalex-snapshot
On a linear interpolation problem for n -dimensional vector polynomials
inferred← citeshttps://doi.org/10.1016/j.jco.2017.03.003openalex-snapshot
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
inferred← citeshttps://doi.org/10.1016/j.jco.2020.101502openalex-snapshot
Computing syzygies in finite dimension using fast linear algebra
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101572openalex-snapshot
Deterministic computation of the characteristic polynomial in the time of matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.jco.2023.101803openalex-snapshot
High-order lifting for polynomial Sylvester matrices
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.02.001openalex-snapshot
Normal forms for general polynomial matrices
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.11.015openalex-snapshot
Computing minimal interpolation bases
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.010openalex-snapshot
Block-Krylov techniques in the context of sparse-FGLM algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.011openalex-snapshot
Fast computation of approximant bases in canonical form
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.026openalex-snapshot
Algorithms for simultaneous Hermite–Padé approximations
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.006openalex-snapshot
Verification protocols with sub-linear communication for polynomial matrix operations
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.014openalex-snapshot
Solving structured linear systems with large displacement rank
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00495-0openalex-snapshot
A superfast method for solving Toeplitz linear least squares problems
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00528-9openalex-snapshot
A generalized minimal partial realization problem
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10078-2openalex-snapshot
A stabilized superfast solver for indefinite Hankel systems
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10079-4openalex-snapshot
A fast Hankel solver based on an inversion formula for Loewner matrices
inferred← citeshttps://doi.org/10.1016/s0377-0427(96)00120-3openalex-snapshot
Recursiveness in matrix rational interpolation problems
inferred← citeshttps://doi.org/10.1080/00036819808840695openalex-snapshot
Hermite's formula for vector polynomial interpolation with applications to structured matrices
inferred← citeshttps://doi.org/10.1090/mcom/3912openalex-snapshot
Minimization of differential equations and algebraic values of 𝐸-functions
inferred← citeshttps://doi.org/10.1109/tit.2021.3067318openalex-snapshot
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
inferred← citeshttps://doi.org/10.1109/tsp.2014.2330800openalex-snapshot
Superfast Tikhonov Regularization of Toeplitz Systems
inferred← citeshttps://doi.org/10.1137/s0895479892230031openalex-snapshot
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
inferred← citeshttps://doi.org/10.1137/s0895479897326912openalex-snapshot
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
inferred← citeshttps://doi.org/10.1137/s0895479899362302openalex-snapshot
A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems
inferred← citeshttps://doi.org/10.1145/1182553.1182558openalex-snapshot
Solving structured linear systems of large displacement rank
inferred← citeshttps://doi.org/10.1145/1277548.1277554openalex-snapshot
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
inferred← citeshttps://doi.org/10.1145/2500122openalex-snapshot
On the matrix berlekamp-massey algorithm
inferred← citeshttps://doi.org/10.1145/258726.258742openalex-snapshot
Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)
inferred← citeshttps://doi.org/10.1145/258726.258765openalex-snapshot
Fraction-free computation of matrix Padé systems
inferred← citeshttps://doi.org/10.1145/2930889.2930928openalex-snapshot
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
inferred← citeshttps://doi.org/10.1145/2930889.2930933openalex-snapshot
Algorithms for Simultaneous Padé Approximations
inferred← citeshttps://doi.org/10.1145/2930889.2930936openalex-snapshot
Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations
inferred← citeshttps://doi.org/10.1145/3087604.3087656openalex-snapshot
Computing Canonical Bases of Modules of Univariate Relations
inferred← citeshttps://doi.org/10.1145/3208976.3208988openalex-snapshot
Computing Popov and Hermite Forms of Rectangular Polynomial Matrices
inferred← citeshttps://doi.org/10.1145/3208976.3208991openalex-snapshot
Certification of Minimal Approximant Bases
inferred← citeshttps://doi.org/10.1145/3326229.3326272openalex-snapshot
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants
inferred← citeshttps://doi.org/10.1145/3373207.3404059openalex-snapshot
A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
inferred← citeshttps://doi.org/10.1145/3452143.3465533openalex-snapshot
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials
inferred← citeshttps://doi.org/10.1145/3452143.3465542openalex-snapshot
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices
inferred← citeshttps://doi.org/10.1145/3476446.3535495openalex-snapshot
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5384openalex-snapshot
On a linear interpolation problem for n-dimensional vector polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02111openalex-snapshot
Power Decoding Reed--Solomon Codes Up to the Johnson Radius
inferred← citeshttps://doi.org/10.48550/arxiv.1712.04177openalex-snapshot
Block-Krylov techniques in the context of sparse-FGLM algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2104.02497openalex-snapshot
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices
inferred← citeshttps://doi.org/10.70675/2d0acbb1zac72z4ad7zb20azc815497f8dabopenalex-snapshot
Secure and efficient outsourced computation protocols for linear algebra
inferred← citeshttps://doi.org/10.70675/d8ca44b8zb45cz479az80a3zd34deb5c4454openalex-snapshot
Bases of relations in one or several variables : fast algorithms and applications
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.