On the public citation graph

Parallel and superfast algorithms for Hankel systems of equations

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.1002/sapm1946251261openalex-snapshot
The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction
inferredcites →https://doi.org/10.1007/978-3-0348-5483-2_12openalex-snapshot
Triangular Factorization of Structured Hermitian Matrices
inferredcites →https://doi.org/10.1007/978-3-0348-5483-2_2openalex-snapshot
A Theorem of I. Schur and Its Impact on Modern Signal Processing
inferredcites →https://doi.org/10.1007/978-3-0348-6241-7openalex-snapshot
Algebraic Methods for Toeplitz-like Matrices and Operators
inferredcites →https://doi.org/10.1007/978-3-0348-9306-0openalex-snapshot
Laurent Series and their Padé Approximations
inferredcites →https://doi.org/10.1007/bf01196879openalex-snapshot
Inversion of matrices with displacement structure
inferredcites →https://doi.org/10.1007/bf02163269openalex-snapshot
Numerical solution of linear equations with Toeplitz and Vector Toeplitz matrices
inferredcites →https://doi.org/10.1016/0024-3795(80)90161-5openalex-snapshot
Asymptotically fast solution of toeplitz and related systems of linear equations
inferredcites →https://doi.org/10.1016/0024-3795(83)90059-9openalex-snapshot
On the partial realization problem
inferredcites →https://doi.org/10.1016/0024-3795(86)90188-6openalex-snapshot
On inversion of Toeplitz and close to Toeplitz matrices
inferredcites →https://doi.org/10.1016/0024-3795(87)90107-8openalex-snapshot
A new algorithm for solving Toeplitz systems of equations
inferredcites →https://doi.org/10.1016/0024-3795(87)90113-3openalex-snapshot
Linear complexity parallel algorithms for linear systems of equations with recursive structure
inferredcites →https://doi.org/10.1016/0196-6774(80)90013-9openalex-snapshot
Fast solution of toeplitz systems of equations and computation of Padé approximants
inferredcites →https://doi.org/10.1016/0377-0427(84)90042-6openalex-snapshot
Recursive relations for block Hankel and Toeplitz systems part I: Direct recursions
inferredcites →https://doi.org/10.1016/0377-0427(84)90043-8openalex-snapshot
Recursive relations for block Hankel and Toeplitz systems part II: Dual recursions
inferredcites →https://doi.org/10.1063/1.526133openalex-snapshot
An exact recursion for the composite nearest-neighbor degeneracy for a 2× N lattice space
inferredcites →https://doi.org/10.1109/tac.1986.1104191openalex-snapshot
On recursiveness and related topics in linear systems
inferredcites →https://doi.org/10.1109/tassp.1985.1164645openalex-snapshot
A generalization of the Levinson algorithm for Hermitian Toeplitz matrices with any rank profile
inferredcites →https://doi.org/10.1137/0112045openalex-snapshot
An Algorithm for the Inversion of Finite Toeplitz 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/(sici)1099-1476(19970710)20:10<841::aid-mma886>3.0.co;2-lopenalex-snapshot
On a Non-symmetric Problem in Electrochemical Machining
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5319openalex-snapshot
Hankel Matrices of Finite Rank with Applications to Signal Processing and Polynomials
inferred← citeshttps://doi.org/10.1007/978-1-4612-4228-4_5openalex-snapshot
Inversion of Generalized Cauchy Matrices and other Classes of Structured Matrices
inferred← citeshttps://doi.org/10.1007/978-3-7643-8996-3_2openalex-snapshot
Georg Heinig November 24, 1947 - May 10, 2005 A Personal Memoir and Appreciation
inferred← citeshttps://doi.org/10.1007/bf02510259openalex-snapshot
A framework for polynomial preconditioners based on fast transforms I: Theory
inferred← citeshttps://doi.org/10.1007/bfb0006939openalex-snapshot
Fast algorithms for structured matrices and interpolation problems
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90022-3openalex-snapshot
The Lanczos algorithm and Hankel matrix factorization
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00157-uopenalex-snapshot
Recursive solution of Cauchy-Vandermonde systems of equations
inferred← citeshttps://doi.org/10.1016/0024-3795(94)90083-3openalex-snapshot
Displacement structure of generalized inverse matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00501-3openalex-snapshot
Vandermonde factorization and canonical representations of block hankel matrices
inferred← citeshttps://doi.org/10.1016/0377-0427(93)90292-jopenalex-snapshot
Iterative methods for discrete nonlinear Riemann-Hilbert problems
inferred← citeshttps://doi.org/10.1016/j.laa.2004.06.011openalex-snapshot
Split algorithms for hermitian Toeplitz matrices with arbitrary rank profile
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00300-1openalex-snapshot
Chebyshev–Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
inferred← citeshttps://doi.org/10.1016/s0167-9473(00)00006-2openalex-snapshot
Efficient implementation and benchmark of interior point methods for the polynomial L1 fitting problem
inferred← citeshttps://doi.org/10.1016/s0377-0427(96)00064-7openalex-snapshot
A new algorithm for computing orthogonal polynomials
inferred← citeshttps://doi.org/10.1090/conm/323/05697openalex-snapshot
Inversion of Toeplitz-plus-Hankel matrices with arbitrary rank profile
inferred← citeshttps://doi.org/10.1109/78.824674openalex-snapshot
On the use of kernel structure for blind equalization
inferred← citeshttps://doi.org/10.1109/icassp.1998.679593openalex-snapshot
On the use of kernel structure for blind equalization
inferred← citeshttps://doi.org/10.1137/0614044openalex-snapshot
On the Bezoutian Structure of the Moore–Penrose Inverses of Hankel Matrices
inferred← citeshttps://doi.org/10.1137/17m1160124openalex-snapshot
Sum-of-Squares Optimization without Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s0895479892225853openalex-snapshot
Moore–Penrose Inversion of Square Toeplitz Matrices
inferred← citeshttps://doi.org/10.5540/tema.2004.05.02.0269openalex-snapshot
Métodos de Pontos Interiores Aplicados ao Problema de Regressão pela Norma Lp
inferred← citeshttps://doi.org/10.7282/t31r6pvropenalex-snapshot
Optimization models for shape-constrained function estimation problems involving nonnegative polynomials and their restrictions
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.