Related papers: A numerical method for the solution of relaxed one…
This paper presents a novel method of approximating the scalar Wiener-Hopf equation; and therefore constructing an approximate solution. The advantages of this method over the existing methods are reliability and explicit error bounds.…
The aim of this work is to introduced the concept of the best one-sided approximation of unbounded functions in weighted space by using algebraic operators in terms the average modulus of smoothness. We also show an estimate of the degree…
We establish $L^p$ error estimates for monotone numerical schemes approximating Hamilton-Jacobi equations on the $d$-dimensional torus. Using the adjoint method, we first prove a $L^1$ error bound of order one for finite-difference and…
We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with…
Results on the rational approximation of functions containing singularities are presented. We build further on the ''lightning method'', recently proposed by Trefethen and collaborators, based on exponentially clustering poles close to the…
We extend the classification of solvable Lie algebras with abelian nilradicals to classify solvable Leibniz algebras which are one dimensional extensions of an abelian nilradicals.
The relaxation complexity rc(X) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem over X without using auxiliary variables. Besides its relevance…
In the article we have obtained some estimates of the rate of convergence for the recently proposed by Yu.E. Nesterov method of minimization of a convex Lipschitz-continuous function of two variables on a square with a fixed side. The…
We focus in this work on the numerical discretization of the one dimensional aggregation equation $\pa_t\rho + \pa_x (v\rho)=0$, $v=a(W'*\rho)$, in the attractive case. Finite time blow up of smooth initial data occurs for potential $W$…
This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…
This paper discusses the theory and numerical method of two-scale analysis for the multiscale Landau-Lifshitz-Gilbert equation in composite ferromagnetic materials. The novelty of this work can be summarized in three aspects: Firstly, the…
In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent implicit fixed-point…
In this work, we extend the central extension method for solvable Leibniz algebras. Using this method, a complete classification of one-dimensional abelian extensions of five-dimensional solvable Leibniz algebras with a non-trivial…
The focus of the present work is the (theoretical) approximation of a solution of the p(x)-Poisson equation. To devise an iterative solver with guaranteed convergence, we will consider a relaxation of the original problem in terms of a…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
This article describes a method for constructing approximations to periodic solutions of dynamic Lorenz system with classical values of the system parameters. The author obtained a system of nonlinear algebraic equations in general form…
In this paper, a fully implicit Crank-Nicolson discontinuous Galerkin method is proposed for solving the Ginzburg-Landau equation. By leveraging a novel analytical technique, we rigorously establish the unique solvability of the constructed…
We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…
We introduce Lipschitz continuous and $C^{1,1}$ geometric approximation and interpolation methods for sampled bounded uniformly continuous functions over compact sets and over complements of bounded open sets in $\mathbb{R}^n$ by using…