scholarly journals Reconstruction of missing boundary conditions from partially overspecified data : the Stokes system

2016 ◽  
Vol Volume 23 - 2016 - Special... ◽  
Author(s):  
Amel Ben Abda ◽  
Faten Khayat

We are interested in this paper with the ill-posed Cauchy-Stokes problem. We consider a data completion problem in which we aim recovering lacking data on some part of a domain boundary , from the knowledge of partially overspecified data on the other part. The inverse problem is formulated as an optimization one using an energy-like misfit functional. We give the first order opti-mality condition in terms of an interfacial operator. Displayed numerical results highlight its accuracy. Nous nous intéressons à un problème de Cauchy mal posé, celui de la complétion de données frontières pour les équations de Stokes. Nous voulons reconstituer les données manquantes sur une partie non accessible de la frontière du domaine à partir de données peu surdéterminées sur la partie accessible. Nous formulons ce problème inverse sous forme de minimisation d'une fonctionnelle de type énergie. Les conditions d'optimalité du premier ordre sont écrites en termes d'équation d'interface utilisant les opérateurs de Stecklov-Poincaré. Nous donnons des résultats numériques attestant l'efficacité de la méthode.

2010 ◽  
Vol Volume 13 - 2010 - Special... ◽  
Author(s):  
Duc Thang Du ◽  
Faten Jelassi

International audience Using a preconditioned Richardson iterative method as a regularization to the data completion problem is the aim of the contribution. The problem is known to be exponentially ill posed that makes its numerical treatment a hard task. The approach we present relies on the Steklov-Poincaré variational framework introduced in [Inverse Problems, vol. 21, 2005]. The resulting algorithm turns out to be equivalent to the Kozlov-Maz’ya-Fomin method in [Comp. Math. Phys., vol. 31, 1991]. We conduct a comprehensive analysis on the suitable stopping rules that provides some optimal estimates under the General Source Condition on the exact solution. Some numerical examples are finally discussed to highlight the performances of the method. L’objectif est d’utiliser une méthode itérative de Richardson préconditionnée comme une technique de régularisation pour le problème de complétion de données. Le problème est connu pour être sévèrement mal posé qui rend son traitement numérique ardu. L’approche adoptée est basée sur le cadre variationnel de Steklov-Poincaré introduit dans [Inverse Problems, vol. 21, 2005].L’algorithme obtenu s’avère être équivalent à celui de Kozlov-Maz’ya-Fomin parû dans [Comp. Math. Phys., vol. 31, 1991]. Nous menons une analyse complète pour le choix du critère d’arrêt, et établissons des estimations optimales sous les Conditions Générale de Source sur la solution exacte. Nous discutons, enfin, quelques exemples numériques qui confortent les pertinence de la méthode.


Author(s):  
Chakir Tajani ◽  
Houda Kajtih ◽  
Ali Daanoun

AbstractIn this work, we are interested in a class of problems of great importance in many areas of industry and engineering. It is the invese problem for the biharmonic equation. It consists to complete the missing data on the inaccessible part from the measured data on the accessible part of the boundary. To solve this ill-posed problem, we opted for the alternative iterative method developed by Kozlov, Mazya and Fomin which is a convergent method for the elliptical Cauchy problems in general. The numerical implementation of the iterative algorithm is based on the application of the boundary element method (BEM) for a sequence of mixed well-posed direct problems. Numerical results are performed for a square domain showing the effectiveness of the algorithm by BEM to produce accurate and stable numerical results.


2020 ◽  
Vol 40 (1) ◽  
pp. 49-69
Author(s):  
Luigi C. Berselli ◽  
Michael Růžička

In this paper we consider the time evolutionary \(p\)-Stokes problem in a smooth and bounded domain. This system models the unsteady motion or certain non-Newtonian incompressible fluids in the regime of slow motions, when the convective term is negligible. We prove results of space/time regularity, showing that first-order time-derivatives and second-order space-derivatives of the velocity and first-order space-derivatives of the pressure belong to rather natural Lebesgue spaces.


2021 ◽  
Vol Volume 34 - 2020 - Special... ◽  
Author(s):  
Marwa Ouni ◽  
Abderrahmane Habbal ◽  
Moez Kallel

International audience We consider the coupled inverse problem of data completion and the determination of the best locations of an unknown number of small objects immersed in a stationary viscous fluid. We carefully introduce a novel method to solve this problem based on a game theory approach. A new algorithm is provided to recovering the missing data and the number of these objects and their approximate location simultaneously. The detection problem is formulated as a topological one. We present two test-cases that illustrate the efficiency of our original strategy to deal with the ill-posed problem. Nous étudions le problème de détection des petites inclusions immergées dans un fluide visqueux et incompressible, lorsque le mouvement de celui-ci est régi par les équations de Stokes. Des données du type Cauchy seront ainsi fournies seulement sur une partie frontière de l’écoulement.A cet égard, nous essayons de développer une méthode originale basée sur une approche de théorie des jeux, pour résoudre notre problème inverse. Un nouvel algorithme a été donc présenté traitant simultanément la question de la reconstruction des données manquantes avec celle de détection d’objets. La notion de gradient topologique a été utilisée afin de déterminer le nombre d’objets présents et leurs localisations approximatives. Dans cet objectif, une étude numérique présentée, a été effectuée pour prouver l’efficacité de la méthode.


2019 ◽  
Vol 25 ◽  
pp. 30
Author(s):  
Fabien Caubet ◽  
Jérémi Dardé ◽  
Matías Godoy

We study the inverse problem of obstacle detection for Laplace’s equation with partial Cauchy data. The strategy used is to reduce the inverse problem into the minimization of a cost-type functional: the Kohn–Vogelius functional. Since the boundary conditions are unknown on an inaccessible part of the boundary, the variables of the functional are the shape of the inclusion but also the Cauchy data on the inaccessible part. Hence we first focus on recovering these boundary conditions, i.e. on the data completion problem. Due to the ill-posedness of this problem, we regularize the functional through a Tikhonov regularization. Then we obtain several theoretical properties for this data completion problem, as convergence properties, in particular when data are corrupted by noise. Finally we propose an algorithm to solve the inverse obstacle problem with partial Cauchy data by minimizing the Kohn–Vogelius functional. Thus we obtain the gradient of the functional computing both the derivatives with respect to the missing data and to the shape. Several numerical experiences are shown to discuss the performance of the algorithm.


Geosciences ◽  
2020 ◽  
Vol 10 (9) ◽  
pp. 329
Author(s):  
Mahdi O. Karkush ◽  
Mahmood D. Ahmed ◽  
Ammar Abdul-Hassan Sheikha ◽  
Ayad Al-Rumaithi

The current study involves placing 135 boreholes drilled to a depth of 10 m below the existing ground level. Three standard penetration tests (SPT) are performed at depths of 1.5, 6, and 9.5 m for each borehole. To produce thematic maps with coordinates and depths for the bearing capacity variation of the soil, a numerical analysis was conducted using MATLAB software. Despite several-order interpolation polynomials being used to estimate the bearing capacity of soil, the first-order polynomial was the best among the other trials due to its simplicity and fast calculations. Additionally, the root mean squared error (RMSE) was almost the same for the all of the tried models. The results of the study can be summarized by the production of thematic maps showing the variation of the bearing capacity of the soil over the whole area of Al-Basrah city correlated with several depths. The bearing capacity of soil obtained from the suggested first-order polynomial matches well with those calculated from the results of SPTs with a deviation of ±30% at a 95% confidence interval.


1995 ◽  
Vol 74 (6) ◽  
pp. 2665-2684 ◽  
Author(s):  
Y. Kondoh ◽  
Y. Hasegawa ◽  
J. Okuma ◽  
F. Takahashi

1. A computational model accounting for motion detection in the fly was examined by comparing responses in motion-sensitive horizontal system (HS) and centrifugal horizontal (CH) cells in the fly's lobula plate with a computer simulation implemented on a motion detector of the correlation type, the Reichardt detector. First-order (linear) and second-order (quadratic nonlinear) Wiener kernels from intracellularly recorded responses to moving patterns were computed by cross correlating with the time-dependent position of the stimulus, and were used to characterize response to motion in those cells. 2. When the fly was stimulated with moving vertical stripes with a spatial wavelength of 5-40 degrees, the HS and CH cells showed basically a biphasic first-order kernel, having an initial depolarization that was followed by hyperpolarization. The linear model matched well with the actual response, with a mean square error of 27% at best, indicating that the linear component comprises a major part of responses in these cells. The second-order nonlinearity was insignificant. When stimulated at a spatial wavelength of 2.5 degrees, the first-order kernel showed a significant decrease in amplitude, and was initially hyperpolarized; the second-order kernel was, on the other hand, well defined, having two hyperpolarizing valleys on the diagonal with two off-diagonal peaks. 3. The blockage of inhibitory interactions in the visual system by application of 10-4 M picrotoxin, however, evoked a nonlinear response that could be decomposed into the sum of the first-order (linear) and second-order (quadratic nonlinear) terms with a mean square error of 30-50%. The first-order term, comprising 10-20% of the picrotoxin-evoked response, is characterized by a differentiating first-order kernel. It thus codes the velocity of motion. The second-order term, comprising 30-40% of the response, is defined by a second-order kernel with two depolarizing peaks on the diagonal and two off-diagonal hyperpolarizing valleys, suggesting that the nonlinear component represents the power of motion. 4. Responses in the Reichardt detector, consisting of two mirror-image subunits with spatiotemporal low-pass filters followed by a multiplication stage, were computer simulated and then analyzed by the Wiener kernel method. The simulated responses were linearly related to the pattern velocity (with a mean square error of 13% for the linear model) and matched well with the observed responses in the HS and CH cells. After the multiplication stage, the linear component comprised 15-25% and the quadratic nonlinear component comprised 60-70% of the simulated response, which was similar to the picrotoxin-induced response in the HS cells. The quadratic nonlinear components were balanced between the right and left sides, and could be eliminated completely by their contralateral counterpart via a subtraction process. On the other hand, the linear component on one side was the mirror image of that on the other side, as expected from the kernel configurations. 5. These results suggest that responses to motion in the HS and CH cells depend on the multiplication process in which both the velocity and power components of motion are computed, and that a putative subtraction process selectively eliminates the nonlinear components but amplifies the linear component. The nonlinear component is directionally insensitive because of its quadratic non-linearity. Therefore the subtraction process allows the subsequent cells integrating motion (such as the HS cells) to tune the direction of motion more sharply.


Proceedings ◽  
2019 ◽  
Vol 33 (1) ◽  
pp. 21
Author(s):  
Fabrizia Guglielmetti ◽  
Eric Villard ◽  
Ed Fomalont

A stable and unique solution to the ill-posed inverse problem in radio synthesis image analysis is sought employing Bayesian probability theory combined with a probabilistic two-component mixture model. The solution of the ill-posed inverse problem is given by inferring the values of model parameters defined to describe completely the physical system arised by the data. The analysed data are calibrated visibilities, Fourier transformed from the ( u , v ) to image planes. Adaptive splines are explored to model the cumbersome background model corrupted by the largely varying dirty beam in the image plane. The de-convolution process of the dirty image from the dirty beam is tackled in probability space. Probability maps in source detection at several resolution values quantify the acquired knowledge on the celestial source distribution from a given state of information. The information available are data constrains, prior knowledge and uncertain information. The novel algorithm has the aim to provide an alternative imaging task for the use of the Atacama Large Millimeter/Submillimeter Array (ALMA) in support of the widely used Common Astronomy Software Applications (CASA) enhancing the capabilities in source detection.


1991 ◽  
Vol 274 (2) ◽  
pp. 581-585 ◽  
Author(s):  
S C Kivatinitz ◽  
A Miglio ◽  
R Ghidoni

The fate of exogenous ganglioside GM1 labelled in the sphingosine moiety, [Sph-3H]GM1, administered as a pulse, in the isolated perfused rat liver was investigated. When a non-recirculating protocol was employed, the amount of radioactivity in the liver and perfusates was found to be dependent on the presence of BSA in the perfusion liquid and on the time elapsed after the administration of the ganglioside. When BSA was added to the perfusion liquid, less radioactivity was found in the liver and more in the perfusate at each time tested, for up to 1 h. The recovery of radioactivity in the perfusates followed a complex course which can be described by three pseudo-first-order kinetic constants. The constants, in order of decreasing velocity, are interpreted as: (a) the dilution of the labelled GM1 by the constant influx of perfusion liquid; (b) the washing off of GM1 loosely bound to the surface of liver cells; (c) the release of gangliosides from the liver. Process (b) was found to be faster in the presence of BSA, probably owing to the ability of BSA to bind gangliosides. The [Sph-3H]GM1 in the liver underwent metabolism, leading to the appearance of products of anabolic (GD1a, GD1b) and catabolic (GM2, GM3) origin; GD1a appeared before GM2 and GM3 but, at times longer than 10 min, GM2 and GM3 showed more radioactivity than GD1a. At a given time the distribution of the radioactivity in the perfusates was quite different from that of the liver. In fact, after 60 min GD1a was the only metabolite present in any amount, the other being GM3, the quantity of which was small. This indicates that the liver is able to release newly synthesized gangliosides quite specifically. When a recirculating protocol was used, there were more catabolites and less GD1a than with the non-recirculating protocol. A possible regulatory role of ganglioside re-internalization on their own metabolism in the liver is postulated.


Sign in / Sign up

Export Citation Format

Share Document