We study preconditioners for the iterative solution of the linear systems arising in the implicit
time integration of the compressible Navier–Stokes equations. The spatial discretization is …

In scientific applications that involve dense matrices, checksum encodings have yielded"
algorithm-based fault tolerance"(ABFT) in the event of data corruption from either hard or …

Combinatorial techniques have become essential tools across the landscape of
computational science, and some of the combinatorial ideas undergirding these tools are …

In this short review paper, we examine the interplay between the solution of sparse linear
systems and combinatorics. Most of this strong association comes from the identification of …

In this paper we present a new incomplete factorization of a square matrix into triangular
factors in which we get standard LU or LDL^T factors (direct factors) and their inverses …

We present a new approach for approximate updates of factorized nonsymmetric
preconditioners for solving sequences of linear algebraic systems. This approach is …

In this paper, we study a class of modified incomplete Cholesky factorization preconditioners
LL T with two control parameters including dropping rules. Before computing …

稀疏线性方程组的高效求解是数值计算方向的研究热点之一, 其中包括预处理技术的研究.
本文从技术分类的角度, 总结了稀疏线性方程组求解中的预处理技术. 首先 …

The increasing scale and complexity of today's high-performance computing (HPC) systems
demand a renewed focus on enhancing the resilience of long-running scientific applications …

An incomplete Cholesky (IC) factorization with multi‐parameters is presented. The marked
virtue of the proposed IC factorization algorithm is to dynamically control the number of …