TY - JOUR
T1 - Recycling Krylov subspaces for efficient large-scale electrical impedance tomography
AU - Mello, Luís Augusto Motta
AU - de Sturler, Eric
AU - Paulino, Glaucio H.
AU - Silva, Emílio Carlos Nelli
N1 - Funding Information:
The authors thank Shun Wang for the support provided regarding the RMINRES code. Luís Augusto Motta Mello thanks FAPESP (State of São Paulo Research Foundation) for his doctoral scholarship (Grant No. 2005/00270-1 ) and for the research project support (Grant No. 01/05303-4 ). Emílio Carlos Nelli Silva acknowledges the financial support of the National Counsil of Technological and Scientific Development , Grant No. 303689/2009-9 . The research by Eric de Sturler was supported, in part, by the National Science Foundation under Grant Nos. DMR-0325939 and EAR-0530643 . Glaucio H. Paulino acknowledges FAPESP for providing him the visiting scientist award at the University of São Paulo through Project No. 2008/51070-0.
PY - 2010/12/15
Y1 - 2010/12/15
N2 - Electrical impedance tomography (EIT) captures images of internal features of a body. Electrodes are attached to the boundary of the body, low intensity alternating currents are applied, and the resulting electric potentials are measured. Then, based on the measurements, an estimation algorithm obtains the three-dimensional internal admittivity distribution that corresponds to the image. One of the main goals of medical EIT is to achieve high resolution and an accurate result at low computational cost. However, when the finite element method (FEM) is employed and the corresponding mesh is refined to increase resolution and accuracy, the computational cost increases substantially, especially in the estimation of absolute admittivity distributions. Therefore, we consider in this work a fast iterative solver for the forward problem, which was previously reported in the context of structural optimization. We propose several improvements to this solver to increase its performance in the EIT context. The solver is based on the recycling of approximate invariant subspaces, and it is applied to reduce the EIT computation time for a constant and high resolution finite element mesh. In addition, we consider a powerful preconditioner and provide a detailed pseudocode for the improved iterative solver. The numerical results show the effectiveness of our approach: the proposed algorithm is faster than the preconditioned conjugate gradient (CG) algorithm. The results also show that even on a standard PC without parallelization, a high mesh resolution (more than 150,000 degrees of freedom) can be used for image estimation at a relatively low computational cost.
AB - Electrical impedance tomography (EIT) captures images of internal features of a body. Electrodes are attached to the boundary of the body, low intensity alternating currents are applied, and the resulting electric potentials are measured. Then, based on the measurements, an estimation algorithm obtains the three-dimensional internal admittivity distribution that corresponds to the image. One of the main goals of medical EIT is to achieve high resolution and an accurate result at low computational cost. However, when the finite element method (FEM) is employed and the corresponding mesh is refined to increase resolution and accuracy, the computational cost increases substantially, especially in the estimation of absolute admittivity distributions. Therefore, we consider in this work a fast iterative solver for the forward problem, which was previously reported in the context of structural optimization. We propose several improvements to this solver to increase its performance in the EIT context. The solver is based on the recycling of approximate invariant subspaces, and it is applied to reduce the EIT computation time for a constant and high resolution finite element mesh. In addition, we consider a powerful preconditioner and provide a detailed pseudocode for the improved iterative solver. The numerical results show the effectiveness of our approach: the proposed algorithm is faster than the preconditioned conjugate gradient (CG) algorithm. The results also show that even on a standard PC without parallelization, a high mesh resolution (more than 150,000 degrees of freedom) can be used for image estimation at a relatively low computational cost.
KW - Iterative methods
KW - Krylov subspace recycling
KW - Preconditioning
KW - Sequential linear programming
KW - Three-dimensional electrical impedance tomography
UR - http://www.scopus.com/inward/record.url?scp=78649633792&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649633792&partnerID=8YFLogxK
U2 - 10.1016/j.cma.2010.06.001
DO - 10.1016/j.cma.2010.06.001
M3 - Article
AN - SCOPUS:78649633792
SN - 0045-7825
VL - 199
SP - 3101
EP - 3110
JO - Computer Methods in Applied Mechanics and Engineering
JF - Computer Methods in Applied Mechanics and Engineering
IS - 49-52
ER -