Related papers: Computer Algebra Solving of First Order ODEs Using…
The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e. filiform Lie (super)algebras, into the theory of Lie algebras of order F$. Thus, the concept of filiform Lie algebras of order F is…
A Mathematica based program has been elaborated in order to determine the symmetry group of a finite difference equation, by means of its differential representation. The package provides functions which enable us to solve the determining…
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the…
Cylindrical algebraic decomposition (CAD) is a key tool for problems in real algebraic geometry and beyond. When using CAD there is often a choice over the variable ordering to use, with some problems infeasible in one ordering but simple…
A symmetry group method is used to obtain exact solutions for a semilinear radial heat equation in $n>1$ dimensions with a general power nonlinearity. The method involves an ansatz technique to solve an equivalent first-order PDE system of…
This paper belongs to a group of work in the intersection of symbolic computation and group analysis aiming for the symbolic analysis of differential equations. The goal is to extract important properties without finding the explicit…
Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…
The paper reports on a computer algebra program LSSS (Linear Selective Systems Solver) for solving linear algebraic systems with rational coefficients. The program is especially efficient for very large sparse systems that have a solution…
The solution $x_n\left(t\right)$, $n=1,2,$ of the \textit{initial-values} problem is reported of the \textit{autonomous} system of $2$ coupled first-order ODEs with \textit{homogeneous cubic polynomial} right-hand sides, \begin{eqnarray}…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
Using the theory of the symmetry group for PDEs [15, 17], we derive the symmetry group G associated to surfaces PDE. Several group invariant solutions of the surfaces PDE are given by solving a reduced system of partial differential…
We propose a geometric numerical analysis of SDEs admitting Lie symmetries which allows us to individuate a symmetry adapted coordinates system where the given SDE has notable invariant properties. An approximation scheme preserving the…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
In this article I present a fast and direct method for solving several types of linear finite difference equations (FDE) with constant coefficients. The method is based on a polynomial form of the translation operator and its inverse, and…
A new method of solving third-order ordinary complex differential equations (OCDEs) by generalizing Prelle-Singer. The idea which is a procedure for finding the solution for second-order differential equations in the real domain. We have…
This paper focuses on resolution in linguistic first order logic with truth value taken from linear symmetrical hedge algebra. We build the basic components of linguistic first order logic, including syntax and semantics. We present a…
First-order logic is a natural way of expressing the properties of computation, traditionally used in various program logics for expressing the correctness properties and certificates. Subsequently, modern methods in the automated inference…
We analyze the convergence of the Conjugate Gradient (CG) method in exact arithmetic, when the coefficient matrix $A$ is symmetric positive semidefinite and the system is consistent. To do so, we diagonalize $A$ and decompose the algorithm…