Add to ORKGAbstract:- 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
AbstractWe consider method of lines solutions of partial differential equations on shared-memory par...
Abstract This paper shows a concept for parallelization of double Divide and Conquer and its prelimi...
The parallel solution of initial value problems for ordinary differential equations (ODE-IVPs) has b...
Abstract. The problem tackled in this paper is the parallel construction of a unit triangular matrix...
The goal of this survey is to give a view of the state-of-the-art of computing the Singular Value De...
Due to the character of the original source materials and the nature of batch digitization, quality ...
this paper we propose an algorithm based on Laguerre's iteration, rank two divide-and-conquer t...
The system of equations that govern kinematically redundant manipulators is commonly solved by #ndin...
The project aims to address the development of parallel codes for the solution of large- and huge-sc...
Abstract. The aim of this paper is to study the possibility of obtaining the numerical solution of t...
This paper describes and tests a parallel implementation of a factorized approximate inverse precond...
Our aim in this book is to present and enlarge upon those aspects of parallel computing that are nee...
An implementation of the backfitting algorithm for generalised additive models which is suitable for...
An implementation of the backfitting algorithm for generalised additive models which is suitable for...
An efficient parallel approach for the computation of the eigenvalue of smallest absolute magnitude ...
AbstractWe consider method of lines solutions of partial differential equations on shared-memory par...
Abstract This paper shows a concept for parallelization of double Divide and Conquer and its prelimi...
The parallel solution of initial value problems for ordinary differential equations (ODE-IVPs) has b...
Abstract. The problem tackled in this paper is the parallel construction of a unit triangular matrix...
The goal of this survey is to give a view of the state-of-the-art of computing the Singular Value De...
Due to the character of the original source materials and the nature of batch digitization, quality ...
this paper we propose an algorithm based on Laguerre's iteration, rank two divide-and-conquer t...
The system of equations that govern kinematically redundant manipulators is commonly solved by #ndin...
The project aims to address the development of parallel codes for the solution of large- and huge-sc...
Abstract. The aim of this paper is to study the possibility of obtaining the numerical solution of t...
This paper describes and tests a parallel implementation of a factorized approximate inverse precond...
Our aim in this book is to present and enlarge upon those aspects of parallel computing that are nee...
An implementation of the backfitting algorithm for generalised additive models which is suitable for...
An implementation of the backfitting algorithm for generalised additive models which is suitable for...
An efficient parallel approach for the computation of the eigenvalue of smallest absolute magnitude ...
AbstractWe consider method of lines solutions of partial differential equations on shared-memory par...
Abstract This paper shows a concept for parallelization of double Divide and Conquer and its prelimi...
The parallel solution of initial value problems for ordinary differential equations (ODE-IVPs) has b...