Related papers: A class of multiplicative splitting iterations for…
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…
In this paper we propose a new fast splitting algorithm to solve the Weighted Split Bregman minimization problem in the backward step of an accelerated Forward-Backward algorithm. Beside proving the convergence of the method, numerical…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
We present new splitting methods designed for the numerical integration of near-integrable Hamiltonian systems, and in particular for planetary N-body problems, when one is interested in very accurate results over a large time span. We…
The superiority of stochastic symplectic methods over non-symplectic counterparts has been verified by plenty of numerical experiments, especially in capturing the asymptotic behaviour of the underlying solution process. How can one…
We discuss a new approach to solve the low lying states of the Schroedinger equation. For a fairly large class of problems, this new approach leads to convergent iterative solutions, in contrast to perturbative series expansions. These…
We propose a variational splitting technique for the generalized-$\alpha$ method to solve hyperbolic partial differential equations. We use tensor-product meshes to develop the splitting method, which has a computational cost that grows…
In this work we discuss the possibility to reduce the computational complexity of modal methods, i.e. methods based on eigenmodes expansion, from the third power to the second power of the number of eigenmodes. The proposed approach is…
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.…
A new method for solving numerically stochastic partial differential equations (SPDEs) with multiple scales is presented. The method combines a spectral method with the heterogeneous multiscale method (HMM) presented in [W. E, D. Liu, and…
In this paper we use some basic facts from the theory of (matrix) Lie groups and algebras to show that many of the classical matrix splittings used to construct stationary iterative methods and preconditioniers for Krylov subspace methods…
We consider the low-rank alternating directions implicit (ADI) iteration for approximately solving large-scale algebraic Sylvester equations. Inside every iteration step of this iterative process a pair of linear systems of equations has to…
In [8], some exact splittings are proposed for inhomogeneous quadratic differential equations including, for example, transport equations, kinetic equations, and Schr{\"o}dinger type equations with a rotation term. In this work, these exact…
The paper is to reveal the direct links between the well known Sylvester equation in matrix theory and some integrable systems. Using the Sylvester equation $\boldsymbol{K} \boldsymbol{M}+\boldsymbol{M} \boldsymbol{K}=\boldsymbol{r}\,…
In this paper, the concept of matrix splitting is introduced to solve a large sparse ill-posed linear system via Tikhonov's regularization. In the regularization process, we convert the ill-posed system to a well-posed system. The…
In the previous work [2] (i.e., arXiv:2105.03385), we considered continuous solutions of an iterative equation involving the multiplication of iterates. In this paper, we continue to investigate this equation for differentiable solutions.…
For standard algorithms verifying positive definiteness of a matrix $A\in\mathbb{M}_n(\mathbb{R})$ based on Sylvester's criterion, the computationally pessimistic case is this when $A$ is positive definite. We present two algorithms…