Related papers: A fast and simple algorithm for the computation of…
We present novel fully-symmetric quadrature rules with positive weights and strictly interior nodes of degrees up to 84 on triangles and 40 on tetrahedra. Initial guesses for solving the nonlinear systems of equations needed to derive…
This paper focuses on the numerical solution of initial value problems for fractional differential equations of linear type. The approach we propose grounds on expressing the solution in terms of some integral weighted by a generalized…
We study in this paper the continuous and discrete Euler-Lagrange equations arising from a quadratic lagrangian. Those equations may be thought as numerical schemes and may be solved through a matrix based framework. When the lagrangian is…
The goal of this notice is to present a proof of Bachet's conjecture based exclusively on the fundamental theorem of arithmetic. The novelty of this proof consists in its introduction of a partial order on rational integers through the…
If several independent algorithms for a computer-calculated quantity exist, then one can expect their results (which differ because of numerical errors) to follow approximately Gaussian distribution. The mean of this distribution,…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
A method is presented for the fast evaluation of the transient acoustic field generated outside a spherical surface using surface data on the sphere. The method employs Lebedev quadratures, which are optimal integration on the sphere, and…
This study focuses on addressing the challenge of solving the reduced biquaternion equality constrained least squares (RBLSE) problem. We develop algebraic techniques to derive real and complex solutions for the RBLSE problem by utilizing…
The article presents the general notions and algorithm about the Gauss-Jordan method. An eloquent example is given and the Turbo C program illustrated this method. We conclude that we can obtain by this method the determinant, by simple…
In this paper, we consider the Gauss quadrature formulae corresponding to some modifications of anyone of the four Chebyshev weights, considered by Gautschi and Li in \cite{gauli}. As it is well known, in the case of analytic integrands,…
Although the real reproducing kernels are used in an increasing number of machine learning problems, complex kernels have not, yet, been used, in spite of their potential interest in applications such as communications. In this work, we…
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…
In this article, we present the mathematical analysis of the convergence of the linearized Crank-Nicolson Galerkin method for a nonlinear Schrodinger problem related to a domain with a moving boundary. The convergence analysis of the…
The molecule solution of an equation related to the lattice Boussinesq equation is derived with the help of determinantal identities. It is shown that this equation can for certain sequences be used as a numerical convergence acceleration…
A numerical scheme is presented to solve the one source near field refractor problem to arbitrary precision and it is proved that the scheme terminates in a finite number of iterations. The convergence of the algorithm depends upon proving…
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…
It is well-known that the two-parameter Mittag-Leffler (ML) function plays a key role in Fractional Calculus. In this paper, we address the problem of computing this function, when its argument is a square matrix. Effective methods for…
We introduce an efficient algorithm for computing fractional integrals and derivatives and apply it for solving problems of the calculus of variations of fractional order. The proposed approximations are particularly useful for solving…
Employing the Lagrange inverting series, a solution of the transcendental equation $(x-a)(x-b)=le^{x}$, that can be considered a quadratic generalization of the equation defining Lambert $W$ function, has been found in terms of Bessel…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…