On the public citation graph

Fast approximate computations with Cauchy matrices and polynomials

0 signed · 56 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-1-4757-2817-0openalex-snapshot
Time-Varying Systems and Computations
inferredcites →https://doi.org/10.1007/bf01300581openalex-snapshot
On a new class of structured matrices
inferredcites →https://doi.org/10.1007/bf01320704openalex-snapshot
Linear complexity algorithm for semiseparable matrices
inferredcites →https://doi.org/10.1007/bf01436566openalex-snapshot
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
inferredcites →https://doi.org/10.1007/bf02431995openalex-snapshot
An algebraic approach to approximate evaluation of a polynomial on a set of real points
inferredcites →https://doi.org/10.1007/s00607-002-1450-4openalex-snapshot
inferredcites →https://doi.org/10.1007/s00607-003-0019-1openalex-snapshot
Construction and Arithmetics of H -Matrices
inferredcites →https://doi.org/10.1007/s006070050015openalex-snapshot
A Sparse Matrix Arithmetic Based on $\Cal H$ -Matrices. Part I: Introduction to ${\Cal H}$ -Matrices
inferredcites →https://doi.org/10.1007/s006070070031openalex-snapshot
Incomplete Cross Approximation in the Mosaic-Skeleton Method
inferredcites →https://doi.org/10.1016/0020-0190(72)90050-6openalex-snapshot
A fast method for interpolation using preconditioning
inferredcites →https://doi.org/10.1016/0021-9991(85)90002-6openalex-snapshot
Rapid solution of integral equations of classical potential theory
inferredcites →https://doi.org/10.1016/0021-9991(87)90140-9openalex-snapshot
A fast algorithm for particle simulations
inferredcites →https://doi.org/10.1016/0898-1221(93)90129-jopenalex-snapshot
A new approach to fast polynomial interpolation and multipoint evaluation
inferredcites →https://doi.org/10.1016/j.laa.2014.09.004openalex-snapshot
Transformations of matrix structures work again
inferredcites →https://doi.org/10.1016/j.laa.2015.04.021openalex-snapshot
Random multipliers numerically stabilize Gaussian and block Gaussian elimination: Proofs and an extension to low-rank approximation
inferredcites →https://doi.org/10.1016/s0024-3795(01)00363-9openalex-snapshot
A modification of the Dewilde–van der Veen method for inversion of finite structured matrices
inferredcites →https://doi.org/10.1016/s0898-1221(97)00008-4openalex-snapshot
Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
inferredcites →https://doi.org/10.1073/pnas.0709640104openalex-snapshot
Randomized algorithms for the low-rank approximation of matrices
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0290541-1openalex-snapshot
Solution of Vandermonde Systems of Equations
inferredcites →https://doi.org/10.1090/s0025-5718-1988-0917825-9openalex-snapshot
A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
inferredcites →https://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
inferredcites →https://doi.org/10.1109/tau.1970.1162132openalex-snapshot
A linear filtering approach to the computation of discrete Fourier transform
inferredcites →https://doi.org/10.1137/040617200openalex-snapshot
A Superfast Algorithm for Toeplitz Systems of Linear Equations
inferredcites →https://doi.org/10.1137/050639028openalex-snapshot
A Fast Solver for HSS Representations via Sparse Matrices
inferredcites →https://doi.org/10.1137/090771806openalex-snapshot
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
inferredcites →https://doi.org/10.1137/0908017openalex-snapshot
A Fast Algorithm for Trummer’s Problem
inferredcites →https://doi.org/10.1137/100786617openalex-snapshot
A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
inferredcites →https://doi.org/10.1137/110827788openalex-snapshot
On the Complexity of Some Hierarchical Structured Matrix Algorithms
inferredcites →https://doi.org/10.1137/110831982openalex-snapshot
A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
inferredcites →https://doi.org/10.1137/12087116xopenalex-snapshot
Randomized Sparse Direct Solvers
inferredcites →https://doi.org/10.1137/120895755openalex-snapshot
Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
inferredcites →https://doi.org/10.1137/15m1030170openalex-snapshot
How Bad Are Vandermonde Matrices?
inferredcites →https://doi.org/10.1142/9789812836021_0015openalex-snapshot
How to Find a Good Submatrix
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.1145/800152.804900openalex-snapshot
Polynomial evaluation via the division algorithm the fast Fourier transform revisited
inferredcites →https://doi.org/10.2307/2153371openalex-snapshot
Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
inferredcites →https://doi.org/10.2307/2313246openalex-snapshot
Inverses of Vandermonde Matrices

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.2204openalex-snapshot
SMASH: Structured matrix approximation by separation and hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-030-26831-2_26openalex-snapshot
Old and New Nearly Optimal Polynomial Root-Finders
inferred← citeshttps://doi.org/10.1007/978-3-031-17899-3_16openalex-snapshot
fMRI-S4: Learning Short- and Long-Range Dynamic fMRI Dependencies Using 1D Convolutions and State Space Models
inferred← citeshttps://doi.org/10.1007/978-3-031-23190-2_3openalex-snapshot
Improving Pre-trained Language Models
inferred← citeshttps://doi.org/10.1016/j.cam.2025.117152openalex-snapshot
A low-complexity algorithm to digitally uncouple the mutual coupling effect in antenna arrays via symmetric Toeplitz matrices
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.030openalex-snapshot
Accelerated approximation of the complex roots and factors of a univariate polynomial
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.031openalex-snapshot
Nearly optimal computations with structured matrices
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115022openalex-snapshot
A new fast root-finder for black box polynomials
inferred← citeshttps://doi.org/10.1038/s41467-024-50469-9openalex-snapshot
Chemical language modeling with structured state space sequence models
inferred← citeshttps://doi.org/10.1070/sm8833openalex-snapshot
Fast matrix multiplication and its algebraic neighbourhood
inferred← citeshttps://doi.org/10.1109/access.2020.2970342openalex-snapshot
Radix-2 Self-Recursive Sparse Factorizations of Delay Vandermonde Matrices for Wideband Multi-Beam Antenna Arrays
inferred← citeshttps://doi.org/10.1109/ojsp.2020.2991586openalex-snapshot
Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays
inferred← citeshttps://doi.org/10.1109/tsp.2022.3231182openalex-snapshot
A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers
inferred← citeshttps://doi.org/10.1137/15m1030170openalex-snapshot
How Bad Are Vandermonde Matrices?
inferred← citeshttps://doi.org/10.21203/rs.3.rs-8501461/v1openalex-snapshot
Timeba: UNet State Space Model for Trajectory Prediction
inferred← citeshttps://doi.org/10.26434/chemrxiv-2023-jwmf3-v2openalex-snapshot
Chemical Language Modeling with Structured State Spaces
inferred← citeshttps://doi.org/10.3390/s24020576openalex-snapshot
Thiran Filters for Wideband DSP-Based Multi-Beam True Time Delay RF Sensing Applications
inferred← citeshttps://doi.org/10.4213/sm8833openalex-snapshot
Быстрое умножение матриц и смежные вопросы алгебры
inferred← citeshttps://doi.org/10.48550/arxiv.2111.00396openalex-snapshot
Efficiently Modeling Long Sequences with Structured State Spaces
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.