On the public citation graph

Hybrid algorithm for fast Toeplitz orthogonalization

https://doi.org/10.1007/bf01404468
0 signed · 29 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/bf01389431openalex-snapshot
QR factorization of Toeplitz matrices
inferredcites →https://doi.org/10.1007/bf01389635openalex-snapshot
Fast Toeplitz orthogonalization
inferredcites →https://doi.org/10.1016/0024-3795(75)90068-3openalex-snapshot
Error analysis of QR decompositions by Givens transformations
inferredcites →https://doi.org/10.1016/0024-3795(87)90122-4openalex-snapshot
A fast but unstable orthogonal triangularization technique for Toeplitz matrices
inferredcites →https://doi.org/10.1090/s0025-5718-1983-0679449-6openalex-snapshot
A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
inferredcites →https://doi.org/10.1093/imamat/23.2.203openalex-snapshot
The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
inferredcites →https://doi.org/10.1137/0609026openalex-snapshot
Recursive Least Squares Algorithm for Linear Prediction Problems
inferredcites →https://doi.org/10.1137/0908063openalex-snapshot
Fast Toeplitz Orthogonalization Using Inner Products
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem
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.1007/3-540-45262-1_4openalex-snapshot
An Algorithm Based on Orthogonal Polynomial Vectors for Toeplitz Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-3-0348-7881-4_9openalex-snapshot
Fast Algorithms for Toeplitz Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-3-7643-7984-1_6openalex-snapshot
Implementation of Fast Low Rank Approximation of a Sylvester Matrix
inferred← citeshttps://doi.org/10.1007/bf02140770openalex-snapshot
Stability analysis of a general toeplitz systems solver
inferred← citeshttps://doi.org/10.1007/s002110050268openalex-snapshot
Stability analysis and fast algorithms for triangularization of Toeplitz matrices
inferred← citeshttps://doi.org/10.1016/0165-1684(94)00113-eopenalex-snapshot
A fast algorithm for −1 factorization of Toeplitz matrices
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00495-0openalex-snapshot
A superfast method for solving Toeplitz linear least squares problems
inferred← citeshttps://doi.org/10.1109/access.2020.3017558openalex-snapshot
Superior Implementation of Accelerated QR Decomposition for Ultrasound Imaging
inferred← citeshttps://doi.org/10.1109/icassp.2009.4960179openalex-snapshot
Efficient minimum-phase prefilter computation using fast QL-factorization
inferred← citeshttps://doi.org/10.1109/tsp.2010.2045795openalex-snapshot
Computing the Minimum-Phase Filter Using the QL-Factorization
inferred← citeshttps://doi.org/10.1109/tuffc.2016.2515260openalex-snapshot
Computationally Efficient Adaptive Beamformer for Ultrasound Imaging Based on QR Decomposition
inferred← citeshttps://doi.org/10.1109/vlsisp.1993.404472openalex-snapshot
Fast and accurate Toeplitz matrix triangulation for linear prediction
inferred← citeshttps://doi.org/10.1137/0609026openalex-snapshot
Recursive Least Squares Algorithm for Linear Prediction Problems
inferred← citeshttps://doi.org/10.1137/1.9781611971354.ch4openalex-snapshot
4. Stability of Fast Algorithms for Structured Linear Systems
inferred← citeshttps://doi.org/10.1137/120895755openalex-snapshot
Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
inferred← citeshttps://doi.org/10.1137/s0895479895296446openalex-snapshot
Backward Perturbation Bounds for Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/s089547989529646xopenalex-snapshot
New Fast Algorithms for Structured Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/s1064827598347423openalex-snapshot
Schur-Type Methods for Solving Least Squares Problems with Toeplitz Structure
inferred← citeshttps://doi.org/10.48550/arxiv.1005.0671openalex-snapshot
Stability of fast algorithms for structured linear systems
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.