On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations

DOI10.1016/J.CAM.2019.03.045MaRDI QIDQ1989166zbMATH OpenOpenAlexWikidataFDO

Authors Mehdi Najafi-Kalyani, F. Panjeh Ali Beik, Khalide Jbilou

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

zbMATH Keywords

Tikhonov regularizationKronecker productill-posed problemperturbation analysisHessenberg processSylvester tensor equation

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Ill-posedness and regularization problems in numerical linear algebra (65F22) Theory of matrix inversion and generalized inverses (15A09) Matrix equations and identities (15A24) Numerical methods for matrix equations (65F45)

Recommendations

• Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
• Global and extended global Hessenberg processes for solving Sylvester tensor equation with low-rank right-hand side
• On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
• Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side
• Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications

Cites work

• scientific article; zbMATH DE number 3876486 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Hessenberg-Schur method for the problem AX + XB= C
• A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
• A mixed collocation-finite difference method for 3D microscopic heat transport problems
• A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
• A projection method to solve linear systems in tensor format
• Backward error and perturbation bounds for high order Sylvester tensor equation
• CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
• Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• Low-rank tensor Krylov subspace methods for parametrized linear systems
• Matrix Analysis
• On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
• On the preconditioning of matrices with skew-symmetric splittings
• Regularization methods for large-scale problems
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
• Sensitivity analysis of the Lyapunov tensor equation
• Structured matrix problems from tensors
• Tensor Decompositions and Applications
• The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
• The block Hessenberg process for matrix equations
• The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
• Viscoelastic flow in an undulating tube using spectral methods
• Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides

Cited in

(24)

• scientific article; zbMATH DE number 7528973 (Why is no real title available?)
• Preconditioned iterative methods for multi-linear systems based on the majorization matrix
• Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
• Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
• Tensor product-type methods for solving Sylvester tensor equations
• A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
• scientific article; zbMATH DE number 7404606 (Why is no real title available?)
• scientific article; zbMATH DE number 7640094 (Why is no real title available?)
• Deflated and restarted Krylov subspace methods for Sylvester tensor equations
• A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems
• On tensor tubal-Krylov subspace methods
• Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
• The new Krylov subspace methods for solving tensor equations via \(T\)-product
• Alternative Arnoldi process for ill-conditioned tensor equations with application to image restoration
• Discrete cosine transform LSQR methods for multidimensional ill-posed problems
• Tensor extrapolation methods with applications
• On HSS-Based Iteration Methods for Two Classes of Tensor Equations
• Global and extended global Hessenberg processes for solving Sylvester tensor equation with low-rank right-hand side
• Finding iterative algorithms for solving generalized coupled Sylvester tensor equations
• Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
• Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES
• Developing iterative algorithms to solve Sylvester tensor equations
• Solving coupled tensor equations via higher order LSQR methods
• Iterative solutions of generalized Sylvester quaternion tensor equations

Describes a project that uses

Uses Software

• TensorToolbox
• CMRH
• Regularization tools

This page was built for publication: On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989166)