Parallelization of a method for the solution of the inverse additive singular value problem

  • Authors:
  • Georgina Flores-Becerra;Victor M. Garcia;Antonio M. Vidal

  • Affiliations:
  • Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain and Departamento de Sistemas y Computación, Instituto Tecnológico ...;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain

  • Venue:
  • MATH'05 Proceedings of the 8th WSEAS International Conference on Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes the parallelization of a method (proposed by Chu in [7]) to solve the Inverse Additive Singular Value Problem (IASVP). The IASVP is a problem whose solution requires a high computational cost, both in time and in memory. For example, the complexity of Chu's method is O(n4) in time and O(n3) in memory. Using parallel computing, the time needed to solve the problem has been substantially reduced. The parallel algorithm developed has shown good experimental performance, confirming the theoretical performance predicted and showing an acceptable scalability.