Related papers: The solution to the initial value problem for the …
With the regular decomposition technique, we decompose the space $\mathbf{H}_0^s(\mathbf{curl}; \Omega)$ into the sum of a vector potential space and the gradient of a scalar space, both possessing higher regularity. Based on this new high…
In this paper, we introduce and analyse a surface finite element discretization of advection-diffusion equations with uncertain coefficients on evolving hypersurfaces. After stating unique solvability of the resulting semi-discrete problem,…
Recently Ovsienko and Tabachnikov considered extensions of Somos and Gale-Robinson sequences, defined over the algebra of dual numbers. Ovsienko used the same idea to construct so-called shadow sequences derived from other nonlinear…
We consider a scalar objective minimization problem over the solution set of another optimization problem. This problem is known as simple bilevel optimization problem and has drawn a significant attention in the last few years. Our inner…
In this paper a semidiscrete Fourier pseudospectral method for approximating Benjamin-type equations is introduced and analyzed. A study of convergence is presented.
We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of…
To numerically solve the two-dimensional advection equation, we propose a family of fourth- and higher-order semi-Lagrangian finite volume (SLFV) methods that feature (1) fourth-, sixth-, and eighth-order convergence rates, (2)…
We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(2 \times 2)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is the null matrix, $a_i \in \mathbb…
We present a multiscale finite element method for a diffusion problem with rough and high contrast coefficients. The construction of the multiscale finite element space is based on the localized orthogonal decomposition methodology and it…
Binary tomography is concerned with the recovery of binary images from a few of their projections (i.e., sums of the pixel values along various directions). To reconstruct an image from noisy projection data, one can pose it as a…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
In this short note we revisit the convex integration approach to constructing very weak solutions to the 2D Monge-Amp\'ere equation with H\"older-continuous first derivatives of exponent $\beta<1/5$. Our approach is based on combining the…
The present paper proposes an inf-sup stable divergence free virtual element method and associated a priori, and a posteriori error analysis to approximate the eigenvalues and eigenfunctions of the Stokes spectral problem in one shot. For…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
We study a nonconvex optimization algorithmic approach to phase retrieval and the more general problem of semidefinite low-rank matrix sensing. Specifically, we analyze the nonconvex landscape of a quartic Burer-Monteiro factored…
We present a new eigenvalue method for solving a system of Laurent polynomial equations defining a zero-dimensional reduced subscheme of a toric compactification $X$ of $(\mathbb{C} \setminus \{0\})^n$. We homogenize the input equations to…
In this paper we achieve some new Hadamard type inequalities using elementary well known inequalities for functions whose first derivatives absolute values are s-geometrically and geometrically convex. And also we get some applications for…
We present an algorithm for approximately solving bounded convex vector optimization problems. The algorithm provides both an outer and an inner polyhedral approximation of the upper image. It is a modification of the primal algorithm…
It is well known that the solution of topology optimization problems may be affected both by the geometric properties of the computational mesh, which can steer the minimization process towards local (and non-physical) minima, and by the…
In this work we study the initial value problem (IVP) for the fifth order KdV equations, \begin{align*} \partial_{t}u+\partial_{x}^{5}u+u^k\partial_{x}u=0,\text{} & \quad x,t\in \mathbb R, \quad k=1,2, \end{align*} in weighted Sobolev…