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

A parallel algorithm for solving the 3D inverse scattering problem

โœ Scribed by Ganquan Xie; Qisu Zou

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
306 KB
Volume
65
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis

A parallel algorithm for solving the 3D inverse scattering problem is presented. The inverse problem considered is to determine a potential function from received wave data measured on a surface. The above inverse problem is transformed to a 3D nonlinear integral geometry equation. The principal term of the integral geometry operator is linear, weakly ill-posed and preserves symmetry. A parallel numerical iterative algorithm for solving the inverse scattering problem is constructed by using these important properties. The parallel iterative algorithm decomposes a large problem into several smaller problems and employs parallel processors of Cray-2 or IBM-3090. The parallel algorithm can be extended to a much broader range of 2D/3D inverse problems. Some numerical simulation results are performed. Very good numerical results indicate that the parallel algorithm in this paper is effective, fast, stable and has satisfactory accuracy.

๐Ÿ“œ SIMILAR VOLUMES

NOSER: An algorithm for solving the inve
NOSER: An algorithm for solving the inverse conductivity problem
โœ M. Cheney; D. Isaacson; J. C. Newell; S. Simske; J. Goble ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 885 KB

The inverse conductivity problem is the mathematical problem that must be solved in order for electrical impedance tomography systems to be able to make images. Here we show how this inverse conductivity problem is related to a number of other inverse problems. We then explain the workings of an alg

Algorithms for solving a spatial optimis
Algorithms for solving a spatial optimisation problem on a parallel computer
โœ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 337 KB ๐Ÿ‘ 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software

A parallel computational algorithm for a
A parallel computational algorithm for an inverse problem of low frequency
โœ Qisu Zou; Ganquan Xie ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 277 KB

We propose a parallel computational algorithm for an inverse problem of low frequency, which is shown to have the property of preserving symmetry. The corresponding discrete operator is shown to have the property also. We construct a simple orthogonal matrix to decompose the linear system resulting

A Data Parallel Algorithm for Solving th
A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine
โœ N. Copty; S. Ranka; G. Fox; R.V. Shankar ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare