Related papers: Dynamic Programming Method for Best Piecewise Line…
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works have explored the…
A high precision, and space time fully decoupled, wavelet formulation numerical method is developed for a class of nonlinear initial boundary value problems. This method is established based on a proposed Coiflet based approximation scheme…
One often encounters the curse of dimensionality in the application of dynamic programming to determine optimal policies for controlled Markov chains. In this paper, we provide a method to construct sub-optimal policies along with a bound…
A monotone iterative method is proposed to solve nonlinear discrete boundary value problems with the support of upper and lower solutions. We establish some new existence results. Under some sufficient conditions, we establish maximum…
Boundary value problems for integrable nonlinear partial differential equations are considered from the symmetry point of view. Families of boundary conditions compatible with the Harry-Dym, KdV and MKdV equations and the Volterra chain are…
A type of adaptive finite element method for the eigenvalue problems is proposed based on the multilevel correction scheme. In this method, adaptive finite element method to solve eigenvalue problems involves solving associated boundary…
We propose a fast algorithm for the probabilistic solution of boundary value problems (BVPs), which are ordinary differential equations subject to boundary conditions. In contrast to previous work, we introduce a Gauss--Markov prior and…
In this article, firstly we develop a method for a type of difference equations, applicable to solve approximately a class of first order ordinary differential equation systems. In a second step, we apply the results obtained to solve a…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
We propose a stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Our approach is based on a bi-objective viewpoint of chance-constrained programs that seeks solutions on the…
We consider boundary value problems of the first and third kind for the diffusionwave equation. By using the method of energy inequalities, we find a priori estimates for the solutions of these boundary value problems.
Accurate triangulation of the domain plays a pivotal role in computing the numerical approximation of the differential operators. A good triangulation is the one which aids in reducing discretization errors. In a standard collocation…
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bilinear programming formulation of value function approximation,…
We present a method to solve initial and boundary value problems using artificial neural networks. A trial solution of the differential equation is written as a sum of two parts. The first part satisfies the boundary (or initial) conditions…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
We consider an approximate solution for the one-dimensional semilinear singularly-perturbed boundary value problem, using the previously obtained numerical values of the boundary value problem in the mesh points and the representation of…
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The…
In recent years, information relaxation and duality in dynamic programs have been studied extensively, and the resulted primal-dual approach has become a powerful procedure in solving dynamic programs by providing lower-upper bounds on the…
We prove convergence of piecewise polynomial collocation methods applied to periodic boundary value problems for functional differential equations with state-dependent delays. The state dependence of the delays leads to nonlinearities that…
This article studies the existence of long-time solutions to the Hamiltonian boundary value problem, and their consistent numerical approximation. Such a boundary value problem is, for example, common in Molecular Dynamics, where one aims…