Related papers: Noda Iteration for Computing Generalized Tensor Ei…
We propose a new modification of Newton iteration for finding some nonnegative Z-eigenpairs of a nonnegative tensor. The method has local quadratic convergence to a nonnegative eigenpair of a nonnegative tensor, under the usual assumption…
We propose a modified Newton iteration for finding some nonnegative Z-eigenpairs of a nonnegative tensor. When the tensor is irreducible, all nonnegative eigenpairs are known to be positive. We prove local quadratic convergence of the new…
We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor…
In this paper, a novel multigrid method based on Newton iteration is proposed to solve nonlinear eigenvalue problems. Instead of handling the eigenvalue $\lambda$ and eigenfunction $u$ separately, we treat the eigenpair $(\lambda, u)$ as…
We are concerned with the tensor equations whose coefficient tensor is an M-tensor. We first propose a Newton method for solving the equation with a positive constant term and establish its global and quadratic convergence. Then we extend…
Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…
In this paper, based on the Noda iteration, we present inexact Noda iterations (INI), to find the smallest eigenvalue and the associated positive eigenvector of a large irreducible nonsingular M-matrix. The positivity of approximations is…
The general linear model is a universally accepted method to conduct and test multiple linear regression models. Using this model one has the ability to simultaneously regress covariates among different groups of data. Moreover, there are…
We are concerned with the tensor equation with an M-tensor or Z-tensor, which we call the M- tensor equation or Z-tensor equation respectively. We derive a necessary and sufficient condition for a Z (or M)-tensor equation to have…
In this paper, the generalized eigenvalue complementarity problem for tensors (GEiCP-T) is addressed, which arises from the stability analysis of finite dimensional mechanical systems and find applications in differential dynamical systems.…
Real eigenpairs of symmetric tensors play an important role in multiple applications. In this paper we propose and analyze a fast iterative Newton-based method to compute real eigenpairs of symmetric tensors. We derive sufficient conditions…
In this paper, we present an inexact Noda iteration with inner-outer iterations for finding the smallest eigenvalue and the associated eigenvector of an irreducible monotone matrix. The proposed inexact Noda iteration contains two main…
We propose a new type of multilevel method for solving eigenvalue problems based on Newton iteration. With the proposed iteration method, solving eigenvalue problem on the finest finite element space is replaced by solving a small scale…
In this paper, we propose a type of tensor-neural-network-based machine learning method to compute multi-eigenpairs of high dimensional eigenvalue problems without Monte-Carlo procedure. Solving multi-eigenvalues and their corresponding…
We develop a generalized Newton scheme IHNC for the construction of effective pair potentials for systems of interacting point-like particles.The construction is made in such a way that the distribution of the particles matches a given…
Recent technological developments have led to big data processing, which resulted in significant computational difficulties when solving large-scale linear systems or inverting matrices. As a result, fast approximate iterative matrix…
We study the general $(\boldsymbol{\sigma},\mathbf{p})$-eigenvalue problem of nonnegative tensors introduced by A. Gautier, F. Tudisco, and M. Hein [SIAM J. Matrix Anal. Appl., 40 (2019), pp. 1206--1231], which unifies several well-studied…
In this paper, we derive new model formulations for computing generalized singular values of a Grassman matrix pair. These new formulations make use of truncated filter matrices to locate the $i$-th generalized singular value of a Grassman…
Unconstrained convex optimization problems have enormous applications in various field of science and engineering. Different iterative methods are available in literature to solve such problem, and Newton method is among the oldest and…
We first investigate properties of M-tensor equations. In particular, we show that if the constant term of the equation is nonnegative, then finding a nonnegative solution of the equation can be done by finding a positive solution of a…