On the public citation graph

The Triangular Decomposition of Hankel Matrices

https://doi.org/10.2307/2005223
0 signed · 31 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nla.252openalex-snapshot
Stable factorization for Hankel and Hankel‐like matrices
inferred← citeshttps://doi.org/10.1007/978-1-4614-0373-9_22openalex-snapshot
Change-Point Detection Based on SSA in Precipitation Time Series
inferred← citeshttps://doi.org/10.1007/978-1-4684-6393-4_4openalex-snapshot
Displacement Structure for Hankel- and Vandermonde-Like Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-53139-7_6openalex-snapshot
Orthogonal Polynomials in Information Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_6openalex-snapshot
Special Linear Systems
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf01388691openalex-snapshot
A look-ahead algorithm for the solution of general Hankel systems
inferred← citeshttps://doi.org/10.1007/bf01436919openalex-snapshot
Solution of linear equations with Hankel and Toeplitz matrices
inferred← citeshttps://doi.org/10.1007/bf02142494openalex-snapshot
The Padé-Rayleigh-Ritz method for solving large hermitian eigenproblems
inferred← citeshttps://doi.org/10.1007/bfb0085582openalex-snapshot
Recursive algorithms for the Padé table : Two approaches
inferred← citeshttps://doi.org/10.1007/s00607-010-0080-5openalex-snapshot
Computing the block factorization of complex Hankel matrices
inferred← citeshttps://doi.org/10.1007/s11075-007-9144-9openalex-snapshot
A fast method to block-diagonalize a Hankel matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90364-3openalex-snapshot
Displacement structure for Hankel, Vandermonde, and related (derived) matrices
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/0098-3004(88)90016-7openalex-snapshot
An efficient algorithm for polynomial curve fitting
inferred← citeshttps://doi.org/10.1016/0771-050x(78)90026-8openalex-snapshot
The spectrum of Jacobi matrices in terms of its associated weight function
inferred← citeshttps://doi.org/10.1016/0771-050x(80)90034-0openalex-snapshot
Division algorithms for continued fractions and the Padé table
inferred← citeshttps://doi.org/10.1016/0771-050x(81)90052-8openalex-snapshot
Lanczos method of tridiagonalization, Jacobi matrices and physics
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10101-5openalex-snapshot
A fast method to diagonalize a Hankel matrix
inferred← citeshttps://doi.org/10.1016/s1570-579x(07)80009-7openalex-snapshot
Matrix Methods
inferred← citeshttps://doi.org/10.1080/00207168708803583openalex-snapshot
On the parallel arithmetic complexity of the root-finding problem
inferred← citeshttps://doi.org/10.1080/00207729108910618openalex-snapshot
Approximation of discrete linear systems based on a dual criterion
inferred← citeshttps://doi.org/10.1090/s0025-5718-1973-0329235-5openalex-snapshot
Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
inferred← citeshttps://doi.org/10.1090/s0025-5718-71-99706-7openalex-snapshot
Indices
inferred← citeshttps://doi.org/10.1109/78.98002openalex-snapshot
Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices
inferred← citeshttps://doi.org/10.1109/acssc.1989.1200971openalex-snapshot
Fast modified triangular factorization of hankel and quasi-hankel matrices with arbitrary rank profile
inferred← citeshttps://doi.org/10.1109/cdc.1997.649599openalex-snapshot
Fast identification of impulse response modes via Krylov space methods
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164830openalex-snapshot
The split Levinson algorithm
inferred← citeshttps://doi.org/10.14495/jsiaml.10.57openalex-snapshot
Application of the Lanczos-Phillips algorithm to continued fractions and its extension with orthogonal polynomials
inferred← citeshttps://doi.org/10.14495/jsiaml.12.1openalex-snapshot
Extension of the Lanczos-Phillips algorithm with Laurent biorthogonal polynomials and its application to the Thron continued fractions
inferred← citeshttps://doi.org/10.37236/1595openalex-snapshot
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics
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.