Tensor methods for solving symmetric M-tensor systems
From MaRDI portal
Publication:1703065
The authors present a tensor method based on a symmetric tensor rank-\(1\) approximation to solve tensor systems expressed by tensor vector products. They provide a numerical algorithm and give the corresponding convergence analysis. Some numerical experiments compare the new method with previously studied methods.
Recommendations
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- ITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATION
- scientific article; zbMATH DE number 3997032
- Tensor product-type methods for solving Sylvester tensor equations
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- Tensor Methods for Nonlinear Equations
- Solving multilinear systems via tensor inversion
- Gradient based iterative methods for solving symmetric tensor equations
- Two new algorithms for solving multi-linear systems with M-tensor
- Tensor methods for large sparse systems of nonlinear equations
Cites work
- \(M\)-tensors and nonsingular \(M\)-tensors
- \(M\)-tensors and some applications
- Algorithm 768: TENSOLVE
- Curvilinear Linesearch for Tensor Methods
- Eigenvalues of a real supersymmetric tensor
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Local convergence analysis of tensor methods for nonlinear equations
- On eigenvalue problems of real symmetric tensors
- On the Performance of Tensor Methods for Solving Ill-Conditioned Problems
- Rate of convergence of higher-order methods
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Solving multilinear systems via tensor inversion
- Solving sparse non-negative tensor equations: algorithms and applications
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm
- Symmetric Tensors and Symmetric Tensor Rank
- Tensor analysis. Spectral theory and special tensors
- Tensor Decompositions and Applications
- Tensor Methods for Equality Constrained Optimization
- Tensor Methods for Large, Sparse Unconstrained Optimization
- Tensor Methods for Nonlinear Equations
- Tensor-GMRES Method for Large Systems of Nonlinear Equations
- Tensor-Krylov Methods for Solving Large-Scale Systems of Nonlinear Equations
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Theory and computation of tensors. Multi-dimensional arrays
Cited in
(70)- Comparison results for splitting iterations for solving multi-linear systems
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- General and physically privileged solutions to certain symmetric systems of linear PDE's with tensor functionals as unknowns
- Tensor absolute value equations
- Interval tensors and their application in solving multi-linear systems of equations
- A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
- A lower dimensional linear equation approach to the m-tensor complementarity problem
- Newton's method for M-tensor equations
- A homotopy method for solving multilinear systems with strong completely positive tensors
- A general preconditioner accelerated SOR-type iterative method for multi-linear systems with \(\mathcal{Z}\)-tensors
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations
- A proximal point like method for solving tensor least-squares problems
- Fast verified computation for positive solutions to \(\mathcal{M} \)-tensor multi-linear systems and Perron vectors of a kind of weakly irreducible nonnegative tensors
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
- Novel accelerated methods of tensor splitting iteration for solving multi-systems
- Exact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensor
- General tail bounds for random tensors summation: majorization approach
- Preconditioned Jacobi type method for solving multi-linear systems with \(\mathcal{M}\)-tensors
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- The accelerated overrelaxation splitting method for solving symmetric tensor equations
- A new preconditioner of the tensor splitting iterative method for solving multi-linear systems with \(\mathcal{M}\)-tensors
- The tensor splitting methods for solving tensor absolute value equation
- Numerical solution of a class of third order tensor linear equations
- A fixed point iterative method for tensor complementarity problems
- Further results on Moore-Penrose inverses of tensors with application to tensor nearness problems
- Preconditioned tensor splitting iterations method for solving multi-linear systems
- Newton's method for solving the tensor square root problem
- Existence and uniqueness of positive solution for \(\mathcal{H}^+\)-tensor equations
- Tensor complementarity problems. II: Solution methods
- Generalized tensor equations with leading structured tensors
- Neural network approach for solving nonsingular multi-linear tensor systems
- Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition
- A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations
- Modified three-term conjugate gradient method and its applications
- Linearized methods for tensor complementarity problems
- Some results on Brauer-type and Brualdi-type eigenvalue inclusion sets for tensors
- \(Z\)-eigenvalues based structured tensors: \(\mathcal{M}_Z\)-tensors and strong \(\mathcal{M}_Z\)-tensors
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Accelerated dynamical approaches for finding the unique positive solution of \(\mathcal{KS}\)-tensor equations
- Solving multilinear systems via tensor inversion
- Preconditioned AOR iterative methods for solving multi-linear systems with \(\mathcal{M} \)-tensor
- Gradient based iterative methods for solving symmetric tensor equations
- ITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATION
- Solving coupled tensor equations via higher order LSQR methods
- A homotopy method for multikernel-based approximation
- The outer generalized inverse of an even-order tensor with the Einstein product through the matrix unfolding and tensor folding
- Finding a nonnegative solution to an M-tensor equation
- Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product
- Characterizations and representations for the CMP inverse and its application
- Slice tensor splitting method for solving tensor equation
- Tensor product-type methods for solving Sylvester tensor equations
- A new preconditioner for Gauss-Seidel method for solving multi-linear systems
- Structured derivation of moment equations and stable boundary conditions with an introduction to symmetric, trace-free tensors
- A new preconditioned AOR-type method for \(\mathcal{M}\)-tensor equation
- A copositivity-type existence result for weakly homogeneous variational inequalities
- Iterative methods for solving tensor equations based on exponential acceleration
- Iterative methods for sparse symmetric multilinear systems
- A new \((I+P)\)-like preconditioner for the SOR method for solving multi-linear systems with \(\mathcal{M}\)-tensors
- A new preconditioned Gauss-Seidel method for solving \(\mathcal{M}\)-tensor multi-linear system
- Neural networks for solving least squares solution of polynomial systems with time-varying tensors
- Restarted nonnegativity preserving tensor splitting methods via relaxed Anderson acceleration for solving multilinear systems
- A scalable optimization approach for the multilinear system arising from scattered data interpolation
- An ADMM-based interior point method for solving nonnegative tensor least squares problems and its applications
- Tensor splitting preconditioners for multilinear systems
- A tensor alternating Anderson-Richardson method for solving multilinear systems with \(\mathcal{M}\)-tensors
- Geometric programming for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
- On the multilinear systems. I: Comparison of splittings of tensors
- A noise-tolerant and fixed-time zeroing neural network model for solving multi-linear \(\mathcal{M}\)-tensor equations
- Further study on tensor absolute value equations
This page was built for publication: Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703065)
