On the public citation graph
Unit�re Transformationen gro�er Matrizen
0 signed · 25 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/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1090/psapm/015/0160321openalex-snapshot
On Jacobi rotation patterns
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-3-031-76930-6_9openalex-snapshot
Applications of the Fast Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-45145-7_35openalex-snapshot
Communication-Efficient Parallel Gaussian Elimination
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf01272518openalex-snapshot
Some computational problems in linear algebra as hard as matrix multiplication
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90049-0openalex-snapshot
Fast algorithms for the characteristics polynomial
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50015-5openalex-snapshot
METHODS FOR SPARSE LINEAR LEAST SQUARES PROBLEMS
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.future.2006.04.017openalex-snapshot
Communication-efficient parallel generic pairwise elimination
inferred← citeshttps://doi.org/10.1016/j.jco.2004.03.005openalex-snapshot
Essentially optimal computation of the inverse of generic polynomial matrices
inferred← citeshttps://doi.org/10.1016/j.jco.2005.05.001openalex-snapshot
Festschrift in honor of Arnold Schönhage
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.04.004openalex-snapshot
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
inferred← citeshttps://doi.org/10.1109/csitechnol.2019.8895255openalex-snapshot
Recursive Matrix Algorithms, Distributed Dynamic Control, Scaling, Stability
inferred← citeshttps://doi.org/10.1109/focs.2013.21openalex-snapshot
OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00041openalex-snapshot
On Matrix Multiplication and Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267806openalex-snapshot
On efficient band matrix arithmetic
inferred← citeshttps://doi.org/10.1137/22m1536169openalex-snapshot
On Matrix Multiplication and Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1137/24m1672596openalex-snapshot
Grassmannian Optimization Is NP-Hard
inferred← citeshttps://doi.org/10.15407/pp2026.01.102openalex-snapshot
A block-recursive approach to unitary matrix decomposition
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.