Stationary discrete-time covariance factorization using Newton-Raphson iteration
From MaRDI portal
Recommendations
- A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm
- Optimization with respect to covariance sequence parameters
- A state-space approach to discrete-time spectral factorization
- Adaptive covariance estimation of locally stationary processes
- An Iterative Method for Matrix Spectral Factorization
Cites work
- scientific article; zbMATH DE number 3120956 (Why is no real title available?)
- scientific article; zbMATH DE number 3127846 (Why is no real title available?)
- scientific article; zbMATH DE number 5345413 (Why is no real title available?)
- scientific article; zbMATH DE number 3939221 (Why is no real title available?)
- scientific article; zbMATH DE number 3717984 (Why is no real title available?)
- scientific article; zbMATH DE number 193291 (Why is no real title available?)
- scientific article; zbMATH DE number 3502257 (Why is no real title available?)
- scientific article; zbMATH DE number 3513598 (Why is no real title available?)
- scientific article; zbMATH DE number 3437452 (Why is no real title available?)
- Covariance factorization via Newton-Raphson iteration
- Factorization of matrix functions and singular integral operators
- Identifiability of linear stochastic systems operating under linear feedback
- On the continuity of the Wiener-Hopf factorization operation
- Second-order convergent algorithms for the steady-state Riccati equation†
- The Laurent Factorization of Operatorvalued Functions
This page was built for publication: Stationary discrete-time covariance factorization using Newton-Raphson iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1192596)