Numerical Linear Algebra and Optimization (Paperback)

Numerical Linear Algebra and Optimization covers the fundamentals of closely related topics: linear systems (linear equations and least-squares) and linear programming (optimizing a linear function subject to linear constraints). For each problem class, stable and efficient numerical algorithms intended for a finite-precision environment are derived and analyzed. In 1991, when the book first appeared, these topics were rarely taught with a unified perspective, and, somewhat surprisingly, this remains true almost 30 years later. As a result, some of the material in this book can be difficult to find elsewhere-in particular, techniques for updating the LU factorization, descriptions of the simplex method applied to all-inequality form, and the analysis of what happens when using an approximate inverse to solve Ax=b. This book is appropriate for students who want to learn about numerical techniques for solving linear systems and/or linear programming using the simplex method.

General

Imprint:	Society For Industrial & Applied Mathematics,U.S.
Country of origin:	United States
Series:	Classics in Applied Mathematics
Release date:	June 2021
Authors:	Philip E. Gill • Walter Murray • Margaret H. Wright
Dimensions:	182 x 233 x 29mm (L x W x T)
Format:	Paperback
Pages:	426
ISBN-13:	978-1-61197-656-4
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Optimization > Linear programming Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Promotions
LSN:	1-61197-656-1
Barcode:	9781611976564

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!