Related papers: Parallel hybrid methods for generalized equilibriu…
We introduce an $hp$-version symmetric interior penalty discontinuous Galerkin finite element method (DGFEM) for the numerical approximation of the biharmonic equation on general computational meshes consisting of polygonal/polyhedral…
In this paper, we study local bifurcations of an indefinite elliptic system with multiple components: \begin{equation*} \left\{\begin{array}{ll} -\Delta u_j + au_j = \mu_ju_j^3+\beta\sum_{k\ne j}u_k^2u_j, u_j>0\ \ \hbox{in}\ \Omega, u_j=0 \…
In this work, we study the convergence and performance of nonlinear solvers for the Bidomain equations after decoupling the ordinary and partial differential equations of the cardiac system. Firstly, we provide a rigorous proof of the…
We propose a new class of primal-dual Fejer monotone algorithms for solving systems of com- posite monotone inclusions. Our construction is inspired by a framework used by Eckstein and Svaiter for the basic problem of finding a zero of the…
We study the existence of fully nontrivial solutions to the system $$-\Delta u_i+ \lambda_iu_i = \sum\limits_{j=1}^\ell \beta_{ij}|u_j|^p|u_i|^{p-2}u_i\ \hbox{in}\ \Omega, \qquad i=1,\ldots,\ell,$$ in a bounded or unbounded domain $\Omega$…
In this paper, we develop multigrid solvers for the biharmonic problem in the framework of isogeometric analysis (IgA). In this framework, one typically sets up B-splines on the unit square or cube and transforms them to the domain of…
In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in several variables. This algorithm is a generalization of a method developed for…
This paper establishes new common fixed point theorems for weakly compatible mappings in metric spaces, relaxing traditional requirements such as continuity, compatibility, and reciprocal continuity. We present a unified framework for three…
A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…
In this paper, we introduce two new modified inertial Mann Halpern and viscosity algorithms for solving fixed point problems. We establish strong convergence theorems under some suitable conditions. Finally, our algorithms are applied to…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
In this paper we describe a 1-dimensional variational approach to the analytical construction of equivariant biharmonic maps. Our goal is to provide a direct method which enables analysts to compute directly the analytical conditions which…
In a Hilbert framework, we introduce continuous and discrete dynamical systems which aim at solving inclusions governed by structured monotone operators $A=\partial\Phi+B$, where $\partial\Phi$ is the subdifferential of a convex lower…
This paper develops two parameter-free methods for solving convex and strongly convex hybrid composite optimization problems, namely, a composite subgradient type method and a proximal bundle type method. Functional complexity bounds for…
A global optimization approach for solving non-monotone equilibrium problems (EPs) is proposed. The class of (regularized) gap functions is used to reformulate any EP as a constrained global optimization program and some bounds on the…
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…
Let $(A_1,\cdots,A_n)$ and $(B_1,\cdots,B_n)$ be $n$-tuples of commuting self-adjoint operators on Hilbert space. For functions $f$ on $\R^n$ satisfying certain conditions, we obtain sharp estimates of the operator norms (or norms in…
Multi-Robot Path Planning (MRPP) on graphs, equivalently known as Multi-Agent Path Finding (MAPF), is a well-established NP-hard problem with critically important applications. As serial computation in (near)-optimally solving MRPP…
In this paper we apply methods of proof mining to obtain a uniform effective rate of asymptotic regularity for the Mann iteration associated to $\kappa$-strict pseudo-contractions on convex subsets of Hilbert spaces.