Sequential and Parallel Algorithms for the Inverse Toeplitz Singular Value Problem

Autores UPV
Año
CONGRESO Sequential and Parallel Algorithms for the Inverse Toeplitz Singular Value Problem

Abstract

When the Inverse Additive Singular Value Problem (IASVP) involves Toeplitz¿type matrices it is possible to exploit this special structure to reduce the execution time. In this paper, we present two iterative local and global convergent algorithms (MIIIT and LPT) to solve efficiently the IASVP when the matrix is Toeplitz (IASVPT). As it will be shown, it can be achieved an asymptotic complexity one order of magnitude less than those algorithms that do not exploit the Toeplitz¿like structure. Furthermore, we have implemented a parallel version of these both algorithms, called PMIIIT and PLPT, respectively, that highly reduce the execution time of the sequential algorithm at sight of the experiments.