Related papers: Homotopy methods for multiplication modulo triangu…
We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main algorithms do not require any additional information or…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined…
This paper deals the implementation of \emph{homotopy perturbation transform method} (HPTM) for numerical computation of initial valued autonomous system of time-fractional partial differential equations (TFPDEs) with proportional delay,…
The effort to generate matrix exponentials and associated differentials, required to determine the time evolution of quantum systems, frequently constrains the evaluation of problems in quantum control theory, variational circuit…
In this article, we apply Homotopy Perturbation Method (HPM) for solving three coupled non-linear equations which play an important role in biosystems. To illustrate the capability and reliability of this method. Numerical example is given…
We study the complexity of some fundamental operations for triangular sets in dimension zero. Using Las-Vegas algorithms, we prove that one can perform such operations as change of order, equiprojectable decomposition, or quasi-inverse…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…
The dominant cost in solving least-square problems using Newton's method is often that of factorizing the Hessian matrix over multiple values of the regularization parameter ($\lambda$). We propose an efficient way to interpolate the…
In this study, a thorough investigation was conducted into the Homotopy Perturbation Method (HPM) and its application to solve the Burger and Blasius equations. The HPM is a mathematical technique that combines aspects of homotopy and…
We give new algorithms for the computation of square roots and reciprocals of power series in C[[x]]. If M(n) denotes the cost of multiplying polynomials of degree n, the square root to order n costs (1.333... + o(1)) M(n) and the…
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and…
Modular composition is the problem of computing the composition of two univariate polynomials modulo a third one. For a long time, the fastest algebraic algorithm for this problem was that of Brent and Kung (1978). Recently, we improved…
Although reliable long precision floating-point arithmetic libraries such as QD and MPFR/GMP are necessary to solve ill-conditioned problems in numerical simulation, long precision BLAS-level computation such as matrix multiplication has…
The homotopy analysis method known from its successful applications to obtain quasi-analytical approximations of solutions of ordinary and partial differential equations is applied to stochastic differential equations with Gaussian…
Mirkovic and Vilonen discovered a canonical basis of algebraic cycles for the intersection homology of (the closures of the strata of) the loop Grassmannian. The moment map images of these varieties are a collection of polytopes, and they…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
A polynomial homotopy is a family of polynomial systems, where the systems in the family depend on one parameter. If for one value of the parameter we know a regular solution, then what is the nearest value of the parameter for which the…
Studying algorithms admitting nontrivial symmetries is a prospective way of constructing new short algorithms of matrix multiplication. The main result of the article is that if there exists an algorithm of multiplicative length $l\leq22$…