z-logo
open-access-imgOpen Access
Parallel computation of large least squares problems involving Kronecker products on the Connection Machine 5
Author(s) -
Charles T. Fulton,
Limin Wu
Publication year - 1995
Language(s) - English
Resource type - Reports
DOI - 10.2172/113992
Subject(s) - krylov subspace , solver , computer science , multigrid method , cuda , system of linear equations , iterative method , mathematics , preconditioner , linear system , linear algebra , sparse matrix , algorithm , mathematical optimization , parallel computing , partial differential equation , mathematical analysis , physics , geometry , quantum mechanics , gaussian
The authors present in this paper the implementation and some timing results for a Data Parallel Version of a Kronecker Product Least Squares Code on the Connection Machine 5

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom