Related papers: A New Fast Direct Method For Solving Quasi-Toeplit…
The fully discrete problem for convection-diffusion equation is considered. It comprises compact approximations for spatial discretization, and Crank-Nicolson scheme for temporal discretization. The expressions for the entries of inverse of…
We introduce a generalized finite difference method for solving a large range of fully nonlinear elliptic partial differential equations in three dimensions. Methods are based on Cartesian grids, augmented by additional points carefully…
BDDC method is the most advanced method from the Balancing family of iterative substructuring methods for the solution of large systems of linear algebraic equations arising from discretization of elliptic boundary value problems. In the…
In this paper, we will utilize the dual method to construct multiple nonradial normalized solutions of the following quasilinear Schr\"{o}dinger equation: \begin{equation*} -\Delta u-\Delta(|u|^{2})u-\mu u=|u|^{p-2}u, \qquad in \quad…
The convergence analysis of a third-order scheme for the highly nonlinear Landau-Lifshitz-Gilbert equation with a non-convex constraint is considered. In this paper, we first present a fully discrete semi-implicit method for solving the…
This paper discusses the explicit inverse of a class of seven-diagonal (near) Toeplitz matrices, which arises in the numerical solutions of nonlinear fourth-order differential equation with a finite difference method. A non-recurrence…
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…
In this paper a nonlinear coupled Schrodinger system in the presence of mixed cubic and superlinear power laws is considered. A non standard numerical method is developed to approximate the solutions in higher dimensional case. The idea…
This is a work in two parts in which we show how to solve a large class of Lindblad master equations for non-interacting particles on $L$ sites. In part I we concentrate on bosonic particles. We show how to reduce the problem to…
By applying the linearly implicit conservative difference scheme proposed in [D.-L. Wang, A.-G. Xiao, W. Yang. J. Comput. Phys. 2014;272:670-681], the system of repulsive space fractional coupled nonlinear Schr\"odinger equations leads to a…
We propose an iterative finite element method for solving non-linear hydromagnetic and steady Euler's equations. Some three-dimensional computational tests are given to confirm the convergence and the high efficiency of the method.
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…
Interpolation and smoothing using cubic and generalized splines are fundamental tools in data analysis and statistical modeling. Recently, fast computational algorithms were developed for natural $L$-splines of order four, which arise as…
A robust, fast and accurate method for solving the Colebrook-like equations is presented. The algorithm is efficient for the whole range of parameters involved in the Colebrook equation. The computations are not more demanding than…
We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…
We develop a novel method for finding bifurcations for nonlinear systems of equations based on directly finding bifurcations through saddle points of extended quotients. The method is applied to find the saddle-node bifurcation point for…
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that R^T.R is close to A^T.A. Thus, when the algorithm is used to solve the semi-normal equations R^T.Rx = A^Tb, we obtain…
We discuss the direct use of cubic-matrix splines to obtain continuous approximations to the unique solution of matrix models of the type $Y''(x) = f(x,Y(x))$. For numerical illustration, an estimation of the approximation error, an…
The focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton's method. There is a trade-off between solving Newton systems…