๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Overlap domain decomposition method for bioluminescence tomography (BLT)

โœ Scribed by Tao Wang; Shuping Gao; Ling Zhang; Yan Wu; Xiaowei He; Yanbin Hou; Heyu Huang; Jie Tian

Publisher
Wiley (John Wiley & Sons)
Year
2010
Tongue
English
Weight
356 KB
Volume
26
Category
Article
ISSN
2040-7939

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

Bioluminescence tomography (BLT) allows in vivo localization and quantification of bioluminescent sources inside a small animal to reveal various molecular and cellular activities. In this paper, the overlap domain decomposition method (ODDM) of BLT is proposed, which refers to divide and conquer techniques for solving BLT by iteratively solving subโ€problems on smaller subโ€domains. Here, two triangulations of the region are adopted. We can obtain the photon density distribution on the object surface, as well as reconstruct the position of the light source by using ODDM and genetic algorithm. The numerical simulations have shown that ODDM is computationally efficient and fairly robust. Copyright ยฉ 2009 John Wiley & Sons, Ltd.

๐Ÿ“œ SIMILAR VOLUMES

Overlapping Domain Decomposition Algorit
Overlapping Domain Decomposition Algorithms for General Sparse Matrices
โœ Xiao-Chuan Cai; Yousef Saad ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 856 KB

Domain decomposition methods for finite element problems using a partition based on the underlying finite element mesh have been extensively studied. In this paper, we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices. The subproblem

Unsteady convection and convection-diffu
Unsteady convection and convection-diffusion problems via direct overlapping domain decomposition methods
โœ F. K. Hebeker; Yu. A. Kuznetsov ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 394 KB

In solving unsteady problems, domain decomposition methods may be used either for iterative preconditioning each global implicit time-step or directly (noniteratively) within a blockwise implicit time-stepping procedure. In the latter case, the inner boundary values for the subproblems are generated

Coupling of a non-overlapping domain dec
Coupling of a non-overlapping domain decomposition method for a nodal finite element method with a boundary element method
โœ Y. Boubendir; A. Bendali; M. B. Fares ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 439 KB ๐Ÿ‘ 1 views

## Abstract Nonโ€overlapping domain decomposition techniques are used to solve the finite element equations and to couple them with a boundary element method. A suitable approach dealing with finite element nodes common to more than two subdomains, the soโ€called crossโ€points, endows the method with