Related papers: Sinc-collocation methods with consistent collocati…
The Sinc convolution is an approximate formula for indefinite convolutions proposed by Stenger. The formula was derived based on the Sinc indefinite integration formula combined with the single-exponential transformation. Although its…
A generalization of classical cubic B-spline functions with a parameter is used as basis in the collocation method. Some initial boundary value problems constructed on the nonlinear Klein-gordon equation are solved by the proposed method…
The iterated Crank-Nicolson (ICN) method is a successful numerical algorithm in numerical relativity for solving partial differential equations. The $\theta$-ICN method is the extension of the original ICN method where $\theta$ is the…
In this work, we propose a method combining the Sinc collocation method with the double exponential transformation for computing the eigenvalues of the anharmonic Coulombic potential. We introduce a scaling factor that improves the…
This paper presents a twice continuously differentiable penalty function for nonlinear semidefinite programming problems. In some optimization methods, such as penalty methods and augmented Lagrangian methods, their convergence property can…
Reliable controllers with high flexibility and performance are necessary for the control of intricate, advanced, and expensive systems such as aircraft, marine vessels, automotive vehicles, and satellites. Meanwhile, control allocation has…
The saddle-point optimization problems have a lot of practical applications. This paper focuses on such non-smooth problems in decentralized case. This work contains generalization of recently proposed sliding for centralized problem.…
Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have…
This paper presents a new narrow-stencil finite difference method for approximating the viscosity solution of second order fully nonlinear elliptic partial differential equations including Hamilton-Jacobi-Bellman equations. The proposed…
We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…
For linear and fully non-linear diffusion equations of Bellman-Isaacs type, we introduce a class of approximation schemes based on differencing and interpolation. As opposed to classical numerical methods, these schemes work for general…
Recent studies have shown that fractional calculus is an effective alternative mathematical tool in various scientific fields. However, some investigations indicate that results established in differential and integral calculus do not…
We consider convex-concave saddle-point problems where the objective functions may be split in many components, and extend recent stochastic variance reduction methods (such as SVRG or SAGA) to provide the first large-scale linearly…
In this article, we propose the use of partitioning and clustering methods as an alternative to Gaussian quadrature for stochastic collocation. The key idea is to use cluster centers as the nodes for collocation. In this way, we can extend…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
We present a method to solve the Helmholtz equation for a non-homogeneous membrane with Dirichlet boundary conditions at the border of arbitrary two-dimensional domains. The method uses a collocation approach based on a set of localized…
In this paper, a class of finite difference numerical techniques is presented to solve the second-order linear inhomogeneous damped wave equation. The consistency, stability, and convergences of these numerical schemes are discussed. The…
The dressing method is a technique to construct new solutions in non-linear sigma models under the provision of a seed solution. This is analogous to the use of autoBacklund transformations for systems of the sine-Gordon type. In a recent…
The problem of change-point estimation is considered under a general framework where the data are generated by unknown stationary ergodic process distributions. In this context, the consistent estimation of the number of change-points is…
In this paper, we propose two parallel extragradient - viscosity methods for finding a particular element in the common solution set of a system of equilibrium problems and finitely many fixed point problems. This particular point is the…