A Globally and Quadratically Convergent Algorithm for Solving Multilinear Systems with M-tensors
MetadataShow full item record
The final publication is available at Springer via 10.1007/s10915-018-0689-7
We consider multilinear systems of equations whose coefficient tensors are (Formula presented.)-tensors. Multilinear systems of equations have many applications in engineering and scientific computing, such as data mining and numerical partial differential equations. In this paper, we show that solving multilinear systems with (Formula presented.)-tensors is equivalent to solving nonlinear systems of equations where the involving functions are P-functions. Based on this result, we propose a Newton-type method to solve multilinear systems with (Formula presented.)-tensors. For a multilinear system with a nonsingular (Formula presented.)-tensor and a positive right side vector, we prove that the sequence generated by the proposed method converges to the unique solution of the multilinear system and the convergence rate is quadratic. Numerical results are reported to show that the proposed method is promising.
Showing items related by title, author, creator and subject.
Grafarend, E.; Awange, Joseph (2012)Here we present a nearly complete treatment of the Grand Universe of linear and weakly nonlinear regression models within the first 8 chapters. Our point of view is both an algebraic view as well as a stochastic one. For ...
Liu, Chunmin (2008)The optimization problems involving stochastic systems are often encountered in financial systems, networks design and routing, supply-chain management, actuarial science, telecommunications systems, statistical pattern ...
Rana, Santu; Liu, Wan-quan; Lazarescu, Mihai; Venkatesh, Svetha (2009)In this paper we propose a new optimization framework that unites some of the existing tensor based methods for face recognition on a common mathematical basis. Tensor based approaches rely on the ability to decompose an ...