• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Low Rank Approximation: Algorithms, Implementation, Applications

Low Rank Approximation: Algorithms, Implementation, Applications

Paperback

Series: Communications and Control Engineering

Technology & EngineeringGeneral ComputersGeneral Mathematics

Currently unavailable to order

ISBN10: 1447158369
ISBN13: 9781447158363
Publisher: Springer
Published: Jan 26 2014
Pages: 258
Weight: 0.84
Height: 0.56 Width: 6.10 Depth: 9.25
Language: English

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.

Also in

Technology & Engineering