Spectral methods refer to the use of eigenvalues, eigenvectors, singular values and singular vectors. They are widely used in Engineering, Applied Mathematics and Statistics. More recently, spectral methods have found numerous applications in Computer Science to "discrete" as well "continuous" problems. Spectral Algorithms describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. The first part of the book presents applications of spectral methods to problems from a variety ...
Read More
Spectral methods refer to the use of eigenvalues, eigenvectors, singular values and singular vectors. They are widely used in Engineering, Applied Mathematics and Statistics. More recently, spectral methods have found numerous applications in Computer Science to "discrete" as well "continuous" problems. Spectral Algorithms describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. The first part of the book presents applications of spectral methods to problems from a variety of topics including combinatorial optimization, learning and clustering. The second part of the book is motivated by efficiency considerations. A feature of many modern applications is the massive amount of input data. While sophisticated algorithms for matrix computations have been developed over a century, a more recent development is algorithms based on "sampling on the y" from massive matrices. Good estimates of singular values and low rank approximations of the whole matrix can be provably derived from a sample. The main emphasis in the second part of the book is to present these sampling methods with rigorous error bounds. It also presents recent extensions of spectral methods from matrices to tensors and their applications to some combinatorial optimization problems.
Read Less
Add this copy of Spectral Algorithms to cart. $35.38, very good condition, Sold by Hay-on-Wye Booksellers rated 4.0 out of 5 stars, ships from Hereford, UNITED KINGDOM, published 2009 by Now Publishers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very Good. Minor wear at extremities. Faint storage marks/scratches to cover. Text as new and unread. Trade paperback (US). Glued binding. 152 p. Contains: Illustrations, black & white. Foundations and Trends(r) in Theoretical Computer Science, 13.
Add this copy of Spectral Algorithms to cart. $85.03, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2009 by Now Publishers.
Add this copy of Spectral Algorithms to cart. $97.57, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2009 by Now Publishers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 152 p. Foundations and Trends(r) in Theoretical Computer Science, 13. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Spectral Algorithms to cart. $114.72, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2009 by Now Publishers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 152 p. Foundations and Trends(r) in Theoretical Computer Science, 13. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
