World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

AGGREGATING VARIABLES FOR ASYNCHRONOUS ITERATIONS

    The deteriorating effect of old history in asynchronous implementations of Jacobi-type iterative methods applied to linear least squares problem is well documented. A partially asynchronous algorithm is developed which employs a combination of synchronization, a relaxation parameter and an aggregation of variables. It is shown by numerical experiments that this combined effort to decrease the effect of old history is effective.

    References

    • M. C. Ferris and O. L. Mangasarian, SIAM J. Optim. 4, 815 (1994). CrossrefGoogle Scholar
    • T. Steihaug and Y. Yalçınkaya, Euro-Par'97 Parallel Processing, LNCS 1300, eds. C. Lengauer, M. Griebl and S. Gorlatch (Springer, Berlin Heidelberg, 1997) pp. 750–759. CrossrefGoogle Scholar
    • Y. Yalçınkaya and T. Steihaug, Proc. of the 15th IMACS World Congress on Scientific Computation, Modeling and Applied Mathematics, Vol. 1 Computational Mathematics, ed. A. Sydow (Wissenschaft & Technik Verlag, Berlin, 1997) pp. 535–540. Google Scholar
    • D. Chazan and W. L. Miranker, Linear Algebra and Appl. 2, 199 (1969). CrossrefGoogle Scholar
    • Y. Yalçınkaya and T. Steihaug, Euro-Par 2004 Parallel Processing, LNCS 3149, eds. M. Danelutto, D. Laforenza and M. Vanneschi (Springer, Berlin Heidelberg, 2004) pp. 698–707. CrossrefGoogle Scholar
    • J. E. Dennis Jr. and T. Steihaug, A Ferris-Mangasarian technique applied to linear least squares problems, Tech. Rep. No. 150, Department of Informatics, University of Bergen, Norway, 1998 . Google Scholar
    • D. P.   Bertsekas and J. N.   Tsitsiklis , Parallel and Distributed Computation, Numerical Methods ( Prentice-Hall , Englewood Cliffs, NJ , 1989 ) . Google Scholar
    • D. Amitaiet al., SIAM J. Sci. Comput. 19, 1355 (1998). ISIGoogle Scholar
    • Z.-Z. Bai, Parallel Comput. 25, 681 (1999). Crossref, ISIGoogle Scholar
    • A. Üresin and M. Dubois, J. Parallel Distrib. Comput. 34, 66 (1996). Crossref, ISIGoogle Scholar
    • R. A. Renaut, Numer. Linear Algebra Appl. 5, 11 (1998). Crossref, ISIGoogle Scholar
    • A. Frommer and R. A. Renaut, J. Comput. Appl. Math. 110, 205 (1999). Crossref, ISIGoogle Scholar
    • J. E. Dennis Jr. and T. Steihaug, SIAM J. Numer. Anal. 23, 717 (1986). Crossref, ISIGoogle Scholar
    • Y. Yalçınkaya, Reducing the Effect of Old History in Asynchronous Iterations: An Empirical Study, Dr. Scient. Thesis, University of Bergen, 2003 . Google Scholar
    • Y.   Yalçınkaya and T.   Steihaug , Proc. of the Sixth Meeting of the Nordic Section of the Mathematical Programming Society , eds. E.   Dotzauer , M.   Björkman and K.   Holmström ( Opuscula, Mälardalen University , Västerås , 1999 ) . Google Scholar
    • Y. Yalçınkaya and T. Steihaug, High Performance Computing and Networking, LNCS 1823, eds. M. Bubaket al. (Springer, Berlin Heidelberg, 2000) pp. 601–604. CrossrefGoogle Scholar
    • I. S. Duff and H. A. Van der Vorst, Parallel Comput. 25, 1931 (1999). Crossref, ISIGoogle Scholar
    • A. Frommer and D. B. Szyld, J. Comput. Appl. Math. 123, 201 (2000). Crossref, ISIGoogle Scholar
    • A. Frommer and B. Pohl, Numer. Linear Algebra Appl. 2, 335 (1995). Crossref, ISIGoogle Scholar
    • I. S. Duff, R. G. Grimes and J. G. Lewis, ACM Trans. Math. Softw. 15, 1 (1989). Crossref, ISIGoogle Scholar