1532-0634/asset/olbannerleft.gif?v=1&s=a4e4e145787de94e1d91eaab3c8c29d8a9d96a26)
Research Article
Solving the block–Toeplitz least-squares problem in parallel
Article first published online: 29 NOV 2004
DOI: 10.1002/cpe.883
Copyright © 2005 John Wiley & Sons, Ltd.
Issue
1532-0634/asset/cover.gif?v=1&s=6094df24c795ce080ff6df6ff3b6bcec19adb708 "Concurrency and Computation: Practice and Experience")
Concurrency and Computation: Practice and Experience
Volume 17, Issue 1, pages 49–67, January 2005
Additional Information
How to Cite
Alonso, P., Badía, J. M. and Vidal, A. M. (2005), Solving the block–Toeplitz least-squares problem in parallel. Concurrency Computat.: Pract. Exper., 17: 49–67. doi: 10.1002/cpe.883
Publication History
- Issue published online: 29 NOV 2004
- Article first published online: 29 NOV 2004
- Manuscript Accepted: 14 JAN 2004
- Manuscript Revised: 28 OCT 2003
- Manuscript Received: 29 OCT 2002
Funded by
- Ministerio de Educación, Cultura y Deporte, Spain. Grant Number: CICYT TIC 2000-1683-C03-03
Options for accessing this content:
- If you have access to this content through a society membership, please first log in to your society website.
- If you would like institutional access to this content, please recommend the title to your librarian.
- Login via Athens http://onlinelibrary.wiley.com/athens or other institutional login options http://onlinelibrary.wiley.com/login-options .
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!