Related papers: V-cycle optimal convergence for DCT-III matrices
In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the…
Cyclic block coordinate methods are a fundamental class of optimization methods widely used in practice and implemented as part of standard software packages for statistical learning. Nevertheless, their convergence is generally not well…
The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied, and whose product is square. Cycles in this graph have a parity, that is, they are either even (termed e-cycles) or odd (termed o-cycles).…
Due to its optimal complexity, the multigrid (MG) method is one of the most popular approaches for solving large-scale linear systems arising from the discretization of partial differential equations. However, the parallel implementation of…
In this paper, we establish a bijection between the set of mutation classes of mutation-cyclic skew-symmetric integral 3x3-matrices and the set of triples of integers (a,b,c) which are all greater than 1 and where the product of the two…
The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…
Let X be a metric space with metric d and T,S be two commutative measure-preserving maps of X. In this paper we obtain numerical results about multiple recurrence of almost every point of this dynamical system. On other words we study the…
This article presents an optimization model for tertiary control in three-phase unbalanced microgrids. This model considers 24h operation and includes renewable energy sources, energy storage devices, and grid code limitations. Power flow…
An efficient nonlinear multigrid method for a mixed finite element method of the Darcy-Forchheimer model is constructed in this paper. A Peaceman-Rachford type iteration is used as a smoother to decouple the nonlinearity from the divergence…
The main object of the present paper is to give a complete result regarding the best approximation rate of certain trigonometric series in general complex valued continuous function space under a new condition which gives an essential…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…
We propose a constraint preserving discontinuous Galerkin method for ideal compressible MHD in two dimensions and using Cartesian grids, which automatically maintains the global divergence-free property. The approximation of the magnetic…
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the NP-hard graph matching problem is relaxing it to a convex…
This paper proposes a novel parallel stochastic gradient descent (SGD) method that is obtained by applying parallel sets of SGD iterations (each set operating on one node using the data residing in it) for finding the direction in each…
In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the…
In this work, we present and analyze C-SAGA, a (deterministic) cyclic variant of SAGA. C-SAGA is an incremental gradient method that minimizes a sum of differentiable convex functions by cyclically accessing their gradients. Even though the…
We study an optimal control problem under uncertainty, where the target function is the solution of an elliptic partial differential equation with random coefficients, steered by a control function. The robust formulation of the…
This paper introduces a unified regression framework based on the Lagrange formalism, demonstrating how polynomial and logistic regression can all be formulated within a common variational (Lagrangian formalism) structure. Within this…