High Performance Algorithms for Structured Matrix Problems


Book Description

Comprises 10 contributions that summarize the state of the art in the areas of high performance solutions of structured linear systems and structured eigenvalue and singular-value problems. Topics covered range from parallel solvers for sparse or banded linear systems to parallel computation of eigenvalues and singular values of tridiagonal and bidiagonal matrices. Specific paper topics include: the stable parallel solution of general narrow banded linear systems; efficient algorithms for reducing banded matrices to bidiagonal and tridiagonal form; a numerical comparison of look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems; and parallel CG-methods automatically optimized for PC and workstation clusters. Annotation copyrighted by Book News, Inc., Portland, OR







Polynomial and Matrix Computations


Book Description

Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, [AHU] and [BM] (these topics have been under-represented in [CLR], which is a highly successful extension and updating of [AHU] otherwise). Compared to [AHU] and [BM] our volume adds extensive material on parallel com putations with general matrices and polynomials, on the bit-complexity of arithmetic computations (including some recent techniques of data compres sion and the study of numerical approximation properties of polynomial and matrix algorithms), and on computations with Toeplitz matrices and other dense structured matrices. The latter subject should attract people working in numerous areas of application (in particular, coding, signal processing, control, algebraic computing and partial differential equations). The au thors' teaching experience at the Graduate Center of the City University of New York and at the University of Pisa suggests that the book may serve as a text for advanced graduate students in mathematics and computer science who have some knowledge of algorithm design and wish to enter the exciting area of algebraic and numerical computing. The potential readership may also include algorithm and software designers and researchers specializing in the design and analysis of algorithms, computational complexity, alge braic and symbolic computing, and numerical computation.




Parallel Algorithms and Cluster Computing


Book Description

This book presents advances in high performance computing as well as advances accomplished using high performance computing. It contains a collection of papers presenting results achieved in the collaboration of scientists from computer science, mathematics, physics, and mechanical engineering. From science problems to mathematical algorithms and on to the effective implementation of these algorithms on massively parallel and cluster computers, the book presents state-of-the-art methods and technology, and exemplary results in these fields.







Introduction to Matrix Computations


Book Description

Numerical linear algebra is far too broad a subject to treat in a single introductory volume. Stewart has chosen to treat algorithms for solving linear systems, linear least squares problems, and eigenvalue problems involving matrices whose elements can all be contained in the high-speed storage of a computer. By way of theory, the author has chosen to discuss the theory of norms and perturbation theory for linear systems and for the algebraic eigenvalue problem. These choices exclude, among other things, the solution of large sparse linear systems by direct and iterative methods, linear programming, and the useful Perron-Frobenious theory and its extensions. However, a person who has fully mastered the material in this book should be well prepared for independent study in other areas of numerical linear algebra.




Advances in Computational Methods in Sciences and Engineering 2005 (2 vols)


Book Description

This volume brings together selected contributed papers presented at the International Conference of Computational Methods in Science and Engineering (ICCMSE 2005), held in Greece, 21 aEURO" 26 October 2005. The conference aims to bring together computational scientists from several disciplines in order to share methods and ideas. The ICCMSE is unique in its kind. It regroups original contributions from all fields of the traditional Sciences, Mathematics, Physics, Chemistry, Biology, Medicine and all branches of Engineering. It would be perhaps more appropriate to define the ICCMSE as a conference on computational science and its applications to science and engineering. Topics of general interest are: Computational Mathematics, Theoretical Physics and Theoretical Chemistry. Computational Engineering and Mechanics, Computational Biology and Medicine, Computational Geosciences and Meteorology, Computational Economics and Finance, Scientific Computation. High Performance Computing, Parallel and Distributed Computing, Visualization, Problem Solving Environments, Numerical Algorithms, Modelling and Simulation of Complex System, Web-based Simulation and Computing, Grid-based Simulation and Computing, Fuzzy Logic, Hybrid Computational Methods, Data Mining, Information Retrieval and Virtual Reality, Reliable Computing, Image Processing, Computational Science and Education etc. More than 800 extended abstracts have been submitted for consideration for presentation in ICCMSE 2005. From these 500 have been selected after international peer review by at least two independent reviewers.




Structure-Preserving Doubling Algorithms for Nonlinear Matrix Equations


Book Description

Nonlinear matrix equations arise frequently in applied science and engineering. This is the first book to provide a unified treatment of structure-preserving doubling algorithms that have been recently studied and proven effective for notoriously challenging problems, such as fluid queue theory and vibration analysis for high speed trains; present recent developments and results for the theory of doubling algorithms for nonlinear matrix equations associated with regular matrix pencils; and highlight the use of doubling algorithms in achieving robust solutions for notoriously challenging problems that other methods cannot.? Structure-Preserving Doubling Algorithms for Nonlinear Matrix Equations is intended for researchers and computational scientists, and graduate students may also find it of interest.




Structured Matrices in Mathematics, Computer Science, and Engineering II


Book Description

"The collection of the contributions to these volumes offers a flavor of the plethora of different approaches to attack structured matrix problems. The reader will find that the theory of structured matrices is positioned to bridge diverse applications in the sciences and engineering, deep mathematical theories, as well as computational and numberical issues. The presentation fully illustrates the fact that the technicques of engineers, mathematicisn, and numerical analysts nicely complement each other, and they all contribute to one unified theory of structured matrices"--Back cover.




Combinatorial Scientific Computing


Book Description

Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems. The book offers a state-of-the-art overview of the latest research, tool development, and applications. It focuses on load balancing and parallelization on high-performance computers, large-scale optimization, algorithmic differentiation of numerical simulation code, sparse matrix software tools, and combinatorial challenges and applications in large-scale social networks. The authors unify these seemingly disparate areas through a common set of abstractions and algorithms based on combinatorics, graphs, and hypergraphs. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations and their importance continues to grow with the demands of new applications and advanced architectures. By addressing current challenges in the field, this volume sets the stage for the accelerated development and deployment of fundamental enabling technologies in high-performance scientific computing.