東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Fast matrix multiplication with appl...

Respondek, Jerzy S.

Linked to FindBook

Google Book

Amazon

博客來

Fast matrix multiplication with applications

Record Type:	Electronic resources : Monograph/item
Title/Author:	Fast matrix multiplication with applications/ by Jerzy S. Respondek.
Author:	Respondek, Jerzy S.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	ix, 249 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Matrices. -
Online resource:	https://doi.org/10.1007/978-3-031-76930-6
ISBN:	9783031769306

Fast matrix multiplication with applications
Respondek, Jerzy S.

Fast matrix multiplication with applications[electronic resource] /by Jerzy S. Respondek. - Cham :Springer Nature Switzerland :2025. - ix, 249 p. :ill. (some col.), digital ;24 cm. - Studies in big data,v. 1662197-6511 ;. - Studies in big data ;v. 166..

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.

The ambition of this monograph is to show the methods of constructing fast matrix multiplication algorithms, and their applications, in an intelligible way, accessible not only to mathematicians. 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.

ISBN: 9783031769306

Standard No.: 10.1007/978-3-031-76930-6doiSubjects--Topical Terms:

516894
Matrices.

LC Class. No.: QA188

Dewey Class. No.: 512.9434

Fast matrix multiplication with applications
LDR:02883nmm a2200337 a 4500 001 2409250
003 DE-He213
005 20250226120727.0
006 m d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031769306 $q (electronic bk.)
020 $a 9783031769290 $q (paper)
024 7 $a 10.1007/978-3-031-76930-6 $2 doi
035 $a 978-3-031-76930-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA188
072 7 $a UN $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UN $2 thema
082 0 4 $a 512.9434 $2 23
090 $a QA188 $b .R434 2025
100 1 $a Respondek, Jerzy S. $3 3782362
245 1 0 $a Fast matrix multiplication with applications $h [electronic resource] / $c by Jerzy S. Respondek.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a ix, 249 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Studies in big data, $x 2197-6511 ; $v v. 166
505 0 $a 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.
520 $a The ambition of this monograph is to show the methods of constructing fast matrix multiplication algorithms, and their applications, in an intelligible way, accessible not only to mathematicians. 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.
650 0 $a Matrices. $3 516894
650 0 $a Multiplication. $3 573587
650 1 4 $a Data Engineering. $3 3409361
650 2 4 $a Computational Intelligence. $3 1001631
650 2 4 $a Mathematical and Computational Engineering Applications. $3 3592737
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Studies in big data ; $v v. 166. $3 3782363
856 4 0 $u https://doi.org/10.1007/978-3-031-76930-6
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)