On the public citation graph

Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations

0 signed · 39 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.1006/jcom.1996.0030openalex-snapshot
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors
inferredcites →https://doi.org/10.1006/jcom.1998.0481openalex-snapshot
Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z]
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/bf01398457openalex-snapshot
On a companion operator for analytic functions
inferredcites →https://doi.org/10.1007/bf01933201openalex-snapshot
Efficient implementation of wilson's algorithm for factorizing a self-reciprocal polynomial
inferredcites →https://doi.org/10.1007/bf02510216openalex-snapshot
Polynomial root computation by means of the LR algorithm
inferredcites →https://doi.org/10.1007/s002110050303openalex-snapshot
New convergence results on functional iteration techniques for the numerical solution of M/G/1 type Markov chains
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/0898-1221(96)00080-6openalex-snapshot
Optimal and nearly optimal algorithms for approximating polynomial zeros
inferredcites →https://doi.org/10.1016/s0024-3795(98)10078-2openalex-snapshot
A stabilized superfast solver for indefinite Hankel systems
inferredcites →https://doi.org/10.1016/s0377-0427(99)00365-9openalex-snapshot
Computing a Hurwitz factorization of a polynomial
inferredcites →https://doi.org/10.1023/a:1018915407202openalex-snapshot
Spectral factorization of Laurent polynomials
inferredcites →https://doi.org/10.1023/a:1019206402431openalex-snapshot
Improved cyclic reduction for solving queueing problems
inferredcites →https://doi.org/10.1090/conm/281/04659openalex-snapshot
Approximate displacement rank and applications
inferredcites →https://doi.org/10.1093/imanum/14.4.583openalex-snapshot
Newton's iteration for non-linear equations in Markov chains
inferredcites →https://doi.org/10.1137/0707049openalex-snapshot
On Direct Methods for Solving Poisson’s Equations
inferredcites →https://doi.org/10.1137/1037082openalex-snapshot
Displacement Structure: Theory and Applications
inferredcites →https://doi.org/10.1137/s0036144594276474openalex-snapshot
Conjugate Gradient Methods for Toeplitz Systems
inferredcites →https://doi.org/10.1137/s0895479894277442openalex-snapshot
Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
inferredcites →https://doi.org/10.1137/s0895479897324585openalex-snapshot
Effective Methods for Solving Banded Toeplitz Systems
inferredcites →https://doi.org/10.2307/1428084openalex-snapshot
Non-Skip-Free M/G/ 1 and G/M/ 1 Type Markov Chains
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

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.1909openalex-snapshot
A parallel radix-4 block cyclic reduction algorithm
inferred← citeshttps://doi.org/10.1002/nla.410openalex-snapshot
Solving quadratic matrix equations and factoring polynomials: new fixed point iterations based on Schur complements of Toeplitz matrices
inferred← citeshttps://doi.org/10.1007/s11075-008-9253-0openalex-snapshot
The cyclic reduction algorithm: from Poisson equation to stochastic processes and beyond
inferred← citeshttps://doi.org/10.1016/j.laa.2013.02.020openalex-snapshot
Wiener–Hopf and spectral factorization of real polynomials by Newton’s method
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00341-xopenalex-snapshot
Computations with infinite Toeplitz matrices and polynomials
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00594-3openalex-snapshot
Polynomial factorization through Toeplitz matrix computations
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00595-5openalex-snapshot
A superfast solver for Sylvester’s resultant linear systems generated by a stable and an anti-stable polynomial
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00524-6openalex-snapshot
Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
inferred← citeshttps://doi.org/10.1023/a:1009931231719openalex-snapshot
On Factorization of Analytic Functions and Its Verification
inferred← citeshttps://doi.org/10.1023/b:numa.0000005364.00003.eaopenalex-snapshot
Effective Fast Algorithms for Polynomial Spectral Factorization
inferred← citeshttps://doi.org/10.1063/1.2949097openalex-snapshot
Frequency autocorrelation function of stochastically fluctuating fields caused by specific magnetic field inhomogeneities
inferred← citeshttps://doi.org/10.1063/5.0299572openalex-snapshot
Theoretical and experimental study of the motion of a multi-mass satellite with structurally free mass of the planetary mechanism
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01368-0openalex-snapshot
Efficient computation of the extreme solutions of 𝑋+𝐴*𝑋⁻¹𝐴=𝑄 and 𝑋-𝐴*𝑋⁻¹𝐴=𝑄
inferred← citeshttps://doi.org/10.1137/s0895479800371955openalex-snapshot
A Shifted Cyclic Reduction Algorithm for Quasi-Birth-Death Problems
inferred← citeshttps://doi.org/10.1137/s0895479801387085openalex-snapshot
Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form
inferred← citeshttps://doi.org/10.1145/384101.384122openalex-snapshot
A generalized Graeffe's iteration for evaluating polynomials and rational functions
inferred← citeshttps://doi.org/10.48550/arxiv.1806.01646openalex-snapshot
On Wiener - Hopf factorization of scalar polynomial
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.