Related papers: Modified Adomian Polynomial for Nonlinear Function…
We are presenting a modification of the well-known Alternating Direction Method of Multipliers (ADMM) algorithm with additional preconditioning that aims at solving convex optimisation problems with nonlinear operator constraints.…
In this paper, the Green's function and decomposition technique is proposed for solving the coupled Lane-Emden equations. This approach depends on constructing Green's function before establishing the recursive scheme for the series…
In this paper, we propose and analyze an inexact version of the symmetric proximal alternating direction method of multipliers (ADMM) for solving linearly constrained optimization problems. Basically, the method allows its first subproblem…
A method to calculate the adjoint solution for a large class of partial differential equations is discussed. It differs from the known continuous and discrete adjoint, including automatic differentiation. Thus, it represents an alternative,…
In this paper, we develop an efficient decoder via the proximal alternating direction method of multipliers (proximal-ADMM) technique for nonbinary linear block codes in the Galois field. Its main contents are as follows: first, exploiting…
Inspired by the recent advances in deep learning (DL), this work presents a deep neural network aided decoding algorithm for binary linear codes. Based on the concept of deep unfolding, we design a decoding network by unfolding the…
In this paper, we study a class of non-convex optimization problems known as multi-affine quadratic equality constrained problems, which appear in various applications--from generating feasible force trajectories in robotic locomotion and…
The aim of this paper is a quantitative analysis of the solution set of a system of polynomial nonlinear differential equations, both in the ordinary and partial case. Therefore, we introduce the differential counting polynomial, a common…
The matrix low-rank approximation problem with additional convex constraints can find many applications and has been extensively studied before. However, this problem is shown to be nonconvex and NP-hard; most of the existing solutions are…
One of the major challenges of contemporary mathematics is numerical solving of various problems for functional differential equations (FDE), in particular Cauchy problem for delayed and neutral differential equations. Recently large…
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…
This paper concerns the use of asymptotic expansions for the efficient solving of forward and inverse problems involving a nonlinear singularly perturbed time-dependent reaction--diffusion--advection equation. By using an asymptotic…
In the present work, we use the Adomian Decomposition method to find the approximate solution for some cases of the Newell whitehead segel nonlinear differential equation which was solved previously with exact solution by the Homotopy…
Piecewise affine functions are widely used to approximate nonlinear and discontinuous functions. However, most, if not all existing models only deal with fitting continuous functions. In this paper, we investigate the problem of fitting a…
This paper exhibits a very simple formula for a particular solution of a linear ordinary differential equation with constant real coefficients, P(d/dt)x = f, f a function given by a linear combination of polynomials, trigonometrical and…
In this paper we consider the problem of distributed nonlinear optimisation of a separable convex cost function over a graph subject to cone constraints. We show how to generalise, using convex analysis, monotone operator theory and…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
We describe a variant of the dressing method giving alternative representation of multidimensional nonlinear PDE as a system of Integro-Differential Equations (IDEs) for spectral and dressing functions. In particular, it becomes single…
In this paper we propose an iterative method using alternating direction method of multipliers (ADMM) strategy to solve linear inverse problems in Hilbert spaces with general convex penalty term. When the data is given exactly, we give a…
In this work we introduce and analyze a new multiscale method for strongly nonlinear monotone equations in the spirit of the Localized Orthogonal Decomposition. A problem-adapted multiscale space is constructed by solving linear local…