相关论文: The Fedosov *-product in Mathematica

A new second-order numerical scheme based on an operator splitting is proposed for the Godunov-Peshkov-Romenski model of continuum mechanics. The homogeneous part of the system is solved with a finite volume method based on a WENO…

The notion of a local line bundle on a manifold, classified by 2-cohomology with real coefficients, is introduced. The twisting of pseudodifferential operators by such a line bundle leads to an algebroid with elliptic elements with…

The computation of higher order processes very often involves a large number of diagrams. In addition, it is in general not possible to solve the occurring integrals explicitly and expansions in small quantities have to be performed. This…

This is a short comment on the Moyal formula for deformation quantization. It is shown that the Moyal algebra of functions on the plane is canonically isomorphic to an algebra of matrices of infinite size.

The Mathieu functions are used to solve analytically some problems in elliptical cylinder coordinates. A computational toolbox was implemented in Matlab. Since the notation and normalization for Mathieu functions vary in the literature, we…

This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…

One can argue that on flat space $\mathbb{R}^d$ the Weyl quantization is the most natural choice and that it has the best properties (e.g. symplectic covariance, real symbols correspond to Hermitian operators). On a generic manifold, there…

We present an improved version of our program package oneloop which -- written as a package for MAPLE -- solves one-loop Feynman integrals. The package is calculating one-, two- and three-point functions both algebraically and numerically…

We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also…

We compute some algebraic invariants (e.g. depth, Castelnuovo - Mumford regularity) for a special class of monomial ideals, namely the ideals of mixed products. As a consequence, we characterize the Cohen-Macaulay ideals of mixed products.

Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real…

An algorithm is presented that formalizes different steps in a classical Supersymmetric (SUSY) calculation. Based on the algorithm Dill, a symbolic software package, that can perform the calculations, is developed in the Mathematica…

We provide algorithms for computing a Lyapunov function for a class of systems where the state trajectories are constrained to evolve within a closed convex set. The dynamical systems that we consider comprise a differential equation which…

We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…

We give new descriptions of the Bruhat order and Demazure products of affine Weyl groups in terms of the weight function of the quantum Bruhat graph. These results can be understood to describe certain closure relations concerning the…

Bayesian optimization is a data-efficient technique that has been shown to be extremely powerful to optimize expensive, black-box, and possibly noisy objective functions. Many applications involve optimizing probabilities and mixtures which…

The application of the approximation-operational approach to solving linear differential equations of fractional order with variable coefficients is considered. It is shown that the method can also be applied to solving differential…

We introduce a new approximate solution technique for first-order Markov decision processes (FOMDPs). Representing the value function linearly w.r.t. a set of first-order basis functions, we compute suitable weights by casting the…

In this paper the Benettin-Wolf algorithm to determine all Lyapunov exponents adapted to a class of non-commensurate fractional-order systems modeled by Caputo's derivative and the corresponding Matlab code are presented. The paper…

We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating…