Fast Matrix Multiplication with Applications
Springer International Publishing (Verlag)
978-3-031-76929-0 (ISBN)
- Noch nicht erschienen - erscheint am 03.02.2025
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
This book shows the methods of constructing fast matrix multiplication algorithms and gives an introduction to the fast matrix multiplication algorithms. The scope and coverage of the book are comprehensive and constructive, and the analyses and algorithms can be readily applied by readers from various disciplines of science and technology who need modern tools and techniques related to fast matrix multiplication and related problems and techniques. Authors start from commutative algorithms, through exact non-commutative algorithms, partial algorithms to disjoint and arbitrary precision algorithms. Authors explain how to adapt disjoint algorithms to a single matrix multiplication and prove the famous tau-theorem in the (not so) special case. In an appendix, authors show how to work with confluent Vandermonde matrices, since they are used as an auxiliary tool in problems arising in fast matrix multiplication. Importantly, each algorithm is demonstrated by a concrete example of a decent dimensionality to ensure that all the mechanisms of the algorithms are illustrated. Finally, authors give a series of applications of fast matrix multiplication algorithms in linear algebra and other types of problems, including artificial intelligence, are presented.
Introduction.- Commutative matrix multiplication algorithms.- The exact non-commutative algorithms.- Triple disjoint algorithms with application to feasible matrix multiplication.- Arbitrary Precision Approximating Algorithms.- From disjoint to single matrix multiplication.- From partial to total matrix multiplication.- Summary of fast matrix multiplication algorithms.- Applications of the Fast Matrix Multiplication Algorithms.- Efficient Algorithms for Logical Matrices.- Appendix - Algorithms for (confluent) Vandermonde matrices.
| Erscheint lt. Verlag | 3.2.2025 |
|---|---|
| Reihe/Serie | Studies in Big Data |
| Zusatzinfo | Approx. 270 p. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Datenbanken |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Technik | |
| Schlagworte | Fast Matrix Multiplication • Fast Matrix Multiplication Algorithms • Feasible Matrix Multiplication • Partial Matrix Multiplication • Total Matrix Multiplication |
| ISBN-10 | 3-031-76929-5 / 3031769295 |
| ISBN-13 | 978-3-031-76929-0 / 9783031769290 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
