Pages that link to "Item:Q3466255"
From MaRDI portal
The following pages link to Truncated low‐rank methods for solving general linear matrix equations (Q3466255):
Displaying 16 items.
- Generalized conjugate direction algorithm for solving the general coupled matrix equations over symmetric matrices (Q342859) (← links)
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems (Q2000621) (← links)
- Residual-based iterations for the generalized Lyapunov equation (Q2009108) (← links)
- Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations (Q2022383) (← links)
- Numerical approximation of Poisson problems in long domains (Q2135081) (← links)
- Enhanced alternating energy minimization methods for stochastic Galerkin matrix equations (Q2162725) (← links)
- Greedy low-rank algorithm for spatial connectome regression (Q2184210) (← links)
- On the convergence of Krylov methods with low-rank truncations (Q2234488) (← links)
- Backward error and condition number of a generalized Sylvester equation, with application to the stochastic Galerkin method (Q2310410) (← links)
- Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle (Q2668851) (← links)
- Numerical Methods for Large-Scale Lyapunov Equations with Symmetric Banded Data (Q4553789) (← links)
- Generalized reflexive and anti-reflexive solutions of the coupled Sylvester matrix equations via CD algorithm (Q4639937) (← links)
- Low-Dimensional Approximations of High-Dimensional Asset Price Models (Q4990516) (← links)
- Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations (Q5885818) (← links)
- Numerical solution to generalized Lyapunov/Stein and rational Riccati equations in stochastic control (Q5963405) (← links)
- Numerical solution of singular Sylvester equations (Q6049348) (← links)