Related papers: Fraction-free algorithm for the computation of dia…
For a skew polynomial ring $R=A[X;\theta,\delta]$ where $A$ is a commutative Frobenius ring, $\theta$ an endomorphism of $A$ and $\delta$ a $\theta$-derivation of $A$, we consider cyclic left module codes $\mathcal{C}=Rg/Rf\subset R/Rf$…
While existing algorithms may be used to solve a linear system over a general field in matrix-multiplication time, the complexity of constructing a symmetric triangular factorization (LDL) has received relatively little formal study. The…
The direct computation of the third-order normal form for a geometrically nonlinear structure discretised with the finite element (FE) method, is detailed. The procedure allows to define a nonlinear mapping in order to derive accurate…
We present a fully non-intrusive parametric reduced-order modeling (PROM) framework for geometrically nonlinear structures subject to geometric variations. The method builds upon equation-driven Galerkin ROMs constructed from vibration…
The construction of robust solvers for linear systems obtained from the discretization of partial differential equations using Isogeometric Analysis is challenging since the condition number of the system matrix not only grows with the…
In this manuscript, we propose matrix- and tensor-oriented methods for the numerical solution of the multidimensional evolutionary space-fractional complex Ginzburg--Landau equation. After a suitable spatial semidiscretization, the…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
This article describes an approximation technique based on fractional order Bernstein wavelets for the numerical simulations of fractional oscillation equations under variable order, and the fractional order Bernstein wavelets are derived…
The fastest known algorithms for dealing with structured matrices, in the sense of the displacement rank measure, are randomized. For handling classical displacement structures, they achieve the complexity bounds…
The Laguerre functions constitute one of the fundamental basis sets for calculations in atomic and molecular electron-structure theory, with applications in hadronic and nuclear theory as well. While similar in form to the Coulomb…
In this paper we introduce a new mathematical tool to solve fractional equations representing models of fractional systems : The Ultradistributions. Ultradistributions permit us to unify the notion of integral and derivative in one only…
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…
LU-factorization of matrices is one of the fundamental algorithms of linear algebra. The widespread use of supercomputers with distributed memory requires a review of traditional algorithms, which were based on the common memory of a…
We present an intriguing discovery related to Random Fourier Features: in Gaussian kernel approximation, replacing the random Gaussian matrix by a properly scaled random orthogonal matrix significantly decreases kernel approximation error.…
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…
The Riemann-Liouville formula for fractional derivatives and integrals (differintegration) is used to derive formulae for matrix order derivatives and integrals. That is, the parameter for integration and differentiation is allowed to…
In this paper, we introduce innovative approaches for accelerating the Jacobi method for matrix diagonalization, specifically through the formulation of large matrix diagonalization as a Semi-Markov Decision Process and small matrix…
We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of \texttt{msolve} relies on Gr\''obner bases and…
The primary goal of this research is to propose a novel architecture for a deep neural network that can solve fractional differential equations accurately. A Gaussian integration rule and a $L_1$ discretization technique are used in the…
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…