Parallel algorithms for linear models
numerical methods and estimation problems
Our rough guess is there are 45,500 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 2 minutes to read. With a half hour per day, this will take 6 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Publication
2000 - Kluwer Academic, Boston, Massachusetts
Language
English
Word Count
45,500 words, Guess
Page Count
182 pages
Identifiers
- Open LibraryOL20643259M
- ISBN-100792377206
- OCLC Control Number42753455
- Library of Congress Control Number99056040
- Goodreads4667780
and 1 more
- LibraryThing8127360
Classifications
- DDC519.5/35
- LCCQA276 .K645 2000
Description
"Parallel Algorithms for Linear Models provides a complete and detailed account of the design, analysis and implementation of parallel algorithms for solving large-scale linear models. It investigates and presents efficient, numerically stable algorithms for computing the least-squares estimators and other quantities of interest on massively parallel systems.". "The practical issues of the parallel algorithms and the theoretical aspects of the numerical methods will be of interest to a broad range of researchers working in the areas of numerical and computational methods in statistics and econometrics, parallel numerical algorithms, parallel computing and numerical linear algebra. The aim of this monograph is to promote research in the interface of econometrics, computational statistics, numerical linear algebra and parallelism."--BOOK JACKET.
Subjects
Topics
Series Statement
- Advances in computational economics -- v. 15
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!