Search results for "Computational Mathematic"

Explicit Characterization of Inclusions in Electrical Impedance Tomography

2001

In electrical impedance tomography one seeks to recover the spatial conductivity distribution inside a body from knowledge of the Neumann--Dirichlet map. In many practically relevant situations the conductivity is smooth apart from some inhomogeneities where the conductivity jumps to a higher or lower value. An explicit characterization of these inclusions is developed in this paper. To this end a class of dipole-like indicator functions is introduced, for which one has to check whether their boundary values are contained in the range of an operator determined by the measured Neumann--Dirichlet map. It is shown that this holds true if and only if the dipole singularity lies inside the inhom…

<I>A Special Issue on</I> Theoretical and Mathematical Aspects of Discrete Time Quantum Walks

2013

Stability and -gain controller design for positive switched systems with mixed time-varying delays

2013

This paper investigates the problems of stability and L"1-gain controller design for positive switched systems with mixed time-varying delays. The mixed time-varying delays are presented in the forms of discrete delay and distributed delay. The purpose of this paper is to design a class of switching signals and a state feedback controller for the considered system such that the resulting closed-loop system is exponentially stable with L"1-gain performance. By constructing an appropriate co-positive type Lyapunov-Krasovskii functional and using the average dwell time approach, we propose a sufficient condition to ensure the exponential stability with weighted L"1-gain performance for the sys…

Finite element analysis of varitional crimes for a quasilinear elliptic problem in 3D

2000

We examine a finite element approximation of a quasilinear boundary value elliptic problem in a three-dimensional bounded convex domain with a smooth boundary. The domain is approximated by a polyhedron and a numerical integration is taken into account. We apply linear tetrahedral finite elements and prove the convergence of approximate solutions on polyhedral domains in the $W^1_2$ -norm to the true solution without any additional regularity assumptions.

Third-order iterative methods without using any Fréchet derivative

2003

AbstractA modification of classical third-order methods is proposed. The main advantage of these methods is they do not need to evaluate any Fréchet derivative. A convergence theorem in Banach spaces, just assuming the second divided difference is bounded and a punctual condition, is analyzed. Finally, some numerical results are presented.

Vereinfachte Rekursionen zur Richardson-Extrapolation in Spezialf�llen

1975

Recursions are given for Richardson-extrapolation based on generalized asymptotic expansions for the solution of a finite algorithm depending upon a parameterh>0. In particular, these expansions may contain terms likeh ?·log(h), (?>0). Simplified formulae are established in special cases. They are applicable to numerical integration of functions with algebraic or logarithmic endpoint singularities and provide a Romberg-type quadrature.

Multilevel preconditioning and adaptive sparse solution of inverse problems

2012

Continuous reformulations and heuristics for the Euclidean travelling salesperson problem

2008

We consider continuous reformulations of the Euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the Euclidean TSP.

Global convergence and rate of convergence of a method of centers

1994

We consider a method of centers for solving constrained optimization problems. We establish its global convergence and that it converges with a linear rate when the starting point of the algorithm is feasible as well as when the starting point is infeasible. We demonstrate the effect of the scaling on the rate of convergence. We extend afterwards, the stability result of [5] to the infeasible case anf finally, we give an application to semi-infinite optimization problems.

Maximal subgroups of small index of finite almost simple groups

2022

We prove in this paper that a finite almost simple group $R$ with socle the non-abelian simple group $S$ possesses a conjugacy class of core-free maximal subgroups whose index coincides with the smallest index $\operatorname{l}(S)$ of a maximal group of $S$ or a conjugacy class of core-free maximal subgroups with a fixed index $v_S \leq {\operatorname{l}(S)^2}$, depending only on $S$. We show that the number of subgroups of the outer automorphism group of $S$ is bounded by $\log^3 {\operatorname{l}(S)}$ and $\operatorname{l}(S)^2 < |S|$.