Developing iterative algorithms to solve Sylvester tensor equations (Q2244172)

scientific article

Language	Label	Description	Also known as
English	Developing iterative algorithms to solve Sylvester tensor equations	scientific article

Statements

instance of

scholarly article

0 references

title

Developing iterative algorithms to solve Sylvester tensor equations (English)

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

11 November 2021

0 references

zbMATH Keywords

Sylvester tensor equation

0 references

bi-conjugate gradient

0 references

bi-conjugate residual

0 references

tensor forms

0 references

nearest Kronecker product

0 references

describes a project that uses

GpBiCg

0 references

MCS

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2021.126403

0 references

cites work

Tensor Analysis

0 references

Eigenvalues of a real supersymmetric tensor

0 references

Tensor eigenvalues and their applications

0 references

SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor

0 references

Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation

0 references

Numerical Computation for Orthogonal Low-Rank Approximation of Tensors

0 references

FINITE ITERATIVE ALGORITHM FOR THE COMPLEX GENERALIZED SYLVESTER TENSOR EQUATIONS

0 references

Convergence of a transition probability tensor of a higher-order Markov chain to the stationary probability vector

0 references

Solving tensor E-eigenvalue problem faster

0 references

Interval tensors and their application in solving multi-linear systems of equations

0 references

Tensor Decompositions and Applications

0 references

Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems

0 references

Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method

0 references

Solving sparse non-negative tensor equations: algorithms and applications

0 references

Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure

0 references

A mixed collocation-finite difference method for 3D microscopic heat transport problems

0 references

The optimal projection equations for reduced-order state estimation

0 references

Robust Partial Pole Assignment for Vibrating Systems With Aerodynamic Effects

0 references

Numerically Reliable Computing for the Row by Row Decoupling Problem with Stability

0 references

Disturbance Decoupling for Descriptor Systems by State Feedback

0 references

A projection method and Kronecker product preconditioner for solving Sylvester tensor equations

0 references

A gradient based iterative solutions for Sylvester tensor equations

0 references

Q5249217

0 references

On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations

0 references

Convergence properties of BCR method for generalized Sylvester matrix equation over generalized reflexive and anti-reflexive matrices

0 references

Reflexive periodic solutions of general periodic matrix equations

0 references

Conjugate gradient-like methods for solving general tensor equation with Einstein product

0 references

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

0 references

A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations

0 references

A modified CG algorithm for solving generalized coupled Sylvester tensor equations

0 references

An iterative algorithm to solve the generalized Sylvester tensor equations

0 references

Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations

0 references

Extending BiCG and BiCR methods to solve the Stein tensor equation

0 references

Numerical algorithms for solving discrete Lyapunov tensor equation

0 references

A numerical study of various algorithms related to the preconditioned conjugate gradient method

0 references

An analysis of the composite step biconjugate gradient method

0 references

A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems

0 references

GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems

0 references

Q2768030

0 references

Recycling BiCG with an Application to Model Reduction

0 references

An extension of the conjugate residual method to nonsymmetric linear systems

0 references

BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices

0 references

A projection method to solve linear systems in tensor format

0 references

BiCR-type methods for families of shifted linear systems

0 references

Symmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithm

0 references

Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm

0 references

Q4327444

0 references

A Kronecker product approximate preconditioner for SANs

0 references

Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks

0 references

Global optimization by multilevel coordinate search

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.AMC.2021.126403

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2244172