Related papers: A feasibility approach for constructing combinator…
Tendon-driven mechanisms are useful from the perspectives of variable stiffness, redundant actuation, and lightweight design, and they are widely used, particularly in hands, wrists, and waists of robots. The design of these wire…
This work proposes a conformable fractional predictor-corrector algorithm for solving conformable fractional differential equations. Fractional calculus is finding applications in various scientific fields, but existing numerical methods…
We show the optimal coherence of $2d$ lines in $\mathbb{C}^{d}$ is given by the Welch bound whenever a skew Hadamard of order $d+1$ exists. Our proof uses a variant of Hadamard doubling that converts any equiangular tight frame of size…
A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although…
Multi-material design optimization problems can, after discretization, be solved by the iterative solution of simpler sub-problems which approximate the original problem at an expansion point to first order. In particular, models…
Let the design of an experiment be represented by an $s$-dimensional vector $\mathbf {w}$ of weights with nonnegative components. Let the quality of $\mathbf {w}$ for the estimation of the parameters of the statistical model be measured by…
With recent advances in both responsive materials and fabrication techniques it is now possible to construct integrated functional structures, composed of both structural and active materials. We investigate the robust design of such…
Many robots are not equipped with a manipulator and many objects are not suitable for prehensile manipulation (such as large boxes and cylinders). In these cases, pushing is a simple yet effective non-prehensile skill for robots to interact…
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix…
The paper focuses on a new class of combinatorial problems which consists in restructuring of solutions (as sets/structures) in combinatorial optimization. Two main features of the restructuring process are examined: (i) a cost of the…
We construct multigrid methods for an elliptic distributed optimal control problem that are robust with respect to a regularization parameter. We prove the uniform convergence of the $W$-cycle algorithm and demonstrate the performance of…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
Algorithms for creating optimal configurations of warehouse threedimensional systems consisting of unified transport and warehouse modules are presented in the article. The constructions of these modules, and methods for constructing a…
One of the most common, but at the same time expensive operations in linear algebra, is multiplying two matrices $A$ and $B$. With the rapid development of machine learning and increases in data volume, performing fast matrix intensive…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
Many real-world combinatorial problems involve uncertain parameters, which can be predicted given contextual features and historical data. These `predict-then-optimize' or `contextual optimization' problems have gained significant…
In this paper we explore several approaches for sampling weight vectors in the context of weighted sum scalarisation approaches for solving multi-criteria decision making (MCDM) problems. This established method converts a multi-objective…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
We introduce and compare three different Monte Carlo determinantal algorithms that allow one to compute dynamical quantities, such as the self-energy, of fermionic systems in their thermodynamic limit. We show that the most efficient…
We introduce and study a geometric modification of the Douglas-Rach\-ford method called the Circumcentered-Douglas-Rachford method. This method iterates by taking the intersection of bisectors of reflection steps for solving certain classes…