Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
DOI10.1007/s11075-020-00911-yzbMath1483.65069OpenAlexW3014784102MaRDI QIDQ780416
Mehdi Najafi-Kalyani, Fatemeh Panjeh Ali Beik, Lothar Reichel, Khalide Jbilou
Publication date: 15 July 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-00911-y
Tikhonov regularizationill-posed problemGolub-Kahan bidiagonalizationlinear tensor operator equation
Ill-posedness and regularization problems in numerical linear algebra (65F22) Matrix equations and identities (15A24) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Numerical methods for matrix equations (65F45)
Related Items (14)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning
- Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning
- Viscoelastic flow in an undulating tube using spectral methods
- A mixed collocation-finite difference method for 3D microscopic heat transport problems
- A new zero-finder for Tikhonov regularization
- Tikhonov regularization of large linear problems
- On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
- Generalized singular value decomposition with iterated Tikhonov regularization
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- A simplified L-curve method as error estimator
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- On the choice of subspace for large-scale Tikhonov regularization problems in general form
- A generalized global Arnoldi method for ill-posed matrix equations
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Matrix Analysis
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Algorithms for the regularization of ill-conditioned least squares problems
- Sensitivity analysis of the Lyapunov tensor equation
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- A projection method to solve linear systems in tensor format
- An iterative method for solving the continuous sylvester equation by emphasizing on the skew-hermitian parts of the coefficient matrices
- A global Lanczos method for image restoration
This page was built for publication: Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications