Deflated and restarted Krylov subspace methods for Sylvester tensor equations
From MaRDI portal
Publication:6166090
Recommendations
- Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Extended Krylov subspace methods for solving Sylvester and Stein tensor equations
- Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods
- A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
Cites work
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Power–Arnoldi algorithm for computing PageRank
- A Restarted GMRES Method Augmented with Eigenvectors
- A flexible and adaptive simpler GMRES with deflated restarting for shifted linear systems
- A framework for deflated and augmented Krylov subspace methods
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- 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
- A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- An implicit filter for rational Krylov using core transformations
- Analysis of Augmented Krylov Subspace Methods
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Computing interior eigenvalues of large matrices
- Coupled segmentation and denoising/deblurring models for hyperspectral material identification.
- Deflated and Augmented Krylov Subspace Techniques
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Fast global spectral methods for three-dimensional partial differential equations
- GMRES with Deflated Restarting
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
- Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- Numerical subspace algorithms for solving the tensor equations involving Einstein product
- On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Restarted block-GMRES with deflation of eigenvalues
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- Solution methods for linear discrete ill-posed problems for color image restoration
- Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES
- Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods
- Tensor Decompositions and Applications
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
Cited in
(9)- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Transpose-free quasi-minimal residual method based on tensor format for generalized coupled Sylvester tensor equations
- On tensor tubal-Krylov subspace methods
- Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods
- Krylov-type methods for tensor computations.I
- Extended Krylov subspace methods for solving Sylvester and Stein tensor equations
- Tensor Deflation for CANDECOMP/PARAFAC— Part II: Initialization and Error Analysis
- Krylov subspace methods based quaternion tensor form for generalized Sylvester quaternion tensor equation with application to color video restoration
- On applying deflation and flexible preconditioning to the adaptive simpler GMRES method for Sylvester tensor equations
This page was built for publication: Deflated and restarted Krylov subspace methods for Sylvester tensor equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166090)
