Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems
From MaRDI portal
Cited in
(17)- Inversion and factorization of non-Hermitian quasi-Toeplitz matrices
- A generalized Schur-type algorithm for the joint factorization of a structured matrix and its inverse
- Displacement ranks of matrices and linear equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- On a Schur-algorithm based approach to spectral factorization: Connection with the Riccati equation
- Fast triangular factorization of the sum of quasi-Toeplitz and quasi- Hankel matrices
- Fast algorithms for optimal FIR filter and smoother of discrete-time state-space models
- Chandrasekhar-type recursive Wiener estimation technique in linear discrete-time stochastic systems
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Some alternatives in recursive estimation†
- On covariance propagation using matrix continued fractions
- Time-variant linear optimal finite impulse response estimator for discrete state-space models
- Receding horizon filtering for a class of discrete time-varying nonlinear systems with multiple missing measurements
- Sugisaka-Ueno-Chandrasekhar algorithm for digital communication and estimation
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- Sugisaka-Ueno-Chandrasekhar algorithm for digital communication and estimation
- FIR filters and recursive forms for discrete-time state-space models
This page was built for publication: Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4161188)
