Tensor product-type methods for solving Sylvester tensor equations
From MaRDI portal
Publication:6096254
DOI10.1016/j.amc.2023.128155MaRDI QIDQ6096254
Tomohiro Sogabe, Lei Du, Jing Niu, Shao-Liang Zhang, Tomoya Kemmochi
Publication date: 11 September 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Numerical linear algebra (65Fxx) Numerical methods for partial differential equations, boundary value problems (65Nxx) Basic linear algebra (15Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- A gradient based iterative solutions for Sylvester tensor equations
- Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- Tensor-structured preconditioners and approximate inverse of elliptic operators in \(\mathbb R^{d}\)
- An extension of the conjugate residual method to nonsymmetric linear systems
- Global optimization by multilevel coordinate search
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Hierarchical tensor-product approximation to the inverse and related operators for high-dimensional elliptic problems
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
- Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods
- Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES
- Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
- A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- Developing iterative algorithms to solve Sylvester tensor equations
- A modified CG algorithm for solving generalized coupled Sylvester tensor equations
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Iterative least-squares solutions of coupled sylvester matrix equations
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Backward error and perturbation bounds for high order Sylvester tensor equation
- Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- A Kronecker product approximate preconditioner for SANs
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- A Hessenberg-Schur method for the problem AX + XB= C
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Variants of BICGSTAB for Matrices with Complex Spectrum
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- An iterative algorithm to solve the generalized Sylvester tensor equations
- A projection method to solve linear systems in tensor format
This page was built for publication: Tensor product-type methods for solving Sylvester tensor equations