Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Numerical Algorithms And Problems (F.2.1) > Computations On Matrices (F.2.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 32 Reviews about "Computations On Matrices (F.2.1...)": Date Reviewed   Positive definite matrices Bhatia R., Princeton University Press, Princeton, NJ, 2015. 240 pp.  Type: Book (978-0-691168-25-8) This book will definitely be useful for specialists in algebra, that is, professional mathematicians. Although published in a series on applied mathematics, for an applied scientist it may be mainly a source of very general inspiration... May 20 2016   Parallelism in matrix computations Gallopoulos E., Philippe B., Sameh A., Springer Publishing Company, Incorporated, New York, NY, 2015. 473 pp.  Type: Book (978-9-401771-87-0) With applications from science to engineering to commerce, the importance of matrix computations cannot be overstated. Parallel methods are essential in this age of multiprocessor/multicore computers. This book covers parallel algorith... Nov 5 2015   On numerical modeling performance of generalized preconditioned methods Gravvanis G., Filelis-Papadopoulos C., Lipitakis E.  BCI 2013 (Proceedings of the 6th Balkan Conference in Informatics, Thessaloniki, Greece, Sep 19-21, 2013) 23-30, 2013.  Type: Proceedings The efficient solution of large sparse linear systems is critical for many applications, such as the one focused on in this paper. The problem arises from the discretization of elliptic boundary value problems and has a matrix with a s... Dec 11 2013   Sparse matrix factorization on massively parallel computers Gupta A., Koric S., George T.  SC 2009 (Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, Portland, OR, Nov 14-20, 2009) 1-12, 2009.  Type: Proceedings Gupta, Koric, and George consider direct methods for solving large sparse linear systems. As the authors themselves admit that “direct methods have a high asymptotic computational and memory requirement relative to iterative ... Jun 16 2010   Matrices, moments and quadrature with applications Golub G., Meurant G., PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2009. 376 pp.  Type: Book (978-0-691143-41-5) It is a well-known fact that the areas of numerical integration and orthogonal polynomials are closely related. It is much less known that there are also very strong ties between these two areas and matrix operations such as eigenvalue... May 27 2010   Combining building blocks for parallel multi-level matrix multiplication Hunold S., Rauber T., Rünger G. Parallel Computing 34(6-8): 411-426, 2008.  Type: Article It is well known that Strassen’s recursive matrix multiplication [1], replacing eight multiplication by seven, is not practicable for small matrices; however, it may be valuable for large ones. Hunold et al. propose a three-l... Oct 24 2008   The structural representation of proximity matrices with MATLAB Hubert L., Arabie P., Meulman J., Society for Industrial and Applied Mathematics, Philadelphia, PA, 2006. 214 pp.  Type: Book (9780898716078) This treatise concentrates on the structural representation of proximity matrices using the mathematical software package MATLAB. It contains three parts: “City-Block Scaling of One-dimensional and Multi-dimensional Matri... Mar 23 2007   Invariant subspaces of matrices with applications (Classics in Applied Mathematics 51) Gohberg I., Lancaster P., Rodman L., SIAM, Philadelphia, PA, 2006. 692 pp.  Type: Book (9780898716085) This is a reprint of a book originally published in 1986. When the first edition of the book appeared, it was highly praised as an advanced algebra text and reference. The 20 years that have passed since then have not diminished its im... Sep 21 2006   Generalized low rank approximations of matrices Ye J. Machine Learning 61(1-3): 167-191, 2005.  Type: Article In many areas of theoretical and applied sciences (such as physics, statistics, and scientific computing), dimensionality reduction is essential to make computations feasible.... Jul 13 2006   Efficient parallel factorization and solution of structured and unstructured linear systems Reif J. Journal of Computer and System Sciences 71(1): 86-143, 2005.  Type: Article This is a very interesting paper on the parallel complexity of basic problems of matrices with rational entries. The PRAM model is used, meaning the processor is capable of doing arithmetical and logical operations (addition, subtracti... Jun 23 2006       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy