Related papers: Iterative Schemes for Bump Solutions in a Neural F…
In this paper, we consider numerical approximations of a binary fluid-surfactant phase-field model coupled with the fluid flow, in which the system is highly nonlinear that couples the incompressible Navier-Stokes equations and two…
In this work, we propose a family of single-node second-order boundary schemes for the lattice Boltzmann method with general collision terms. The construction of the schemes is quite universal and simple, it does not involve concrete…
A generalized version of the Wilson-Cowan (WC) model is proposed which accounts for the evolution of the synaptic resources. Adiabatic elimination of the fast variables is performed to yield a simplified framework for the coupled…
We introduce a reinforcement learning algorithm designed to identify the fixed points of a given quantum operation. The method iteratively constructs the unitary transformation that maps the computational basis onto the basis of fixed…
We discuss kinetic-based particle optimization methods and variable-sample strategies for problems where the cost function represents the expected value of a random mapping. Kinetic-based optimization methods rely on a consensus mechanism…
We introduce and analyze a fast iterative method based on sequential Bregman projections for nonlinear inverse problems in Banach spaces. The key idea, in contrast to the standard Landweber method, is to use multiple search directions per…
In this paper, we propose a dual-mixed formulation for stationary viscoplastic flows with yield, such as the Bingham or the Herschel-Bulkley flow. The approach is based on a Huber regularization of the viscosity term and a two-fold saddle…
In this paper we present approaches that address two issues that can occur when the level-set method is used to simulate two-fluid flows in engineering practice. The first issue concerns regularizing the Heaviside function on arbitrary…
Sampling based methods are widely used for robotic motion planning. Traditionally, these samples are drawn from probabilistic ( or deterministic ) distributions to cover the state space uniformly. Despite being probabilistically complete,…
We study the minmax optimization problem introduced in [22] for computing policies for batch mode reinforcement learning in a deterministic setting. First, we show that this problem is NP-hard. In the two-stage case, we provide two…
Iteration method is commonly used in solving linear systems of equations. We present quantum algorithms for the relaxed row and column iteration methods by constructing unitary matrices in the iterative processes, which generalize row and…
A feedback neural approach to static communication routing in asymmetric networks is presented, where a mean field formulation of the Bellman-Ford method for the single unicast problem is used as a common platform for developing algorithms…
We introduce some approximation schemes for linear and fully non-linear diffusion equations of Bellman-Isaacs type. Although they are not monotone one can prove their convergence to the viscosity solution of the problem. Effective…
High-dimensional simulation optimization is notoriously challenging. We propose a new sampling algorithm that converges to a global optimal solution and suffers minimally from the curse of dimensionality. The algorithm consists of two…
We consider joint selection of fixed and random effects in general mixed-effects models. The interpretation of estimated mixed-effects models is challenging since changing the structure of one set of effects can lead to different choices of…
We consider a class of inverse problems defined by a nonlinear map from parameter or model functions to the data. We assume that solutions exist. The space of model functions is a Banach space which is smooth and uniformly convex; however,…
We point out how Banach Fixed Point Theorem, and the Picard successive approximation methods induced by it, allows us to treat some mathematical methods in Combinatorics. In particular we get, by this way, a proof and an iterative algorithm…
We further study the stochastic model discussed in Ref.[2] in which positive and negative particles diffuse in an asymmetric, CP invariant way on a ring. The positive particles hop clockwise, the negative counter-clockwise and…
In this paper, we study a new iterative method for a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the frame work of reflexive real Banach spaces. Moreover, we prove the strong convergence theorem for…
How to develop efficient numerical schemes while preserving the energy stability at the discrete level is a challenging issue for the three component Cahn-Hilliard phase-field model. In this paper, we develop first and second order temporal…