Search

Abstract In this paper we briefly discuss Rings — an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gröbner bases are implemented with the use of modern asymptotically fast algorithms. Rings can be easily interacted or embedded in applications in high-energy physics and other research areas via a simple API with fully typed hierarchy of algebraic structures and algorithms for commutative algebra. The use of the Scala language brings a quite novel powerful, strongly typed functional programming model allowing to write short, expressive, and fast code for applications. At the same time Rings shows one of the best performances among existing software for algebraic calculations. Program summary Program Title: Rings Program Files doi: http://dx.doi.org/10.17632/2k79hftjy9.1 Licensing provisions: Apache 2.0 Programming language: Java, Scala Nature of problem: Fast methods for rational function arithmetic, simplification of polynomial expressions, Gröbner bases and other related computer algebra methods naturally arising in physical applications Solution method: Efficient implementation of modern asymptotically fast algorithms in Java language External routines: Java 8 and higher, Scala 2.11 or 2.12 Additional comments: project page: https://github.com/PoslavskySV/rings , documentation: http://rings.readthedocs.io/en/latest/ [ABSTRACT FROM AUTHOR]

A computation-oriented representation of uncertain kinetic systems is introduced and analysed in this paper. It is assumed that the monomial coefficients of the ODEs belong to a polytopic set, which defines a set of dynamical systems for an uncertain model. An optimization-based computation model is proposed for the structural analysis of uncertain models. It is shown that the so-called dense realization containing the maximal number of reactions (directed edges) is computable in polynomial time, and it forms a superstructure among all the possible reaction graphs corresponding to an uncertain kinetic model, assuming a fixed set of complexes. The set of core reactions present in all reaction graphs of an uncertain model is also studied. Most importantly, an algorithm is proposed to compute all possible reaction graph structures for an uncertain kinetic model. [ABSTRACT FROM AUTHOR]

Abstract: This work suggests a new analytical technique called the fractional homotopy analysis transform method (FHATM) for solving nonlinear homogeneous and nonhomogeneous time-fractional gas dynamics equations. The FHATM is an innovative adjustment in Laplace transform algorithm (LTA) and makes the calculation much simpler. The proposed technique solves the nonlinear problems without using Adomian polynomials and He’s polynomials which can be considered as a clear advantage of this new algorithm over decomposition and the homotopy perturbation transform method. In this paper, it can be observed that the auxiliary parameter , which controls the convergence of the HATM approximate series solutions, also can be used in predicting and calculating multiple solutions. This is a basic and more qualitative difference in analysis between HATM and other methods. The solutions obtained by the proposed method indicate that the approach is easy to implement and computationally very attractive. The proposed method is illustrated by solving some numerical examples. [Copyright &y& Elsevier]

Abstract: The issue of computing (co)homology generators of a cell complex is gaining a pivotal role in various branches of science. While this issue may be rigorously solved in polynomial time, it is still overly demanding for large scale problems. Drawing inspiration from low-frequency electrodynamics, this paper presents a physics inspired algorithm for first cohomology group computations on three-dimensional complexes. The algorithm is general and exhibits orders of magnitude speed up with respect to competing ones, allowing to handle problems not addressable before. In particular, when generators are employed in the physical modeling of magneto-quasistatic problems, this algorithm solves one of the most long-lasting problems in low-frequency computational electromagnetics. In this case, the effectiveness of the algorithm and its ease of implementation may be even improved by introducing the novel concept of lazy cohomology generators. [Copyright &y& Elsevier]

Abstract: In this paper, we present a method for the computation of the low-lying real eigenvalues of the Wilson–Dirac operator based on the Arnoldi algorithm. These eigenvalues contain information about several observables. We used them to calculate the sign of the fermion determinant in one-flavor QCD and the sign of the Pfaffian in super Yang–Mills theory. The method is based on polynomial transformations of the Wilson–Dirac operator, leading to considerable improvements of the computation of eigenvalues. We introduce an iterative procedure for the construction of the polynomials and demonstrate the improvement in the efficiency of the computation. In general, the method can be applied to operators with a symmetric and bounded eigenspectrum. [Copyright &y& Elsevier]

The Adomian decomposition method (ADM) is one of the most effective methods for constructing analytic approximate solutions of nonlinear differential equations. In this paper, based on the new definition of the Adomian polynomials, and the two-step Adomian decomposition method (TSADM) combined with the Padé technique, a new algorithm is proposed to construct accurate analytic approximations of nonlinear differential equations with initial conditions. Furthermore, a MAPLE package is developed, which is user-friendly and efficient. One only needs to input a system, initial conditions and several necessary parameters, then our package will automatically deliver analytic approximate solutions within a few seconds. Several different types of examples are given to illustrate the validity of the package. Our program provides a helpful and easy-to-use tool in science and engineering to deal with initial value problems. Program summary: Program title: NAPA Catalogue identifier: AEJZ_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEJZ_v1_0.html Program obtainable from: CPC Program Library, Queenʼs University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 4060 No. of bytes in distributed program, including test data, etc.: 113 498 Distribution format: tar.gz Programming language: MAPLE R13 Computer: PC Operating system: Windows XP/7 RAM: 2 Gbytes Classification: 4.3 Nature of problem: Solve nonlinear differential equations with initial conditions. Solution method: Adomian decomposition method and Padé technique. Running time: Seconds at most in routine uses of the program. Special tasks may take up to some minutes. [ABSTRACT FROM AUTHOR]

Abstract: In this paper an algorithm is proposed for the retrieval of a wide class of invariants in quasi-polynomial systems. The invariance properties of the algorithm under different transformations are discussed. The application of the algorithm is illustrated on physical and numerical examples. The algorithm has been implemented in the MATLAB computing environment. [Copyright &y& Elsevier]