A preconditioned low-rank CG method for parameter-dependent Lyapunov matrix equations
DOI10.1002/nla.1919zbMath1340.65077OpenAlexW1895683009MaRDI QIDQ2948076
Martin Plešinger, Christine Tobler, Daniel Kressner
Publication date: 29 September 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1919
numerical examplespreconditioningmodel reductionLyapunov matrix equationKrylov subspace methodconjugate gradientADI preconditionersign function preconditionertensors in Tucker format
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU-GPU platforms
- On the parameter selection problem in the Newton-ADI iteration for large-scale Riccati equations
- Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic
- On the ADI method for Sylvester equations
- Solving stable generalized Lyapunov equations with the matrix sign function
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- Global FOM and GMRES algorithms for matrix equations
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- A new scheme for the tensor representation
- A Structure Preserving FGMRES Method for Solving Large Lyapunov Equations
- A preconditioned low-rank CG method for parameter-dependent Lyapunov matrix equations
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- Hierarchical Singular Value Decomposition of Tensors
- A Kronecker Product Preconditioner for Stochastic Galerkin Finite Element Discretizations
- Fast algorithms for hierarchically semiseparable matrices
- Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
- Interpolatory Projection Methods for Parameterized Model Reduction
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations
- Hierarchische Matrizen
- Optimum Alternating-Direction-Implicit Iteration Parameters for a Model Problem
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations
- A Multilinear Singular Value Decomposition
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Low-Rank Solution of Lyapunov Equations
- A projection method to solve linear systems in tensor format
- Parameter preserving model order reduction for MEMS applications
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Extended Application of Alternating Direction Implicit Iteration Model Problem Theory
- Approximation of 1/x by exponential sums in [1, ∞)
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
This page was built for publication: A preconditioned low-rank CG method for parameter-dependent Lyapunov matrix equations