Addressing the computational cost of large EIT solutions

Physiological Measurement

Volumn 33, Issue 5, 2012, Pages 787-800

  Boyle, Alistair ^a   Borsic, Andrea ^b   Adler, Andy ^a  

^a CARLETON UNIVERSITY   (Canada)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

computing; distributed; electrical impedance tomography; finite element method; sparse linear algebra

Indexed keywords

COMPUTERIZED TOMOGRAPHY; COSTS; ELECTRIC IMPEDANCE; ELECTRIC IMPEDANCE MEASUREMENT; ELECTRIC IMPEDANCE TOMOGRAPHY; INVERSE PROBLEMS; MATRIX ALGEBRA;

COMPUTATIONAL COSTS; COMPUTING; DISTRIBUTED; ELECTRICAL IMPE DANCE TOMOGRAPHY (EIT); MATRIX SOLVER; MEASUREMENTS OF; NODE DENSITY; PARAMETRIZATIONS; SPARSE LINEAR ALGEBRA; SPARSE MATRICES;

FINITE ELEMENT METHOD;

EID: 84860323992     PISSN: 09673334     EISSN: 13616579     Source Type: Journal    
DOI: 10.1088/0967-3334/33/5/787     Document Type: Article

References (34)

1. Adler A and Lionheart W R B 2006 Uses and abuses of EIDORS: an extensible software base for EIT Physiol. Meas. 27 S2542
2. Amdahl G 1967 Validity of the single processor approach to achieving large scale computing capabilities Proc. American Federation of Information Processing Societies pp 4835
3. Amestoy P, Guermouche A, LExcellent J-Y and Pralet S 2006 Hybrid scheduling for the parallel solution of linear systems Parallel Comput. 32 13656 (Pubitemid 43120206)
4. Borsic A, Hartov A, Paulsen K and Manwaring P 2008 3D electric impedance tomography reconstruction on multi-core computing platforms Proc. IEEE Engineering in Medicine and Biology Society (Vancouver, August 2008) pp 11757
5. Boyle A, Adler A and Borsic A 2011 Scaling the EIT problem 12th Conf. Electrical Impedance Tomography (University of Bath, Bath, UK, May 2011)
6. Breckon W R 1990 Image reconstruction in electrical impedance tomography PhD Thesis Oxford Polytechnic, Oxford, UK (Available at http://www.maths. manchester.ac.uk/bl/theses/wrbl/intro.html)
7. Bunch J and Kaufman L 1977 Some stable methods for calculating inertia and solving symmetric linear systems Math. Comput. 31 16379
8. Chen Y, Davis T, Hager W and Rajamanickam S 2008 Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate ACM Trans. Math. Softw. 35
9. Davis T 2004 Algorithm 832: Umfpack, an unsymmetric-pattern multifrontal method ACM Trans. Math. Softw. 30 1969
10. Davis T, Gilbert J, Larimore S and Ng E 2004 A column approximate minimum degree ordering algorithm ACM Trans. Math. Softw. 30 35376
11. Duff I, Gould N, Reid J, Scott A and Turner K 1990 The factorization of sparse symmetric indefinite matrices IMA J. Numer. Anal. 11 181204
12. Duff I, Heroux M and Pozo R 2002 An overview of the sparse basic linear algebra subprograms: the new standard from the BLAS technical forum ACM Trans. Math. Softw. 28 23967 (Pubitemid 135701676)
13. Ewing D, Fawkes A and Griffiths J 1970 Rules governing the numbers of nodes and elements in a finite element mesh Int. J. Numer. Methods Eng. 2 597600
14. Fortune S 1987 A sweepline algorithm for Voronoi diagrams Algorithmica 2 15374
15. Grychtol B, Lionheart W R B, Wolf G K, Bodenstein M and Adler A 2011 The importance of shape: thorax models for GREIT Int. Conf. Electrical Impedance Tomography (Bath, UK, May 2011)
16. Guibas L and Stolfi J 1985 Primitives for the manipulation of general subdivisions and the computation of Voronoi ACM Trans. Graph. 4 74123
17. Gupta A, Karypis G and Kumar V 1997 A highly scalable parallel algorithm for sparse matrix factorization IEEE Trans. Parallel Distrib. Syst. 8 50220 (Pubitemid 127772276)
18. Gustafson J 1988 Reevaluating Amdahls law Commun. ACM 31 5323 (Pubitemid 18610091)
19. Hill M and Marty M 2008 Amdahls law in the multicore era IEEE Comput. 41 338
20. Li X S and Demmel J 2003 Superlu-dist: a scalable distributed-memory sparse direct solver for unsymmetric linear systems ACM Trans. Math. Softw. 29 11040 (Pubitemid 40001447)
21. Liu J 1989 The role of elimination trees in sparse factorization SIAM. J. Matrix Anal. Appl. 11 13472
22. Löhner R and Parikh P 1988 Generation of three-dimensional unstructured grids by the advancing-front method Int. J. Numer. Methods Fluids 8 113549 (Pubitemid 18664788)
23. Parkhurst J, Darringer J and Grundmann B 2006 From single core to multi-core: preparing for a new exponential ACM Int. Conf. Computer-Aided Design pp 6772
24. Polydorides N and Lionheart W R B 2002 A Matlab toolkit for three-dimensional electrical impedance tomography: a contribution to the Electrical Impedance and Diffuse Optical Reconstruction Software project Meas. Sci. Technol. 13 187183 (Pubitemid 36225159)
25. Purcell T, Buck I, Mark W and Hanrahan P 2002 Ray tracing on programmable graphics hardware ACM SIGGRAPH 21 70312
26. Schaller R 1997 Moores law: past, present and future IEEE Spectr. 34 529
27. Schenk O and Gärtner K 2004 Solving unsymmetric sparse systems of linear equations with PARDISO J. Future Gener. Comput. Syst. 20 47587
28. Scott J and Hu Y 2007 Experiences of sparse direct symmetric solvers ACM Trans. Math. Softw. 33
29. Shephard M and Georges M 1991 Automatic three-dimensional mesh generation by the finite octree technique Int. J. Numer. Methods Eng. 32 70949 (Pubitemid 21713596)
30. Strang G and Fix G 1973 An Analysis of the Finite Element Method (Eaglewood Cliffs, NJ: Prentice-Hall)
31. Suna X and Gustafsona J 1991 Benchmarking of high performance supercomputers Parallel Comput. 17 1093109
32. Tizzard A, Horesh L, Yerworth R, Holder D and Bayford R 2005 Generating accurate finite element meshes for the forward model of the human head in EIT Physiol. Meas. 26 25161
33. Toledo S, Chen D and Rotkin V 2003 Taucs: a library of sparse linear solvers. 2.2, available at http://www.tau.ac.il/stoledo/taucs/
34. Watson D 1981 Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes Comput. J. 24 16772 (Pubitemid 12503887)