Related papers: A matrix method based on the Fibonacci polynomials…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
Effective matrix methods for solving standard linear algebra problems in a commutative domains are discussed. Two of them are new. There are a methods for computing adjoined matrices and solving system of linear equations in a commutative…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…
This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
In this paper, an easy-to-implement and computationally effective numerical method based on the new orthogonal hybrid functions is developed to solve system of fractional order differential equations numerically. The new orthogonal hybrid…
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
We propose a generalization of Heisenbergs' matrix mechanics based on many-index objects. It is shown that there exists a solution describing a harmonic oscillator and many-index objects lead to a generalization of spin algebra.
It is possible to generalize the fruitful interaction between (real or complex) Jacobi matrices, orthogonal polynomials and Pade approximants at infinity by considering rational interpolants, (bi-)orthogonal rational functions and linear…
We investigate the presence of localized solutions in models described by a single real scalar field with generalized dynamics. The study offers a method to solve very intricate nonlinear ordinary differential equations, and we illustrate…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…
In this paper, a formula for the solution of the Poincar\'{e} functional equation in algebra of formal power series and its application to continuous iteration are presented.
It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…
The method of this paper is my original creation. A new method for solving linear differential equations is proposed in this paper. The important conclusion of this paper is that arbitrary order linear ordinary differential equations with…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
A collocation method is presented for numerical solution of a typical integral equation Rh :=\int_D R(x, y)h(y)dy = f(x), x {\epsilon} D of the class R, whose kernels are of positive rational functions of arbitrary selfadjoint elliptic…