Share

A New Class of Fast Divide-And-Conquer Algorithms for the Real Symmetric Tridiagonal Eigenvalue Problem.

Download A New Class of Fast Divide-And-Conquer Algorithms for the Real Symmetric Tridiagonal Eigenvalue Problem. PDF Online Free

Author :
Release : 2011-10-01
Genre :
Kind : eBook
Book Rating : 813/5 ( reviews)

GET EBOOK


Book Synopsis A New Class of Fast Divide-And-Conquer Algorithms for the Real Symmetric Tridiagonal Eigenvalue Problem. by : Edouard Scott Coakley

Download or read book A New Class of Fast Divide-And-Conquer Algorithms for the Real Symmetric Tridiagonal Eigenvalue Problem. written by Edouard Scott Coakley. This book was released on 2011-10-01. Available in PDF, EPUB and Kindle. Book excerpt: The computation of the eigenvalues and orthogonal eigenvectors of an N x N real symmetric tridiagonal matrix is a well known problem in numerical analysis. The problem frequently arises in the determination of eigenvalues and eigenvectors of dense and banded symmetric matrices and in connection with various families of orthogonal polynomials and special functions satisfying three term recurrence relations. Numerous algorithms exist for the solution of this problem, which typically require O(N2) operations for the determination of eigenvalues and O(N3) operations for the determination of orthogonal eigenvectors.In this thesis we propose a new class of fast algorithms for the computation of the eigenvalues of a symmetric tridiagonal matrix in O( N ln N) operations. Such an algorithm may be combined with any one of the existing methods for the determination of eigenvectors of a symmetric tridiagonal matrix with known eigenvalues. The underlying technique is a divide-and-conquer approach which determines eigenvalues of a larger tridiagonal matrix from those of constituent matrices by the use of relations of their characteristic polynomials. The evaluation of characteristic polynomials is accelerated by the use of a technique known as the Fast Multipole Method. We provide a detailed presentation of a prototype for this class of algorithms and discuss several generalizations.An implementation of a prototype for this class of algorithms has been developed in FORTRAN, which serves to provide a comparison with existing techniques in terms of running time and accuracy. We present numerical results which demonstrate the effectiveness of the method.

Parallelizing the Divide and Conquer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem on Distributed Memory Architectures

Download Parallelizing the Divide and Conquer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem on Distributed Memory Architectures PDF Online Free

Author :
Release : 1998
Genre : Applied mathematics
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Parallelizing the Divide and Conquer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem on Distributed Memory Architectures by : Francoise Tisseur

Download or read book Parallelizing the Divide and Conquer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem on Distributed Memory Architectures written by Francoise Tisseur. This book was released on 1998. Available in PDF, EPUB and Kindle. Book excerpt:

A Serial Implementation of Cuppen's Divide and Conguer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem

Download A Serial Implementation of Cuppen's Divide and Conguer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem PDF Online Free

Author :
Release : 1994
Genre : Dissertations, Academic
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis A Serial Implementation of Cuppen's Divide and Conguer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem by : Jeffery David Rutter

Download or read book A Serial Implementation of Cuppen's Divide and Conguer Algorithm for the Symmetric Tridiagonal Eigenvalue Problem written by Jeffery David Rutter. This book was released on 1994. Available in PDF, EPUB and Kindle. Book excerpt:

A Coarse-grain Parallel Implementation of the Block Tridiagonal Divide and Conquer Algorithm for Symmetric Eigenproblems

Download A Coarse-grain Parallel Implementation of the Block Tridiagonal Divide and Conquer Algorithm for Symmetric Eigenproblems PDF Online Free

Author :
Release : 2003
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis A Coarse-grain Parallel Implementation of the Block Tridiagonal Divide and Conquer Algorithm for Symmetric Eigenproblems by :

Download or read book A Coarse-grain Parallel Implementation of the Block Tridiagonal Divide and Conquer Algorithm for Symmetric Eigenproblems written by . This book was released on 2003. Available in PDF, EPUB and Kindle. Book excerpt: Cuppen's divide and conquer technique for symmetric tridiagonal eigenproblems, along with Gu and Eisenstat's modification for improvement of the eigenvector computation, has yielded a stable, efficient, and widely-used algorithm. This algorithm has now been extended to a larger class of matrices, namely symmetric block tridiagonal eigenproblems. The Block Tridiagonal Divide and Conquer algorithm has shown several characteristics that make it suitable for a number of applications, such as the Self-Consistent-Field procedure in quantum chemistry. This thesis discusses the steps taken to implement a coarse-grain parallel version of the Block Tridiagonal Divide and Conquer algorithm, suitable for a parallel supercomputer or a cluster of machines. The parallel version relies on components of the ScaLAPACK parallel linear algebra library and follows the same model as the serial code, including the implementation of full deflation. A modest speedup (2 to 3) was achieved using a few processors (4 and 16). Increasing the number of processors from 4 to 16 produced only slightly better speedup. This implementation was not competitive with the standard ScaLAPACK symmetric eigenvalue routine.

Separable Type Representations of Matrices and Fast Algorithms

Download Separable Type Representations of Matrices and Fast Algorithms PDF Online Free

Author :
Release : 2013-10-08
Genre : Mathematics
Kind : eBook
Book Rating : 124/5 ( reviews)

GET EBOOK


Book Synopsis Separable Type Representations of Matrices and Fast Algorithms by : Yuli Eidelman

Download or read book Separable Type Representations of Matrices and Fast Algorithms written by Yuli Eidelman. This book was released on 2013-10-08. Available in PDF, EPUB and Kindle. Book excerpt: This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number of illustrative examples throughout the different chapters. The second volume, consisting of four parts, addresses the eigenvalue problem for matrices with quasiseparable structure and applications to the polynomial root finding problem. In the first part the properties of the characteristic polynomials of principal leading submatrices, the structure of eigenspaces and the basic methods to compute eigenvalues are studied in detail for matrices with quasiseparable representation of the first order. The second part is devoted to the divide and conquer method, with the main algorithms being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the third part. This method is then used in the last part in order to get a fast solver for the polynomial root finding problem. The work is based mostly on results obtained by the authors and their coauthors. Due to its many significant applications and the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike.

You may also like...