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

稀疏线性系统的算法

数理逻辑与数学基础

原   价:
443.75
售   价:
355.00
优惠
平台大促 低至8折优惠
发货周期:国外库房发货,通常付款后6-8周到货!
作      者
出  版 社
出版时间
2023年03月21日
装      帧
平装
ISBN
9783031258190
复制
页      码
160
语      种
英文
版      次
1
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个