Algorithms for Sparse Linear Systems

Name: Algorithms for Sparse Linear Systems
Brand: Springer Nature
SKU: 9783031258190
Availability: InStock

Best Price (Coupon Required):
Buy Algorithms for Sparse Linear Systems for $45.00 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $49.99 - $49.99

BEST PRICE

Single Product Purchase

$45.00

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$49.99	$49.99		10% OFF This deals requires coupon	$45.00		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783031258190

Condition

New

Product Description

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers. A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners. Theoretical results are complemented by sparse matrix algorithm outlines. This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparse systems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics.

Available Colors

N/A

Available Sizes

N/A