Pages that link to "Item:Q4161188"
From MaRDI portal
The following pages link to Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems (Q4161188):
Displaying 17 items.
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices (Q599137) (← links)
- FIR filters and recursive forms for discrete-time state-space models (Q912062) (← links)
- Inversion and factorization of non-Hermitian quasi-Toeplitz matrices (Q1098554) (← links)
- A generalized Schur-type algorithm for the joint factorization of a structured matrix and its inverse (Q1127942) (← links)
- Displacement ranks of matrices and linear equations (Q1139102) (← links)
- Asymptotically fast solution of Toeplitz and related systems of linear equations (Q1151720) (← links)
- On a Schur-algorithm based approach to spectral factorization: Connection with the Riccati equation (Q1188439) (← links)
- Fast triangular factorization of the sum of quasi-Toeplitz and quasi- Hankel matrices (Q1308435) (← links)
- Fast algorithms for optimal FIR filter and smoother of discrete-time state-space models (Q1322814) (← links)
- Chandrasekhar-type recursive Wiener estimation technique in linear discrete-time stochastic systems (Q2372046) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- Some alternatives in recursive estimation† (Q3882305) (← links)
- On covariance propagation using matrix continued fractions (Q4198421) (← links)
- Time‐variant linear optimal finite impulse response estimator for discrete state‐space models (Q4908470) (← links)
- Receding horizon filtering for a class of discrete time-varying nonlinear systems with multiple missing measurements (Q5246257) (← links)
- Sugisaka-Ueno-Chandrasekhar algorithm for digital communication and estimation (Q5931664) (← links)
- Sugisaka-Ueno-Chandrasekhar algorithm for digital communication and estimation (Q6230819) (← links)