Parallelism in Matrix Computations
Resource Information
The work Parallelism in Matrix Computations represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Parallelism in Matrix Computations
Resource Information
The work Parallelism in Matrix Computations represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Parallelism in Matrix Computations
 Statement of responsibility
 by Efstratios Gallopoulos, Bernard Philippe, Ahmed H. Sameh
 Subject

 Computeraided engineering
 Engineering
 Numerical and Computational Physics
 Physics
 Applied mathematics
 Appl.Mathematics/Computational Methods of Engineering
 Computer science  Mathematics
 Mathematics of Computing
 Electronic resources
 Computeraided engineering
 Engineering mathematics
 Engineering
 Engineering
 Computer science  Mathematics
 Physics
 Physics
 Applied mathematics
 Engineering mathematics
 Computational Science and Engineering
 Engineering mathematics
 Computer science  Mathematics
 Computeraided engineering
 ComputerAided Engineering (CAD, CAE) and Design
 Applied mathematics
 Language
 eng
 Summary
 This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singularvalue decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of parallel iterative linear system solvers with emphasis on scalable preconditioners, (b) parallel schemes for obtaining a few of the extreme eigenpairs or those contained in a given interval in the spectrum of a standard or generalized symmetric eigenvalue problem, and (c) parallel methods for computing a few of the extreme singular triplets. Part IV focuses on the development of parallel algorithms for matrix functions and special characteristics such as the matrix pseudospectrum and the determinant. The book also reviews the theoretical and practical background necessary when designing these algorithms and includes an extensive bibliography that will be useful to researchers and students alike. Â The book brings together many existing algorithms for the fundamental matrix computations that have a proven track record of efficient implementation in terms of data locality and data transfer on stateoftheart systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness
 Image bit depth
 0
 LC call number

 TA329348
 TA640643
 Literary form
 non fiction
 Series statement
 Scientific Computation,
Context
Context of Parallelism in Matrix ComputationsEmbed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/Tbeyh3AgZOs/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/Tbeyh3AgZOs/">Parallelism in Matrix Computations</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Parallelism in Matrix Computations
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/Tbeyh3AgZOs/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/Tbeyh3AgZOs/">Parallelism in Matrix Computations</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>