Booktopia has been placed into Voluntary Administration. Orders have been temporarily suspended, whilst the process for the recapitalisation of Booktopia and/or sale of its business is completed, following which services may be re-established. All enquiries from creditors, including customers with outstanding gift cards and orders and placed prior to 3 July 2024, please visit https://www.mcgrathnicol.com/creditors/booktopia-group/

Low Rank Approximation

Algorithms, Implementation, Applications

By: Ivan Markovsky

Write A Review

eBook | 7 March 2016

At a Glance

Format
ePUB

eBook

RRP $179.00

$161.99

10%OFF

or 4 interest-free payments of $40.50 with

Instant Digital Delivery to your Booktopia Reader App

Data Approximation by Low-complexity Models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory including: system and control theory; signal processing; computer algebra for approximate factorization and common divisor computation; computer vision for image deblurring and segmentation; machine learning for information retrieval and clustering; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; and psychometrics for factor analysis.

Software implementation of the methods is given, making the theory directly applicable in practice. All numerical examples are included in demonstration files giving hands-on experience and exercises and MATLAB® examples assist in the assimilation of the theory.