JavaScript parece estar deshabilitado en tu navegador. Para la mejor experiencia en nuestro sitio, asegúrate de activar JavaScript en tu navegador.

SKU/Artículo: AMZ-3031258193

Algorithms for Sparse Linear Systems (Nečas Center Series)

Format:

Paperback

Detalles del producto

Disponibilidad:
En stock

Peso con empaque:
0.40 kg

Devolución:
No

Condición
Nuevo

Producto de:
Amazon

Viaja desde
USA

Sobre este producto

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.

U$S 95,20

49% OFF

U$S 48,82

NO CONSUME FRANQUICIA

Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.

U$S 95,20

49% OFF

U$S 48,82

Llega en 25 o más días hábiles

Tienes garantía de entrega

Medios de pago

Cantidad

Medios de pago

Aceptamos múltiples medios de pago para tu comodidad

Tarjetas prepagas, débito y crédito