On the public citation graph

Fast Toeplitz orthogonalization

0 signed · 79 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/bf01436084openalex-snapshot
Linear least squares solutions by householder transformations
inferredcites →https://doi.org/10.1016/0005-1098(80)90024-2openalex-snapshot
Fast projection methods for minimal design problems in linear system theory
inferredcites →https://doi.org/10.1016/0016-0032(56)90143-0openalex-snapshot
Introduction to numerical analysis
inferredcites →https://doi.org/10.1029/jb078i023p04959openalex-snapshot
Predictive filtering and smoothing of short records by using maximum entropy
inferredcites →https://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
inferredcites →https://doi.org/10.1090/s0025-5718-1973-0331745-1openalex-snapshot
An Error Analysis of a Method for Solving Matrix Equations
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0343558-6openalex-snapshot
Methods for Modifying Matrix Factorizations
inferredcites →https://doi.org/10.1093/imamat/12.3.329openalex-snapshot
Least Squares Computations by Givens Transformations Without Square Roots
inferredcites →https://doi.org/10.1109/cdc.1978.268140openalex-snapshot
Recursive least squares ladder forms for fast parameter tracking
inferredcites →https://doi.org/10.1109/proc.1975.9792openalex-snapshot
Linear prediction: A tutorial review
inferredcites →https://doi.org/10.1109/tassp.1977.1162989openalex-snapshot
Efficient solution of covariance equations for linear prediction
inferredcites →https://doi.org/10.1137/1014001openalex-snapshot
The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem

What points at this work

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

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-44942-6_26openalex-snapshot
A Parallel Algorithm for Solving the Toeplitz Least Squares Problem
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-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-662-46800-5_30openalex-snapshot
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
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/bf01385644openalex-snapshot
Fast block Toeplitz orthogonalization
inferred← citeshttps://doi.org/10.1007/bf01389431openalex-snapshot
QR factorization of Toeplitz matrices
inferred← citeshttps://doi.org/10.1007/bf01404468openalex-snapshot
Hybrid algorithm for fast Toeplitz orthogonalization
inferred← citeshttps://doi.org/10.1007/bf01933218openalex-snapshot
A modification to the linpack downdating algorithm
inferred← citeshttps://doi.org/10.1007/bf02140770openalex-snapshot
Stability analysis of a general toeplitz systems solver
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/bf02901218openalex-snapshot
Fast parallel QR decomposition of block-Toeplitz matrices
inferred← citeshttps://doi.org/10.1007/s002110050268openalex-snapshot
Stability analysis and fast algorithms for triangularization of Toeplitz matrices
inferred← citeshttps://doi.org/10.1007/s11227-005-0182-6openalex-snapshot
An Efficient Parallel Algorithm to Solve Block?Toeplitz Systems
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90122-4openalex-snapshot
A fast but unstable orthogonal triangularization technique for 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/0743-7315(90)90077-3openalex-snapshot
Linearly connected arrays for Toeplitz least-squares problems
inferred← citeshttps://doi.org/10.1016/j.cam.2021.113627openalex-snapshot
Inverse of the covariance matrix of an MA(2) process
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/s0377-0427(00)00408-8openalex-snapshot
Symbiosis between linear algebra and optimization
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)54825-9openalex-snapshot
An Efficient QR-Decomposition Algorithm for Block-toeplitz and Block-hankel Matrices
inferred← citeshttps://doi.org/10.1080/02331930500530237openalex-snapshot
Numerical solution of Hamilton–Jacobi–Bellman equations by an exponentially fitted finite volume method
inferred← citeshttps://doi.org/10.1109/29.52704openalex-snapshot
The fast adaptive ROTOR's RLS algorithm
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/78.205755openalex-snapshot
Fast orthogonalization algorithm and parallel architecture for AR spectral estimation based on forward-backward linear prediction
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/icassp.1990.116119openalex-snapshot
Tracking the frequencies of superimposed time-varying harmonics
inferred← citeshttps://doi.org/10.1109/icassp.1991.150864openalex-snapshot
Fast Toeplitz-Hankel orthogonalization for high-resolution spectral estimation
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/pimrc.2009.5449779openalex-snapshot
Soft QRD-M decoding for coded IFDMA systems
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3493813openalex-snapshot
Channel Estimation Considerate Precoder Design for Multi-User Massive MIMO-OFDM Systems: The Concept and Fast Algorithms
inferred← citeshttps://doi.org/10.1109/tencon.1996.608437openalex-snapshot
Fast direct methods for Toeplitz least squares problems
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/tsp.2014.2330800openalex-snapshot
Superfast Tikhonov Regularization of Toeplitz Systems
inferred← citeshttps://doi.org/10.1109/tsp.2024.3355742openalex-snapshot
Fast Computation of Zero-Forcing Precoding for Massive MIMO-OFDM Systems
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/vetecf.2010.5594340openalex-snapshot
Range and Bearing Estimation for Near-Field Sources
inferred← citeshttps://doi.org/10.1109/vlsisp.1993.404472openalex-snapshot
Fast and accurate Toeplitz matrix triangulation for linear prediction
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/0613032openalex-snapshot
A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
inferred← citeshttps://doi.org/10.1137/0614053openalex-snapshot
A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
inferred← citeshttps://doi.org/10.1137/0908063openalex-snapshot
Fast Toeplitz Orthogonalization Using Inner Products
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/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.1145/2930889.2930923openalex-snapshot
Fast Fourier Orthogonalization
inferred← citeshttps://doi.org/10.1201/b16113-73openalex-snapshot
Fast Algorithms for Structured Matrix Computations
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33014918openalex-snapshot
Sublinear Time Numerical Linear Algebra for Structured Matrices
inferred← citeshttps://doi.org/10.23919/acc.1986.4788976openalex-snapshot
Toeplitz Algorithms for Controllability, GCD and Cauchy Index
inferred← citeshttps://doi.org/10.70675/a098d00bz4a56z4d31zb204z4cd7eacf67daopenalex-snapshot
Gaussian sampling in lattice-based cryptography
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.