On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms
DOI10.1007/S11075-005-0963-2zbMATH Open1111.65038OpenAlexW1988819385MaRDI QIDQ2501237FDOQ2501237
Authors: Ahmed Salam 
Publication date: 4 September 2006
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-005-0963-2
Recommendations
- scientific article; zbMATH DE number 714441
- Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
- Symplectic and orthogonal Robinson-Schensted algorithms
- A new class of \(G ( \epsilon )\)-symplectic general linear methods
- scientific article; zbMATH DE number 4030836
- On an algorithm for solving the symplectic matrix Riccati equation
- scientific article; zbMATH DE number 4154894
- Symplectic methods for the symplectic eigenproblem
- A survey on symplectic and multi-symplectic algorithms
- \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
numerical experimentskew-symmetric scalar productsymplectic Gram-Schmidt algorithmlarge sparse Hamiltonian eigenvalue problems
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational aspects of linear control
- Canonical forms for symplectic and Hamiltonian matrices
- Matrix factorizations for symplectic QR-like methods
- \(\mathbb G\)-reflectors: Analogues of Householder transformations in scalar product spaces
- Software for simplified Lanczos and QMR algorithms
- Title not available (Why is that?)
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- Title not available (Why is that?)
- Numerical linear algorithms and group theory
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Numerics of Gram-Schmidt orthogonalization
- Model reduction of state space systems via an implicitly restarted Lanczos method
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- Cholesky-like factorizations of skew-symmetric matrices
- Structure-preserving methods for computing eigenpairs of large sparse skew-Hamiltonian/Hamiltonian pencils
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- A Hamiltonian $QR$ Algorithm
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- A Schur decomposition for Hamiltonian matrices
- On Hamiltonian and symplectic Hessenberg forms
- A multishift algorithm for the numerical solution of algebraic Riccati equations
- Schur-like forms for matrix Lie groups, Lie algebras and Jordan algebras
Cited In (18)
- Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
- Structure-preserving reduced basis methods for Poisson systems
- Rank-adaptive structure-preserving model order reduction of Hamiltonian systems
- Gaussian distributions on Riemannian symmetric spaces in the large \(N\) limit
- The transfer function of generic linear quantum stochastic systems has a pure cascade realization
- Reduced basis methods for time-dependent problems
- On the strong stability of symplectic matrices
- On the conditioning of factors in the SR decomposition
- A spectral trichotomy method for symplectic matrices
- Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- Structure-preserving model order reduction of Hamiltonian systems
- Title not available (Why is that?)
- Extending the length and time scales of Gram-Schmidt Lyapunov vector computations
- Title not available (Why is that?)
- Perturbation analysis for the symplectic QR factorization
- Refined rigorous perturbation bounds for the SR decomposition
- An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations
Uses Software
This page was built for publication: On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501237)
