Related papers: Analysis of systematic scan Metropolis algorithms …
Special cases of Weber-Schafheitlin type integrals are evaluated analytically.
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…
This chapter reviews the work conducted by our team on scan-based immersed isogeometric analysis for flow problems. To leverage the advantageous properties of isogeometric analysis on complex scan-based domains, various innovations have…
The Ising models have been applied for various problems on information sciences, social sciences, and so on. In many cases, solving these problems corresponds to minimizing the Bethe free energy. To minimize the Bethe free energy, a…
We present an application of the program of groupoidification leading up to a sketch of a categorification of the Hecke algebroid --- the category of permutation representations of a finite group. As an immediate consequence, we obtain a…
A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
We introduce and analyze a family of heterogeneous multiscale methods for the numerical integration of highly oscillatory systems of delay differential equations with constant delays. The methodology suggested provides algorithms of…
This work presents a new evolutionary optimization algorithm in theoretical mathematics with important applications in scientific computing. The use of the evolutionary algorithm is justified by the difficulty of the study of the…
The life of the modern world essentially depends on the work of the large artificial homogeneous networks, such as wired and wireless communication systems, networks of roads and pipelines. The support of their effective continuous…
We first present an Iwahori-Matsumoto presentation of affine Yokonuma-Hecke algebras $\widehat{Y}_{r,n}(q)$ to give a new proof of the fact, which was previously proved by Chlouveraki and S\'echerre, that $\widehat{Y}_{r,n}(q)$ is a…
We present a method to compute two Hecke operators acting on a space of algebraic modular forms simultaneously based on an idea of Eichler's. We show that in certain cases this method can be used to obtain the action of the full Hecke…
The Iwahori-Hecke algebra of the symmetric group is the convolution algebra of $\gl_n$-invariant functions on the variety of pairs of complete flags over a finite field. Considering convolution on the space of triples of two flags and a…
We aim to improve upon the exploration of the general-purpose random walk Metropolis algorithm when the target has non-convex support $A \subset \mathbb{R}^d$, by reusing proposals in $A^c$ which would otherwise be rejected. The algorithm…
We consider generalizations of the classical inverse problem to Bayesien type estimators, where the result is not one optimal parameter but an optimal probability distribution in parameter space. The practical computational tool to compute…
Metropolis algorithms for approximate sampling of probability measures on infinite dimensional Hilbert spaces are considered and a generalization of the preconditioned Crank-Nicolson (pCN) proposal is introduced. The new proposal is able to…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
We report on experience with an investigation of the analytic structure of the solution of certain algebraic complex equations. In particular the behavior of their series expansions around the origin is discussed. The investigation imposes…
We have proposed new algorithms for the numerical integration of the equations of motion for classical spin systems. In close analogy to symplectic integrators for Hamiltonian equations of motion used in Molecular Dynamics these algorithms…