Search results for "Mathematica"

Projective Reeds-Shepp car onS2with quadratic cost

2008

Fix two points x, ¯ ∈ S 2 and two directions (without orientation) η,¯ η of the velocities in these points. In this paper we are interested to the problem of minimizing the cost

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…

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.

Uniqueness of solutions for some elliptic equations with a quadratic gradient term

2008

We study a comparison principle and uniqueness of positive solutions for the homogeneous Dirichlet boundary value problem associated to quasi-linear elliptic equations with lower order terms. A model example is given by −Δu + λ |∇u| 2 u r = f (x) ,λ , r >0. The main feature of these equations consists in having a quadratic gradient term in which singularities are allowed. The arguments employed here also work to deal with equations having lack of ellipticity or some dependence on u in the right hand side. Furthermore, they could be applied to obtain uniqueness results for nonlinear equations having the p-Laplacian operator as the principal part. Our results improve those already known, even…

The rate of multiplicity of the roots of nonlinear equations and its application to iterative methods

2015

Nonsimple roots of nonlinear equations present some challenges for classic iterative methods, such as instability or slow, if any, convergence. As a consequence, they require a greater computational cost, depending on the knowledge of the order of multiplicity of the roots. In this paper, we introduce dimensionless function, called rate of multiplicity, which estimates the order of multiplicity of the roots, as a dynamic global concept, in order to accelerate iterative processes. This rate works not only with integer but also fractional order of multiplicity and even with poles (negative order of multiplicity).