國立高雄大學圖資館 |

Parallelism in matrix computations

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Parallelism in matrix computationsby Efstratios Gallopoulos, Bernard Philippe, Ahmed H. Sameh.
作者:	Gallopoulos, Efstratios.
其他作者:	Philippe, Bernard.
出版者:	Dordrecht :Springer Netherlands :2016.
面頁冊數:	xxx, 473 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Parallel processing (Electronic computers)
電子資源:	http://dx.doi.org/10.1007/978-94-017-7188-7
ISBN:	9789401771887$q(electronic bk.)

Parallelism in matrix computations
Gallopoulos, Efstratios.

Parallelism in matrix computations[electronic resource] /by Efstratios Gallopoulos, Bernard Philippe, Ahmed H. Sameh. - Dordrecht :Springer Netherlands :2016. - xxx, 473 p. :ill., digital ;24 cm. - Scientific computation,1434-8322. - Scientific computation..

List of Figures -- List of Tables -- List of Algorithms -- Notations used in the book -- Part I Basics -- Parallel Programming Paradigms -- Computational Models -- Principles of parallel programming -- Fundamental kernels -- Vector operations -- Higher level BLAS -- General organization for dense matrix factorizations -- Sparse matrix computations -- Part II Dense and special matrix computations -- Recurrences and triangular systems -- Definitions and examples -- Linear recurrences -- Implementations for a given number of processors -- Nonlinear recurrences -- General linear systems -- Gaussian elimination -- Pair wise pivoting -- Block LU factorization -- Remarks -- Banded linear systems -- LUbased schemes with partial pivoting -- The Spike family of algorithms -- The Spike balance scheme -- A tearing based banded solver -- Tridiagonal systems -- Special linear systems -- Vandermonde solvers -- Banded Toeplitz linear systems solvers -- Symmetric and Anti symmetric Decomposition (SAS) -- Rapid elliptic solvers -- Orthogonal factorization and linear least squares problems -- Definitions -- QR factorization via Givens rotations -- QR factorization via Householder reductions -- Gram Schmidt orthogonalization -- Normal equations vs. orthogonal reductions -- Hybrid algorithms when m>>n -- Orthogonal factorization of block angular matrices -- Rank deficient linear least squares problems -- The symmetric eigenvalue and singular value problems -- The Jacobi algorithms -- Tridiagonalization based schemes -- Bidiagonalization via Householder reduction -- Part III Sparse matrix computations -- Iterative schemes for large linear systems -- An example -- Classical splitting methods -- Polynomial methods -- Preconditioners -- A tearing based solver for generalized banded preconditioners -- Row projection methods for large non symmetric linear systems -- Multiplicative Schwarz preconditioner with GMRES -- Large symmetric eigenvalue problems -- Computing dominant eigenpairs and spectral transformations -- The Lanczos method -- A block Lanczos approach for solving symmetric perturbed standard eigenvalue problems -- The Davidson methods -- The trace minimization method for the symmetric generalized eigenvalue problem -- The sparse singular value problem -- Part IV Matrix functions and characteristics -- Matrix functions and the determinant -- Matrix functions -- Determinants -- Computing the matrix pseudospectrum -- Grid based methods -- Dimensionality reduction on the domain: Methods based on path following -- Dimensionality reduction on the matrix: Methods based on projection -- Notes -- References.

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 singular-value 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 state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.

ISBN: 9789401771887$q(electronic bk.)

Standard No.: 10.1007/978-94-017-7188-7doiSubjects--Topical Terms:

184697
Parallel processing (Electronic computers)

LC Class. No.: QA76.58

Dewey Class. No.: 004.35

Parallelism in matrix computations
LDR:05718nmm a2200325 a 4500 001 480993
003 DE-He213
005 20160713142335.0
006 m d
007 cr nn 008maaau
008 161007s2016 ne s 0 eng d
020 $a 9789401771887$q(electronic bk.)
020 $a 9789401771870$q(paper)
024 7 $a 10.1007/978-94-017-7188-7 $2 doi
035 $a 978-94-017-7188-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.58
072 7 $a TBJ $2 bicssc
072 7 $a MAT003000 $2 bisacsh
082 0 4 $a 004.35 $2 23
090 $a QA76.58 $b .G173 2016
100 1 $a Gallopoulos, Efstratios. $3 736706
245 1 0 $a Parallelism in matrix computations $h [electronic resource] / $c by Efstratios Gallopoulos, Bernard Philippe, Ahmed H. Sameh.
260 $a Dordrecht : $b Springer Netherlands : $b Imprint: Springer, $c 2016.
300 $a xxx, 473 p. : $b ill., digital ; $c 24 cm.
490 1 $a Scientific computation, $x 1434-8322
505 0 $a List of Figures -- List of Tables -- List of Algorithms -- Notations used in the book -- Part I Basics -- Parallel Programming Paradigms -- Computational Models -- Principles of parallel programming -- Fundamental kernels -- Vector operations -- Higher level BLAS -- General organization for dense matrix factorizations -- Sparse matrix computations -- Part II Dense and special matrix computations -- Recurrences and triangular systems -- Definitions and examples -- Linear recurrences -- Implementations for a given number of processors -- Nonlinear recurrences -- General linear systems -- Gaussian elimination -- Pair wise pivoting -- Block LU factorization -- Remarks -- Banded linear systems -- LUbased schemes with partial pivoting -- The Spike family of algorithms -- The Spike balance scheme -- A tearing based banded solver -- Tridiagonal systems -- Special linear systems -- Vandermonde solvers -- Banded Toeplitz linear systems solvers -- Symmetric and Anti symmetric Decomposition (SAS) -- Rapid elliptic solvers -- Orthogonal factorization and linear least squares problems -- Definitions -- QR factorization via Givens rotations -- QR factorization via Householder reductions -- Gram Schmidt orthogonalization -- Normal equations vs. orthogonal reductions -- Hybrid algorithms when m>>n -- Orthogonal factorization of block angular matrices -- Rank deficient linear least squares problems -- The symmetric eigenvalue and singular value problems -- The Jacobi algorithms -- Tridiagonalization based schemes -- Bidiagonalization via Householder reduction -- Part III Sparse matrix computations -- Iterative schemes for large linear systems -- An example -- Classical splitting methods -- Polynomial methods -- Preconditioners -- A tearing based solver for generalized banded preconditioners -- Row projection methods for large non symmetric linear systems -- Multiplicative Schwarz preconditioner with GMRES -- Large symmetric eigenvalue problems -- Computing dominant eigenpairs and spectral transformations -- The Lanczos method -- A block Lanczos approach for solving symmetric perturbed standard eigenvalue problems -- The Davidson methods -- The trace minimization method for the symmetric generalized eigenvalue problem -- The sparse singular value problem -- Part IV Matrix functions and characteristics -- Matrix functions and the determinant -- Matrix functions -- Determinants -- Computing the matrix pseudospectrum -- Grid based methods -- Dimensionality reduction on the domain: Methods based on path following -- Dimensionality reduction on the matrix: Methods based on projection -- Notes -- References.
520 $a 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 singular-value 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 state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.
650 0 $a Parallel processing (Electronic computers) $3 184697
650 0 $a Matrices. $3 181876
650 0 $a Computer algorithms. $3 184478
650 1 4 $a Engineering. $3 210888
650 2 4 $a Appl.Mathematics/Computational Methods of Engineering. $3 273758
650 2 4 $a Computational Science and Engineering. $3 274685
650 2 4 $a Numerical and Computational Physics. $3 384722
650 2 4 $a Mathematics of Computing. $3 273710
650 2 4 $a Computer-Aided Engineering (CAD, CAE) and Design. $3 274500
700 1 $a Philippe, Bernard. $3 736707
700 1 $a Sameh, Ahmed H. $3 736708
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Scientific computation. $3 561432
856 4 0 $u http://dx.doi.org/10.1007/978-94-017-7188-7
950 $a Engineering (Springer-11647)