An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
From MaRDI portal
Publication:3709782
Recommendations
- scientific article; zbMATH DE number 4104260
- scientific article; zbMATH DE number 4205949
- On a fast algorithm for the approximate solution of the discrete Wiener-Hopf equation and an estimation of the accuracy
- Approximation methods for a class of discrete Wiener-Hopf equations
- scientific article; zbMATH DE number 3911596
- Solving Wiener-Hopf problems via an efficient iterative scheme
- Approximate solution of Wiener-Hopf integral equations and its discrete counterparts
- Difference and discrete equations on a half-axis and the Wiener-Hopf method
- A method for the numerical solution of Wiener-Hopf integral equations
- scientific article; zbMATH DE number 3880059
Cited in
(11)- scientific article; zbMATH DE number 4104260 (Why is no real title available?)
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- A superfast algorithm for multi-dimensional Padé systems
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- At the dawn of the theory of codes
- A stabilized superfast solver for indefinite Hankel systems
- scientific article; zbMATH DE number 5235835 (Why is no real title available?)
- Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
- Inversion components of block Hankel-like matrices
- A note on solving nearly triangular Toeplitz systems
- Recursive partial realization from the combined sequence of Markov parameters and moments
This page was built for publication: An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709782)