Related papers: Size reduction and partial decoupling of systems o…
The cutoff method, which cuts off the values of a function less than a given number, is studied for the numerical computation of nonnegative solutions of parabolic partial differential equations. A convergence analysis is given for a broad…
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
We are interested in the numerical solution of coupled nonlinear partial differential equations (PDEs) in two and three dimensions. Under certain assumptions on the domain, we take advantage of the Kronecker structure arising in standard…
This paper is concerned with an alternative analytical solution of time-fractional nonlinear Schrodinger equation and nonlinear coupled Schrodinger equation obtained by employing fractional reduced differential transform method. The…
The paper deals with the decoupling problem of general quasilinear first order systems in two independent variables. We consider either the case of homogeneous and autonomous systems or the one of nonhomogeneous and/or nonautonomous…
In this note, we show that the decomposition group $Dec(I)$ of a zero-dimensional radical ideal $I$ in ${\bf K}[x_1,\ldots,x_n]$ can be represented as the direct sum of several symmetric groups of polynomials based upon using Gr\"{o}bner…
This paper introduces a novel approach to algebraic multigrid methods for large systems of linear equations coming from finite element discretizations of certain elliptic second order partial differential equations. Based on a discrete…
Using exhaustion method and finite differences a new method to solve system of partial differential equations and is presented. This method allows design algorithm to solve linear and nonlinear systems in irregular domains. Applying this…
This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…
We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial differential equations with highly varying coefficients. The method is based on a discontinuous Galerkin formulation. We present both a…
Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
A novel method, connecting the space of solutions of a linear differential equation, of arbitrary order, to the space of monomials, is used for exploring the algebraic structure of the solution space. Apart from yielding new expressions for…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
We prove first-order convergence of the semi-explicit Euler scheme combined with a finite element discretization in space for elliptic-parabolic problems which are weakly coupled. This setting includes poroelasticity, thermoelasticity, as…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
In this study, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the…
The contraction is applied to obtaining of integrable systems associated with nonsemisimple algebras. The effect of contraction is splitting off some components from initial system without loss of integrability.