Inverses of Multivariable Polynomial Matrices by Discrete Fourier Transforms

Authors:
S. Vologiannidis;N. Karampetakis
Affiliations:
Department of Mathematics, Aristotle University of Thessaloniki, Greece/ svol@math.auth.gr;Department of Mathematics, Aristotle University of Thessaloniki, Greece/ karampet@math.auth.gr
Venue:
Multidimensional Systems and Signal Processing
Year:
2004

Citing 7
Cited 5

A finite algorithm for computing the weighted Moore-Penrose inverse +-mn-

Applied Mathematics and Computation
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
The computation and application of the generalized inverse via Maple

Journal of Symbolic Computation
Accumulation of Round-Off Error in Fast Fourier Transforms

Journal of the ACM (JACM)
A new method for computing the solutions of differential equation systems using generalized inverse via Maple

Applied Mathematics and Computation
Multidimensional Digital Signal Processing

Multidimensional Digital Signal Processing
The fast Fourier transform its role as an algebraic algorithm

ACM '76 Proceedings of the 1976 annual conference

Effective partitioning method for computing weighted Moore-Penrose inverse

Computers & Mathematics with Applications
A study on new right/left inverses of nonsquare polynomial matrices

International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Locally invertible multivariate polynomial matrices

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
On the computation of the inverse of a two-variable polynomial matrix by interpolation

Multidimensional Systems and Signal Processing
On the Newton bivariate polynomial interpolation with applications

Multidimensional Systems and Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of the fast computation of the Moore–Penrose and Drazin inverse of a multi-variable polynomial matrix is addressed. The algorithms proposed, use evaluation-interpolation techniques and the Fast Fourier transform. They proved to be faster than other known algorithms. The efficiency of the algorithms is illustrated via randomly generated examples.