scientific article; zbMATH DE number 7593992
From MaRDI portal
Publication:5869497
Peter Benner, Michel-Niklas Senn, Heike Fassbender
Publication date: 28 September 2022
Full work available at URL: https://arxiv.org/abs/2202.12640
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Orthogonalization in numerical linear algebra (65F25) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Unnamed Item
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
- Convergence analysis of the extended Krylov subspace method for the Lyapunov equation
- The matrix sign decomposition and its relation to the polar decomposition
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- Error analysis of the symplectic Lanczos method for the symplectic eigenvalue problem
- Krylov integrators for Hamiltonian systems
- On Hamiltonian and symplectic Lanczos processes
- Symplectic exponential Runge-Kutta methods for solving nonlinear Hamiltonian systems
- QCD and numerical analysis III. Proceedings of the third international workshop on numerical analysis and lattice QCD, Edinburgh, UK, June 30 -- July 4, 2003.
- Matrix Algorithms
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- A Symplectic Lanczos-Type Algorithm to Compute the Eigenvalues of Positive Definite Hamiltonian Matrices
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Structured tools for structured matrices
- Functions of Matrices
- Geometric Numerical Integration
- Structured Factorizations in Scalar Product Spaces
This page was built for publication:
