Low Rank Approximation
Algorithms, Implementation, Applications
(Sprache: Englisch)
This book details the theory, algorithms, and applications of structured low-rank approximation, and presents efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel and Sylvester structured problems and more.
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
Fr. 146.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Low Rank Approximation “
This book details the theory, algorithms, and applications of structured low-rank approximation, and presents efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel and Sylvester structured problems and more.
Klappentext zu „Low Rank Approximation “
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.
Inhaltsverzeichnis zu „Low Rank Approximation “
Introduction.- From Data to Models.- Applications in System and Control Theory.- Applications in Signal Processing.- Applications in Computer Algebra.- Applications in Machine Learing.- Subspace-type Algorithms.- Algorithms Based on Local Optimization.- Data Smoothing and Filtering.- Recursive Algorithms.
Autoren-Porträt von Ivan Markovsky
Dr. Ivan Markovsky completed his PhD in the Electrical Engineering Department of the Katholieke Universiteit Leuven, Belgium under the supervision of S. Van Huffel, B. De Moor, and J.C. Willems. He was a postdoctoral researcher at the same department, and since January 2007, he has been a lecturer at the School of Electronics and Computer Science of the University of Southampton. His research interests are in system identification in the behavioural setting, total least squares, errors-in-variables estimation, and data-driven control; topics on which he has published 23 journal papers and one monograph (with SIAM). Dr. Markovsky won Honorable Mention in the Alston Householder Prize for best dissertation in numerical linear algebra. He is a co-organiser of the Fourth International Workshop on Total Least Squares and Errors-in-Variables Modelling, a guest editor of Signal Processing for a special issue on total least squares, and an associate editor of the International Journal of Control.
Bibliographische Angaben
- Autor: Ivan Markovsky
- 2014, 2012, X, 258 Seiten, Masse: 15,5 x 23,6 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 1447158369
- ISBN-13: 9781447158363
Sprache:
Englisch
Pressezitat
From the reviews:"This is a carefully-elaborated monographic work on low rank approximation. It covers the state of the art in this field (key theoretical topics accompanied by the description of the associated algorithms) and discusses various classes of applications. The book provides a rigorous and self-contained material, including numerical examples implemented in MATLAB and a collection of relevant problems. The exposition corresponds to a postgraduate level." (Octavian Pastravanu, Zentralblatt MATH, Vol. 1245, 2012)
"This book gently takes the reader from the basic ideas of LRA to the most critical concepts, with an adequate number of examples to explain things along the way. ... Markovsky has presented LRA in a way that is unifying and cross-disciplinary. The pages abound with code, examples, applications, and problems, from which readers can pick according to their own interests and without the risk of losing the main thread of the book. ... it is a good reference for students, practitioners, and researchers." (Corrado Mencar, ACM Computing Reviews, December, 2012)
Kommentar zu "Low Rank Approximation"
0 Gebrauchte Artikel zu „Low Rank Approximation“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Low Rank Approximation".
Kommentar verfassen