Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
From MaRDI portal
Publication:2287603
DOI10.1016/j.amc.2019.124892zbMath1433.65046OpenAlexW2988350657WikidataQ126788959 ScholiaQ126788959MaRDI QIDQ2287603
Publication date: 21 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124892
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69)
Related Items
The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint, On RGI algorithms for solving Sylvester tensor equations, Paige's algorithm for solving a class of tensor least squares problem, Tensor product-type methods for solving Sylvester tensor equations, Finite-time zeroing neural networks with novel activation function and variable parameter for solving time-varying Lyapunov tensor equation, Weighted Moore-Penrose inverses of arbitrary-order tensors, A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors, Developing iterative algorithms to solve Sylvester tensor equations, A rapid and powerful iterative method for computing inverses of sparse tensors with applications, An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor, Improved finite-time solutions to time-varying Sylvester tensor equation via zeroing neural networks, Iterative methods for solving Sylvester transpose tensor equation \(\mathcal A\star_N\mathcal X\star_M\mathcal{B}+\mathcal{C}\star_M\mathcal X^T\star_N\mathcal{D}=\mathcal{E} \), Absolute value equations with tensor product structure: unique solvability and numerical solution., A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- Perron-Frobenius theorem for nonnegative tensors
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- A general product of tensors with applications
- Eigenvalues of a real supersymmetric tensor
- Iterative least-squares solutions of coupled sylvester matrix equations
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Moore–Penrose inverse of tensors via Einstein product
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Solving Multilinear Systems via Tensor Inversion
- Backward error and perturbation bounds for high order Sylvester tensor equation
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- A Hessenberg-Schur method for the problem AX + XB= C
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A Multilinear Singular Value Decomposition
- Gradient based iterative algorithms for solving a class of matrix equations
- Further results on generalized inverses of tensors via the Einstein product
- A projection method to solve linear systems in tensor format
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
