On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
DOI10.1016/j.cam.2019.03.045zbMath1437.65026OpenAlexW2936044690WikidataQ128088018 ScholiaQ128088018MaRDI QIDQ1989166
Fatemeh Panjeh Ali Beik, Khalide Jbilou, Mehdi Najafi-Kalyani
Publication date: 24 April 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2019.03.045
Tikhonov regularizationperturbation analysisill-posed problemKronecker productHessenberg processSylvester tensor equation
Ill-posedness and regularization problems in numerical linear algebra (65F22) Theory of matrix inversion and generalized inverses (15A09) Matrix equations and identities (15A24) Multilinear algebra, tensor calculus (15A69) Numerical methods for matrix equations (65F45)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Viscoelastic flow in an undulating tube using spectral methods
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- A mixed collocation-finite difference method for 3D microscopic heat transport problems
- Regularization methods for large-scale problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- The block Hessenberg process for matrix equations
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides
- A projection method and Kronecker product preconditioner for solving Sylvester tensor 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
- Structured Matrix Problems from Tensors
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Matrix Analysis
- A Hessenberg-Schur method for the problem AX + XB= C
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Sensitivity analysis of the Lyapunov tensor equation
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- A projection method to solve linear systems in tensor format
- On the preconditioning of matrices with skew-symmetric splittings
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
This page was built for publication: On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations