Normal view MARC view ISBD view

Analysis and linear algebra : the singular value decomposition and applications

By: Bisgard, James.
Series: Student mathematical library.Publisher: Providence : American Mathematical Society, 2021Description: xviii, 217 p.; ill., 21 cm.ISBN: 978-1-4704-6332-8.Subject(s): Mathematical analysis | Normed Vector Spaces | Symmetric matrix | Spectral TheoremDDC classification: 512.5 Summary: This book provides an elementary analytically inclined journey to a fundamental result of linear algebra: the Singular Value Decomposition (SVD). SVD is a workhorse in many applications of linear algebra to data science. Four important applications relevant to data science are considered throughout the book: determining the subspace that ""best'' approximates a given set (dimension reduction of a data set); finding the ""best'' lower rank approximation of a given matrix (compression and general approximation problems); the Moore-Penrose pseudo-inverse (relevant to solving least squares problems); and the orthogonal Procrustes problem (finding the orthogonal transformation that most closely transforms a given collection to a given configuration), as well as its orientation-preserving version.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books 512.5 BIS (Browse shelf) Available 034977

Includes bibliographical references and indexes.

This book provides an elementary analytically inclined journey to a fundamental result of linear algebra: the Singular Value Decomposition (SVD). SVD is a workhorse in many applications of linear algebra to data science. Four important applications relevant to data science are considered throughout the book: determining the subspace that ""best'' approximates a given set (dimension reduction of a data set); finding the ""best'' lower rank approximation of a given matrix (compression and general approximation problems); the Moore-Penrose pseudo-inverse (relevant to solving least squares problems); and the orthogonal Procrustes problem (finding the orthogonal transformation that most closely transforms a given collection to a given configuration), as well as its orientation-preserving version.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha