On the public citation graph
Fast Toeplitz Orthogonalization Using Inner Products
0 signed · 56 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/bf01389431openalex-snapshot
QR factorization of Toeplitz matrices
inferredcites →https://doi.org/10.1007/bf01934903openalex-snapshot
The numerical stability of the lattice algorithm for least squares linear prediction problems
inferredcites →https://doi.org/10.1016/0022-247x(79)90124-0openalex-snapshot
Displacement ranks of matrices and linear equations
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.1109/proc.1975.9792openalex-snapshot
Linear prediction: A tutorial review
inferredcites →https://doi.org/10.1137/0908073openalex-snapshot
Fast Parallel Algorithms for QR and Triangular Factorization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cmr.a.10089openalex-snapshot
Nuclear magnetic resonance data processing. MestRe‐C: A software package for desktop computers
inferred← citeshttps://doi.org/10.1002/cpe.883openalex-snapshot
Solving the block-Toeplitz least-squares problem in parallel
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-031-82014-4_5openalex-snapshot
The Optimal Causal Linear Predictor is Not Turing Computable
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-642-75536-1_11openalex-snapshot
Generalized Displacement Structure for Block-Toeplitz, Toeplitz-block, and Toeplitz-derived Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-75536-1_4openalex-snapshot
Parallel Algorithms for Toeplitz Systems
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/978-94-015-8196-7_37openalex-snapshot
A Fast Algorithm for QR Decomposition of Toeplitz Matrices
inferred← citeshttps://doi.org/10.1007/bf01404468openalex-snapshot
Hybrid algorithm for fast Toeplitz orthogonalization
inferred← citeshttps://doi.org/10.1007/bf02140770openalex-snapshot
Stability analysis of a general toeplitz systems solver
inferred← citeshttps://doi.org/10.1007/bf02142678openalex-snapshot
Fastiterative methods for least squares estimations
inferred← citeshttps://doi.org/10.1007/bf02142744openalex-snapshot
Fast orthogonal decomposition of rank deficient Toeplitzmatrices
inferred← citeshttps://doi.org/10.1007/bf02510260openalex-snapshot
A total least squares method for Toeplitz systems of equations
inferred← citeshttps://doi.org/10.1007/s002110050268openalex-snapshot
Stability analysis and fast algorithms for triangularization of Toeplitz matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90483-5openalex-snapshot
Product rules for the displacement of near-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/0377-0427(89)90363-4openalex-snapshot
Least squares modifications with inverse factorizations: Parallel implications
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90077-3openalex-snapshot
Linearly connected arrays for Toeplitz least-squares problems
inferred← citeshttps://doi.org/10.1016/b978-0-444-88621-7.50011-6openalex-snapshot
Least squares modifications with inverse factorizations: parallel implications
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.1016/s0076-6879(94)39012-6openalex-snapshot
[10] Quantitative information from complicated nuclear magnetic resonance spectra of biological macromolecules
inferred← citeshttps://doi.org/10.1016/s0079-6565(99)00002-3openalex-snapshot
Linear prediction spectral analysis of NMR data
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00408-8openalex-snapshot
Symbiosis between linear algebra and optimization
inferred← citeshttps://doi.org/10.1016/s1386-1425(99)00235-8openalex-snapshot
Utilization of characteristics of fast linear prediction based on the lattice algorithm in an analysis of time domain magnetic resonance
inferred← citeshttps://doi.org/10.1023/a:1021946924741openalex-snapshot
Incremental Norm Estimation for Dense and Sparse Matrices
inferred← citeshttps://doi.org/10.1109/29.52714openalex-snapshot
Sliding windows and lattice algorithms for computing QR factors in the least squares theory of linear prediction
inferred← citeshttps://doi.org/10.1109/29.56053openalex-snapshot
A fast least-square deconvolution algorithm for vocal tract cross section estimation
inferred← citeshttps://doi.org/10.1109/acssc.1988.754017openalex-snapshot
A Fast Least Square Deconvolution Algorithm For Vocal Tract Cross Section Estimation
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.1117/12.948485openalex-snapshot
Old And New Algorithms For Toeplitz Systems
inferred← citeshttps://doi.org/10.1137/050629148openalex-snapshot
Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
inferred← citeshttps://doi.org/10.1137/0609026openalex-snapshot
Recursive Least Squares Algorithm for Linear Prediction Problems
inferred← citeshttps://doi.org/10.1137/0611035openalex-snapshot
Hyperbolic Householder Algorithms for Factoring Structured Matrices
inferred← citeshttps://doi.org/10.1137/0908073openalex-snapshot
Fast Parallel Algorithms for QR and Triangular Factorization
inferred← citeshttps://doi.org/10.1137/0914070openalex-snapshot
Fast Inverse $QR$ Factorization for Toeplitz Matrices
inferred← citeshttps://doi.org/10.1137/0916044openalex-snapshot
On Computing Objective Function and Gradient in the Context of Least Squares Fitting a Dynamic Errors-In-Variables Model
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/1037082openalex-snapshot
Displacement Structure: Theory and Applications
inferred← citeshttps://doi.org/10.1137/130922872openalex-snapshot
On Incremental Condition Estimators in the 2-Norm
inferred← citeshttps://doi.org/10.1137/s0036144594276474openalex-snapshot
Conjugate Gradient Methods for Toeplitz Systems
inferred← citeshttps://doi.org/10.1137/s0895479889169042openalex-snapshot
Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
inferred← citeshttps://doi.org/10.1137/s0895479895296446openalex-snapshot
Backward Perturbation Bounds for Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/s0895479895296458openalex-snapshot
A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
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.23919/acc.1986.4788976openalex-snapshot
Toeplitz Algorithms for Controllability, GCD and Cauchy Index
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.