Related papers: Homogeneous Buchberger algorithms and Sullivant's …
For the non cutoff radially symmetric homogeneous Boltzmann equation with Maxwellian molecules, we give the numerical solutions using symbolic manipulations and spectral decomposition of Hermit functions. The initial data can belong to some…
In this paper, an efficient modified Newton type algorithm is proposed for nonlinear unconstrianed optimization problems. The modified Hessian is a convex combination of the identity matrix (for steepest descent algorithm) and the Hessian…
A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…
Subject of this paper is an implementation of a well-known Motzkin-Burger algorithm, which solves the problem of finding the full set of solutions of a system of linear homogeneous inequalities. There exist a number of implementations of…
Using the minors in Hessian matrices, we introduce new graded algebras associated to a homogeneous polynomial. When the associated projective hypersurface has isolated singularities, these algebras are related to some new local algebras…
In this work, we study the Cauchy problem for the radially symmetric spatially homogeneous Boltzmann equation with Debye-Yukawa potential. We prove that this Cauchy problem enjoys the same smoothing effect as the Cauchy problem defined by…
In this paper, we identify some sufficient conditions for a Kazhdan-Lusztig ideal to be inhomogeneous. Also, we attempt to approach the problem of giving some necessary and sufficient conditions for a Kazhdan-Lusztig ideal to be "standard…
This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…
In this paper, we consider gradient-type methods for convex positively homogeneous optimization problems with relative accuracy. An analogue of the accelerated universal gradient-type method for positively homogeneous optimization problems…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
We demonstrate that a direct approach to improving Hamiltonian lattice gauge theory is possible. Our approach is to correct errors in the Kogut-Susskind Hamiltonian by incorporating additional gauge invariant terms. The coefficients of…
We provide an algorithm that takes as an input a given parametric family of homogeneous polynomials, which is invariant under the action of the general linear group, and an integer $d$. It outputs the ideal of that family intersected with…
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 propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
We consider the problem of solving a large-scale system of linear equations in a distributed or federated manner by a taskmaster and a set of machines, each possessing a subset of the equations. We provide a comprehensive comparison of two…
We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…
We study the Onsager algebra from the ideal theoretic point of view. A complete classification of closed ideals and the structure of quotient algebras are obtained. We also discuss the solvable algebra aspect of the Onsager algebra through…
We give canonical forms of selfadjoint and isometric operators on a complex vector space $U$ with scalar product given by a positive semidefinite Hermitian form, and of Hermitian forms on $U$. For an arbitrary system of semiunitary spaces…