Pages that link to "Item:Q2287603"
From MaRDI portal
The following pages link to Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations (Q2287603):
Displaying 14 items.
- Weighted Moore-Penrose inverses of arbitrary-order tensors (Q1983772) (← links)
- An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor (Q2020532) (← links)
- Improved finite-time solutions to time-varying Sylvester tensor equation via zeroing neural networks (Q2060219) (← links)
- 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} \) (Q2068845) (← links)
- Absolute value equations with tensor product structure: unique solvability and numerical solution. (Q2093336) (← links)
- A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems (Q2108512) (← links)
- On RGI algorithms for solving Sylvester tensor equations (Q2154934) (← links)
- Developing iterative algorithms to solve Sylvester tensor equations (Q2244172) (← links)
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications (Q2247163) (← links)
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors (Q5080089) (← links)
- The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint (Q5888837) (← links)
- Paige's algorithm for solving a class of tensor least squares problem (Q6093561) (← links)
- Tensor product-type methods for solving Sylvester tensor equations (Q6096254) (← links)
- Finite-time zeroing neural networks with novel activation function and variable parameter for solving time-varying Lyapunov tensor equation (Q6106003) (← links)