Developing iterative algorithms to solve Sylvester tensor equations
From MaRDI portal
Publication:2244172
DOI10.1016/j.amc.2021.126403OpenAlexW3171159219MaRDI QIDQ2244172
Publication date: 11 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126403
bi-conjugate gradientSylvester tensor equationbi-conjugate residualnearest Kronecker producttensor forms
Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69) Preconditioners for iterative methods (65F08)
Related Items
On RGI algorithms for solving Sylvester tensor equations ⋮ Tensor product-type methods for solving Sylvester tensor equations ⋮ Finite-time zeroing neural networks with novel activation function and variable parameter for solving time-varying Lyapunov tensor equation ⋮ The least squares solution with the minimal norm to a system of mixed generalized Sylvester reduced biquaternion tensor equations ⋮ Tensor form of GPBiCG algorithm for solving the generalized Sylvester quaternion tensor equations ⋮ Efficient iterative method for generalized Sylvester quaternion tensor equation ⋮ Unnamed Item ⋮ A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems ⋮ Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side ⋮ The Drazin inverse of anti-triangular block matrices ⋮ The Relation Between a Tensor and Its Associated Semi-Symmetric Form ⋮ Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Symmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithm
- A gradient based iterative solutions for Sylvester tensor equations
- 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
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices
- An extension of the conjugate residual method to nonsymmetric linear systems
- Global optimization by multilevel coordinate search
- An analysis of the composite step biconjugate gradient method
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- Tensor eigenvalues and their applications
- 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
- Interval tensors and their application in solving multi-linear systems of equations
- 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
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- 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
- Numerical algorithms for solving discrete Lyapunov tensor equation
- Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm
- Solving tensor E-eigenvalue problem faster
- Solving sparse non-negative tensor equations: algorithms and applications
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- BiCR-type methods for families of shifted linear systems
- Eigenvalues of a real supersymmetric tensor
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks
- Convergence of a transition probability tensor of a higher-order Markov chain to the stationary probability vector
- Recycling BiCG with an Application to Model Reduction
- SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor
- The optimal projection equations for reduced-order state estimation
- A Kronecker product approximate preconditioner for SANs
- A numerical study of various algorithms related to the preconditioned conjugate gradient method
- 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
- Disturbance Decoupling for Descriptor Systems by State Feedback
- Numerically Reliable Computing for the Row by Row Decoupling Problem with Stability
- An iterative algorithm to solve the generalized Sylvester tensor equations
- Reflexive periodic solutions of general periodic matrix equations
- Numerical Computation for Orthogonal Low-Rank Approximation of Tensors
- Robust Partial Pole Assignment for Vibrating Systems With Aerodynamic Effects
- Tensor Analysis
- Convergence properties of BCR method for generalized Sylvester matrix equation over generalized reflexive and anti-reflexive matrices
- A projection method to solve linear systems in tensor format
- FINITE ITERATIVE ALGORITHM FOR THE COMPLEX GENERALIZED SYLVESTER TENSOR EQUATIONS
