Numerical subspace algorithms for solving the tensor equations involving Einstein product
From MaRDI portal
Publication:5858535
DOI10.1002/nla.2351OpenAlexW3108840043MaRDI QIDQ5858535
Publication date: 13 April 2021
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2351
projection methodimage restorationtensor equationconjugate residual algorithmEinstein productgeneralized conjugate residual algorithm
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10)
Related Items (7)
The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint ⋮ A note on numerical ranges of tensors ⋮ An efficient iterative method for solving a class of constrained tensor least squares problem ⋮ Deflated and restarted Krylov subspace methods for Sylvester tensor equations ⋮ Numerical range for weighted Moore-Penrose inverse of tensor ⋮ Numerical study on Moore-Penrose inverse of tensors via Einstein product ⋮ A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
This page was built for publication: Numerical subspace algorithms for solving the tensor equations involving Einstein product