Absolute Value Equations with Tensor Product Structure: Unique Solvability and Numerical Solution

Applications of Mathematics - We consider the absolute value equations (AVEs) with a certain tensor product structure. Two aspects of this kind of AVEs are discussed in detail: the solvability and...     

On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations

This paper deals with studying some of well‐known iterative methods in their tensor forms to solve a Sylvester tensor equation. More precisely, the tensor form of the Arnoldi process and full orthogonalization method are derived by using a product between two tensors. Then tensor forms of the conjugate gradient and nested conjugate gradient algorithms are also presented. Rough estimation of the required number of operations for the tensor form of the Arnoldi process is obtained, which reveals the advantage of handling the algorithms based on tensor format over their classical forms in general. Some numerical experiments are examined, which confirm the feasibility and applicability of the proposed algorithms in practice. Copyright © 2016 John Wiley & Sons, Ltd.     

Tensor extrapolation methods with applications

Numerical Algorithms - The bivariate sinc-Gauss sampling formula is introduced in Asharabi and Prestin (IMA J. Numer. Anal. 36:851–871, 2016) to approximate analytic functions of two...