Solving coupled tensor equations via higher order LSQR methods
From MaRDI portal
Publication:5081341
DOI10.2298/FIL2013419HzbMATH Open1499.15050OpenAlexW4237510817MaRDI QIDQ5081341FDOQ5081341
Authors: Masoud Hajarian 
Publication date: 14 June 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil2013419h
Multilinear algebra, tensor calculus (15A69) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10) Matrix equations and identities (15A24)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Algorithms for Numerical Analysis in High Dimensions
- \(M\)-tensors and nonsingular \(M\)-tensors
- Tensor spaces and numerical tensor calculus
- Title not available (Why is that?)
- D-eigenvalues of diffusion kurtosis tensors
- Positive-definite tensors to nonlinear complementarity problems
- A literature survey of low-rank tensor approximation techniques
- Alternating minimal energy methods for linear systems in higher dimensions
- Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations
- The generalized QMRCGSTAB algorithm for solving Sylvester-transpose matrix equations
- Iterative Krylov Methods for Large Linear Systems
- Krylov solvers for linear algebraic systems.
- Title not available (Why is that?)
- Bidiagonalization of Matrices and Solution of Linear Equations
- Moore–Penrose inverse of tensors via Einstein product
- Solving multilinear systems via tensor inversion
- Tensor analysis. Spectral theory and special tensors
- Weighted Moore-Penrose inverses and fundamental theorem of even-order tensors with Einstein product
- On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Sensitivity analysis of the Lyapunov tensor equation
- Theory and Computation of Complex Tensors and its Applications
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- Model reduction and approximation. Theory and algorithms
- Iterative algorithms for solving some tensor equations
- SVD-based algorithms for the best rank-1 approximation of a symmetric tensor
- Tensor logarithmic norm and its applications.
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
- Convergence of a transition probability tensor of a higher-order Markov chain to the stationary probability vector.
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Backward error and perturbation bounds for high order Sylvester tensor equation
- Modified gradient dynamic approach to the tensor complementarity problem
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Neural network approach for solving nonsingular multi-linear tensor systems
- Solving tensor E-eigenvalue problem faster
Cited In (1)
Uses Software
This page was built for publication: Solving coupled tensor equations via higher order LSQR methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081341)
