Search NASA⌕ Search

Engineering topics

Nhan, Thái Anh

Publications and source records attributed to Nhan, Thái Anh.

Advantages of the Samarskii-type schemes on the Shishkin mesh

The schemes of the Samarskii type are simple modifications of the upwind scheme. We use them on the Shishkin mesh and discuss their advantages over the upwind scheme when applied to the linear one-dimensional singularly perturbed convection–diffusion problem. One of the advantages is that the Samarskii-type schemes have exact first-order accuracy uniform in the perturbation parameter, as opposed to the upwind scheme which is almost first-order uniformly accurate because its accuracy is diminished by logarithmic factors. Although this is not a new result, we re-emphasize it in the paper. We also demonstrate another advantage, that the Samarskii-type schemes are almost second-order uniformly accurate on the layer component of the solution. Motivated by this fact, we present a further improvement of the numerical method.

Convection–diffusion↗

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗