Related papers: A New Operator and Method for Solving Interval Lin…
The main objective of this paper is to introduce an algorithm for solving fractional and classical differential equations based on a new generalized fractional power series. The algorithm relies on expanding the solution of an FDE or an ODE…
This article firstly develops a proximal explicit approach for the generalized method of lines. In such a method, the domain of the PDE in question is discretized in lines and the equation solution is written on these lines as functions of…
This article proposes a new class of general linear method with $p=q$ and $r=s=p+1$. The construction of the present method is carried out using order conditions and error minimization subject to $A$- stability constraints. The proposed…
We introduce a simple, rigorous, and unified framework for solving nonlinear partial differential equations (PDEs), and for solving inverse problems (IPs) involving the identification of parameters in PDEs, using the framework of Gaussian…
We present a novel greedy Gauss-Seidel method for solving large linear least squares problem. This method improves the greedy randomized coordinate descent (GRCD) method proposed recently by Bai and Wu [Bai ZZ, and Wu WT. On greedy…
In a series of recent papers we have shown how the dynamical behavior of certain classical systems can be analyzed using operators evolving according to Heisenberg-like equations of motions. In particular, we have shown that raising and…
In geometry processing, numerical optimization methods often involve solving sparse linear systems of equations. These linear systems have a structure that strongly resembles to adjacency graphs of the underlying mesh. We observe how…
The aim of this paper is to present the recently proposed fluid diffusion based algorithm in the general context of the matrix inversion problem associated to the Gauss-Seidel method. We explain the simple intuitions that are behind this…
Recently, various high-order methods have been developed to solve the convex optimization problem. The auxiliary problem of these methods shares the general form that is the same as the high-order proximal operator proposed by Nesterov. In…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
We present a novel solution method for It\^o stochastic differential equations (SDEs). We subdivide the time interval into sub-intervals, then we use the quadratic polynomials for the approximation between two successive intervals. The main…
In this article I present a fast and direct method for solving several types of linear finite difference equations (FDE) with constant coefficients. The method is based on a polynomial form of the translation operator and its inverse, and…
This paper proposes and analyzes a new operator splitting method for stochastic Maxwell equations driven by additive noise, which not only decomposes the original multi-dimensional system into some local one-dimensional subsystems, but also…
A general method for solving linear differential equations of arbitrary order, is used to arrive at new representations for the solutions of the known differential equations, both without and with a source term. A new quasi-solvable…
The objective of this work is to present a novel approach for the solution of Pentadiagonal Toeplitz systems of equations that is both faster and more effective than existing classical direct methods. The distinctive structure of…
This paper proposes a new gradient method to solve the large-scale problems. Theoretical analysis shows that the new method has finite termination property for two dimensions and converges R-linearly for any dimensions. Experimental results…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
A new algorithm is presented for computing a direct solution to a system of consistent linear equations. It produces a minimum norm particular solution, a generalized inverse (of type {124}), and a null space projection operator. In…
We consider convolution integral equations on a finite interval with a real-valued kernel of even parity, a problem equivalent to finding a Wiener-Hopf factorisation of a notoriously difficult class of $2\times 2$ matrices. The kernel…
An efficient approximate version of implicit Taylor methods for initial-value problems of systems of ordinary differential equations (ODEs) is introduced. The approach, based on an approximate formulation of Taylor methods, produces a…