Related papers: Convergence and combinatorics of the Reverse algor…
In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…
Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…
The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\Delta \C(n)$, where $\Delta \C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\'a together…
The general solution of the inverse Frobenius-Perron problem considering the construction of a fully chaotic dynamical system with given invariant density is obtained within the class of one-dimensional unimodal maps. Some interesting…
A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…
In reverse mathematics, is is possible to have a curious situation where we know that an implication does not reverse, but appear to have no information on on how to weaken the assumption while preserving the conclusion. A main cause of…
In this paper, we study the almost sure boundedness and the convergence of the stochastic approximation (SA) algorithm. At present, most available convergence proofs are based on the ODE method, and the almost sure boundedness of the…
Experiment shows that the reverse length-lexicographical word ordering consistently yields far smaller Gr\"obner bases for modular p-group algebras than the length-lexicographical ordering. For the so-called Jennings word ordering, based on…
This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…
In this thesis we develop a novel framework to study smooth and strongly convex optimization algorithms, both deterministic and stochastic. Focusing on quadratic functions we are able to examine optimization algorithms as a recursive…
A novel approach is given to overcome the computational challenges of the full-matrix Adaptive Gradient algorithm (Full AdaGrad) in stochastic optimization. By developing a recursive method that estimates the inverse of the square root of…
The inverse power method is a numerical algorithm to obtain the eigenvectors of a matrix. In this work, we develop an iteration algorithm, based on the inverse power method, to numerically solve the Schr\"odinger equation that couples an…
We develop a novel framework to study smooth and strongly convex optimization algorithms, both deterministic and stochastic. Focusing on quadratic functions we are able to examine optimization algorithms as a recursive application of linear…
This contribution studies a specific deformation of algebras with anti-involution. Starting with the observation that twisting the multiplication of such an algebra by its anti-involution generates a Hom-associative algebra of type II, it…
We introduce invertible subalgebras of local operator algebras on lattices. An invertible subalgebra is defined to be one such that every local operator can be locally expressed by elements of the inveritible subalgebra and those of the…
A more general notion of weight called admissible is introduced and then an investigation is carried out on the a.e. convergence of weighted strong laws of large numbers and their applications to weighted one-sided ergodic Hilbert…
We develop a systematic approach to continuous substitutions on compact Hausdorff alphabets. Focussing on implications of irreducibility and primitivity, we highlight important features of the topological dynamics of their (generalised)…
Local convergence analysis of the augmented Lagrangian method (ALM) is established for a large class of composite optimization problems with nonunique Lagrange multipliers under a second-order sufficient condition. We present a new…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
In this paper we establish the ergodicity of Langevin dynamics for simple two-particle system involving a Lennard-Jones type potential. To the best of our knowledge, this is the first such result for a system operating under this type of…