Related papers: Evaluating matrix power series with the Cayley-Ham…
In this study, we introduce a transformative, automated framework for classifying basis invariants in generic field theories. Utilising a novel ring-diagram methodology accompanied by the well-known Cayley-Hamilton theorem, our approach…
We prove an index theorem for families of linear periodic Hamiltonian systems, which is reminiscent of the Atiyah-Singer index theorem for selfadjoint elliptic operators. For the special case of one-parameter families, we compare our…
The Feynman--Hellmann approach to computing matrix elements in lattice QCD by first adding a perturbing operator to the action is described using the transition matrix and the Dyson expansion formalism. This perturbs the energies in the…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
The notions of weak and strong minimizability of a matrix intertwining operator are introduced. Criterion of strong minimizability of a matrix intertwining operator is revealed. Criterion and sufficient condition of existence of a constant…
We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of…
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…
In this paper we use some basic facts from the theory of (matrix) Lie groups and algebras to show that many of the classical matrix splittings used to construct stationary iterative methods and preconditioniers for Krylov subspace methods…
Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems as smooth unconstrained problems over the set of symmetric matrices which are then solved via the cubic-regularized Newton method. A…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is…
A class of Hamiltonian stochastic differential equations with multiplicative L\'{e}vy noise in the sense of Marcus, and the construction and numerical implementation methods of symplectic Euler scheme, are considered. A general symplectic…
We discuss an algorithm for the approximate solution of Schrodinger's equation for lattice gauge theory, using lattice SU(3) as an example. A basis is generated by repeatedly applying an effective Hamiltonian to a ``starting state.'' The…
We describe a unitary matrix model which is constructed from discrete analogs of the usual projective modules over the noncommutative torus and use it to construct a lattice version of noncommutative gauge theory. The model is a…
Lepage and Mackenzie have shown that tadpole renormalization and systematic improvement of lattice perturbation theory can lead to much improved numerical results in lattice gauge theory. It is shown that lattice perturbation theory using…
Supersymmetric Yang Mills theory is directly accessible to lattice simulations using current methodology, and can provide a non-trivial check of recent exact results in SQCD. In order to tune the lattice simulation to the supersymmetric…
Using the Mathematica program we calculate numerically the difference of the diagonal matrix elements of the time dependent effective Hamiltonian for the neutral K meson complex. We consider the exactly solvable neutral K meson model based…
Matrix factorization is a powerful data analysis tool. It has been used in multivariate time series analysis, leading to the decomposition of the series in a small set of latent factors. However, little is known on the statistical…
We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…