Da: SpringBooks, Berlin, Germania
Prima edizione
EUR 46,30
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: As New. 1. Auflage. Unread, like new. Immediately dispatched from Germany.
EUR 84,39
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 89,99
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 106,62
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Editore: Springer Netherlands, Springer Netherlands Okt 2016, 2016
ISBN 10: 9402403175 ISBN 13: 9789402403176
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 99,98
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware -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 sparsematrix 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 504 pp. Englisch.
Editore: Springer Netherlands, Springer Netherlands, 2016
ISBN 10: 9402403175 ISBN 13: 9789402403176
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 104,59
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 sparsematrix 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.
Editore: Springer Netherlands, Springer Netherlands Aug 2015, 2015
ISBN 10: 9401771871 ISBN 13: 9789401771870
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 106,99
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware -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 sparsematrix 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 504 pp. Englisch.
Editore: Springer Netherlands, Springer Netherlands, 2015
ISBN 10: 9401771871 ISBN 13: 9789401771870
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 111,53
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 sparsematrix 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.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 119,33
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Salish Sea Books, Bellingham, WA, U.S.A.
EUR 88,04
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Fine. 9401771871 Like New; Hardcover; Close to new condition; Covers are still glossy with straight" edge-corners; Unblemished textblock edges; The endpapers and all text pages are bright and unmarked; Binding is tight with a straight spine; This book will be stored and delivered in a sturdy cardboard box with foam padding; Medium Format (8.5" - 9.75" tall); Blue and gray covers with title in blue lettering; 2015, Springer-Verlag Publishing; 473 pages; "Parallelism in Matrix Computations (Scientific Computation)," by Efstratios Gallopoulos, et al.
EUR 130,03
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 140,86
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 154,34
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 473.
EUR 160,60
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 520 pages. French language. 9.25x6.50x1.50 inches. In Stock.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 105,81
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 114,90
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 168,69
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
Editore: Springer Netherlands Okt 2016, 2016
ISBN 10: 9402403175 ISBN 13: 9789402403176
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 99,98
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 504 pp. Englisch.
Editore: Springer Netherlands Aug 2015, 2015
ISBN 10: 9401771871 ISBN 13: 9789401771870
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 106,99
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 504 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 157,76
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 473.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 162,60
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 473.