Inverse Family of Numerical Methods for Approximating All Simple and Roots with Multiplicity of Nonlinear Polynomial Equations with Engineering Applications

A new inverse family of the iterative method is interrogated in the present article for simultaneously estimating all distinct and multiple roots of nonlinear polynomial equations. Convergence analysis proves that the order of convergence of the newly constructed family of methods is two. The computer algebra systems CAS-Mathematica is used to determine the lower bound of convergence order, which justifies the local convergence of the newly developed method. Some nonlinear models from physics, chemistry, and engineering sciences are considered to demonstrate the performance and efficiency of the newly constructed family of inverse simultaneous methods in comparison to classical methods in the literature. The computational time in seconds and residual error graph of the inverse simultaneous methods are also presented to elaborate their convergence behavior.

SMIS: A Stepwise Multiple Integration Solver Using a CAS

Multiple Integration is a very important topic in different applications in Engineering and other Sciences. Using numerical software to get an approximation to the solution is a normal procedure. Another approach is working in an algebraic form to obtain an exact solution or to get general solutions depending on different parameters. Computer Algebra Systems (CAS) are needed for this last approach. In this paper, we introduce SMIS, a new stepwise solver for multiple integration developed in a CAS. The two main objectives of SMIS are: (1) to increase the capabilities of CAS to help the user to deal with this topic and (2) to be used in Math Education providing an important tool for helping with the teaching and learning process of this topic. SMIS can provide just the final solution or an optional stepwise solution (even including some theoretical comments). The optional stepwise solutions provided by SMIS are of great help for (2). Although SMIS has been developed in the specific CAS Derive, since the code is provided, it can be easily migrated to any CAS which deals with integrals and text management that allow us to display comments for intermediate steps.

On Some Reversible Cubic Systems

We study three systems from the classification of cubic reversible systems given by Żoła̧dek in 1994. Using affine transformations and elimination algorithms from these three families the six components of the center variety are derived and limit-cycle bifurcations in neighborhoods of the components are investigated. The invariance of the systems with respect to the generalized involutions introduced by Bastos, Buzzi and Torregrosa in 2021 is discussed. Computations are performed using the computer algebra systems Mathematica and Singular.

Light Inextensible Strings (Thread) Under Tension in the Schwarzschild Geometry

Light inextensible string under tension is a stalwart feature of elementary physics. Here I show how considering such a string in the vicinity of a black hole, with the help of computer algebra systems, can generate insight into the Schwarzschild geometry in the context of an undergraduate homework problem. Light taut strings minimize their proper length, given by integrating the spatial component of the Schwarzschild metric along the string. The path itself is given by straightforward numerical solution to the Euler–Lagrange equations. If the string is entirely outside the event horizon, its closest approach to the singularity is tangential. At this point the string is visibly curved, surely a memorable and informative insight. The geometry of the Schwarzschild metric induces some interesting nonlocal phenomena: if the distance of closest approach is less than about [Formula: see text], the string self-intersects, even though it is everywhere under tension. Light taut strings furnish a third interpretation of the concept “straight line”, the other two being null geodesics and free-fall world lines. All the software used is available under the GPL.1

New ideas for handling of loop and angular integrals in D-dimensions in QCD

We discuss new ideas for consideration of loop diagrams and angular integrals in D-dimensions in QCD. In case of loop diagrams, we propose the covariant formalism of expansion of tensorial loop integrals into the orthogonal basis of linear combinations of external momenta. It gives a very simple representation for the final results and is more convenient for calculations on computer algebra systems. In case of angular integrals we demonstrate how to simplify the integration of differential cross sections over polar angles. Also we derive the recursion relations, which allow to reduce all occurring angular integrals to a short set of basic scalar integrals. All order ε-expansion is given for all angular integrals with up to two denominators based on the expansion of the basic integrals and using recursion relations. A geometric picture for partial fractioning is developed which provides a new rotational invariant algorithm to reduce the number of denominators.

Verified Interactive Computation of Definite Integrals

Symbolic computation is involved in many areas of mathematics, as well as in analysis of physical systems in science and engineering. Computer algebra systems present an easy-to-use interface for performing these calculations, but do not provide strong guarantees of correctness. In contrast, interactive theorem proving provides much stronger guarantees of correctness, but requires more time and expertise. In this paper, we propose a general framework for combining these two methods, and demonstrate it using computation of definite integrals. It allows the user to carry out step-by-step computations in a familiar user interface, while also verifying the computation by translating it to proofs in higher-order logic. The system consists of an intermediate language for recording computations, proof automation for simplification and inequality checking, and heuristic integration methods. A prototype is implemented in Python based on HolPy, and tested on a large collection of examples at the undergraduate level.

Calculation of the normal modes of closed waveguides

The aim of the work is the development of numerical methods for solving waveguiding problems of the theory of waveguides, as well as their implementation in the form of software packages focused on a wide range of practical problems from the classical issues of microwave transmission to the design of optical waveguides and sensors. At the same time, we strive for ease of implementation of the developed methods in computer algebra systems (Maple, Sage) or in software oriented to the finite element method (FreeFem++). The work uses the representation of electromagnetic fields in a waveguide using four potentials. These potentials do not reduce the number of sought functions, but even in the case when the dielectric permittivity and magnetic permeability are described by discontinuous functions, they turn out to be quite smooth functions. A simple check of the operability of programs by calculating the normal modes of a hollow waveguide is made. It is shown that the relative error in the calculation of the first 10 normal modes does not exceed 4%. These results indicate the efficiency of the method proposed in this article.