Optimal solvers for linear systems with fractional powers of sparse SPD matrices
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
Copyright 2018 John Wiley & Sons, Ltd. In this paper, we consider efficient algorithms for solving the algebraic equation Au=f, 0<<1, where A is a properly scaled symmetric and positive definite matrix obtained from finite difference or finite element approximations of second-order elliptic problems in , d=1,2,3. This solution is then written as u=A- with F=A-f with positive integer. The approximate solution method we propose and study is based on the best uniform rational approximation of the function t for 0