𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A statistical average algorithm for the dynamic compound inverse problem

✍ Scribed by Li Jie; Chen Jun

Publisher
Springer
Year
2003
Tongue
English
Weight
159 KB
Volume
30
Category
Article
ISSN
0178-7675

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Faster Algorithm for the Inverse Spann
A Faster Algorithm for the Inverse Spanning Tree Problem
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 Ε½ 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre

A strongly polynomial algorithm for the
A strongly polynomial algorithm for the inverse shortest arborescence problem
✍ Hu Zhiquan; Liu Zhenhong πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 909 KB

In this paper an inverse problem of the weighted shortest arborescence problem is discussed. That is. given a directed graph G and a set of nonnegative costs on its arcs. we need to modify those costs as little as possible to ensure that T, a given (.I-arborescence of G, is the shortest one. It is

A parallel algorithm for solving the 3D
A parallel algorithm for solving the 3D inverse scattering problem
✍ Ganquan Xie; Qisu Zou πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 306 KB

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 ter