Different choices of the averaging operator within the BDDC method are compared on a series of 2D experiments. Subdomains with irregular interface and with jumps in material coefficients are included into the study. Two new approaches are studied along three standard choices. No approach is shown to be universally superior to others, and the resulting recommendation is that an actual method should be chosen based on properties of the problem.

We consider triangulations formed by triangular elements. For the standard linear interpolation operator ${\pi }_h$ we prove the interpolation order to be ${∥v-{\pi }_{h}v∥}_{1,p}\le Ch{\left|v\right|}_{2,p}$ for $p>1$ provided the corresponding family of triangulations is only semiregular. In such a case the well-known Zlámal’s condition upon the minimum angle need not be satisfied.

We show that in dimensions higher than two, the popular "red refinement" technique, commonly used for simplicial mesh refinements and adaptivity in the finite element analysis and practice, never yields subsimplices which are all acute even for an acute father element as opposed to the two-dimensional case. In the three-dimensional case we prove that there exists only one tetrahedron that can be partitioned by red refinement into eight congruent subtetrahedra that are all similar to the original...

In this paper we present theoretical, computational, and practical aspects concerning 3-dimensional shape optimization governed by linear magnetostatics. The state solution is approximated by the finite element method using Nédélec elements on tetrahedra. Concerning optimization, the shape controls the interface between the air and the ferromagnetic parts while the whole domain is fixed. We prove the existence of an optimal shape. Then we state a finite element approximation to the optimization...

In this paper we consider the existence and asymptotic behavior of solutions of the following problem: $$u_{tt}{(t,x)-(\alpha +\beta \parallel \nabla u(t,x)\parallel }_2^2+{\beta \parallel \nabla v(t,x)\parallel }_2^2)\Delta u(t,x)+\delta |u_t{(t,x)|}^{p-1}{u}_t(t,x)={\mu \left|u(t,x)\right|}^{q-1}u(t,x),x\in \Omega ,t\ge 0,v_{tt}{(t,x)-(\alpha +\beta \parallel \nabla u(t,x)\parallel }_2^2+{\beta \parallel \nabla v(t,x)\parallel }_2^2)\Delta v(t,x)+\delta |v_t{(t,x)|}^{p-1}{v}_t(t,x)={\mu \left|v(t,x)\right|}^{q-1}v(t,x),x\in \Omega ,t\ge 0,u(0,x)=u_0\left(x\right),u_t(0,x)=u_1\left(x\right),x\in \Omega ,v(0,x)=v_0\left(x\right),v_t(0,x)=v_1\left(x\right),x\in \Omega ,u{{|}_{{}_{\partial \Omega }}=v|}_{{}_{\partial \Omega }}=0$$ where $q>1$, $p\ge 1$, $\delta >0$, $\alpha >0$, $\beta \ge 0$, $\mu \in ℝ$ and $\Delta$ is the Laplacian in ${ℝ}^N$.

In the paper the comparison method is used to prove the convergence of the Picard iterations, the Seidel iterations, as well as some modifications of these methods applied to approximate solution of systems of differential algebraic equations. The both linear and nonlinear comparison equations are emloyed.

In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those...

A three-parameter family of Boussinesq type systems in two space dimensions is considered. These systems approximate the three-dimensional Euler equations, and consist of three nonlinear dispersive wave equations that describe two-way propagation of long surface waves of small amplitude in ideal fluids over a horizontal bottom. For a subset of these systems it is proved that their Cauchy problem is locally well-posed in suitable Sobolev classes. Further, a class of these systems is discretized...