|
Showing 1 - 4 of
4 matches in All Departments
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.
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.
This contributed volume highlights two areas of fundamental
interest in high-performance computing: core algorithms for
important kernels and computationally demanding applications. The
first few chapters explore algorithms, numerical techniques, and
their parallel formulations for a variety of kernels that arise in
applications. The rest of the volume focuses on state-of-the-art
applications from diverse domains. By structuring the volume around
these two areas, it presents a comprehensive view of the
application landscape for high-performance computing, while also
enabling readers to develop new applications using the kernels.
Readers will learn how to choose the most suitable parallel
algorithms for any given application, ensuring that theory and
practicality are clearly connected. Applications using these
techniques are illustrated in detail, including: Computational
materials science and engineering Computational cardiovascular
analysis Multiscale analysis of wind turbines and turbomachinery
Weather forecasting Machine learning techniques Parallel Algorithms
in Computational Science and Engineering will be an ideal reference
for applied mathematicians, engineers, computer scientists, and
other researchers who utilize high-performance computing in their
work.
This contributed volume highlights two areas of fundamental
interest in high-performance computing: core algorithms for
important kernels and computationally demanding applications. The
first few chapters explore algorithms, numerical techniques, and
their parallel formulations for a variety of kernels that arise in
applications. The rest of the volume focuses on state-of-the-art
applications from diverse domains. By structuring the volume around
these two areas, it presents a comprehensive view of the
application landscape for high-performance computing, while also
enabling readers to develop new applications using the kernels.
Readers will learn how to choose the most suitable parallel
algorithms for any given application, ensuring that theory and
practicality are clearly connected. Applications using these
techniques are illustrated in detail, including: Computational
materials science and engineering Computational cardiovascular
analysis Multiscale analysis of wind turbines and turbomachinery
Weather forecasting Machine learning techniques Parallel Algorithms
in Computational Science and Engineering will be an ideal reference
for applied mathematicians, engineers, computer scientists, and
other researchers who utilize high-performance computing in their
work.
|
|