On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms (Q2501237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms |
scientific article; zbMATH DE number 5051389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms |
scientific article; zbMATH DE number 5051389 |
Statements
On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms (English)
0 references
4 September 2006
0 references
Symplectic Gram-Schmidt-like algorithms play an important role in the numerical solution of large sparse Hamiltonian matrix eigenvalue problems. This paper examines, both theoretically and by numerical experiment, the extent to which the numerical properties of these algorithms can be improved by modifications in implementation. The results are compared with the work of \textit{A. Björck} [BIT 7, 1--21 (1967; Zbl 0183.17802)] on the classical Gram-Schmidt algorithm.
0 references
skew-symmetric scalar product
0 references
symplectic Gram-Schmidt algorithm
0 references
large sparse Hamiltonian eigenvalue problems
0 references
numerical experiment
0 references
0 references
0 references
0 references
0.8844176
0 references
0.8805847
0 references
0 references
0.8748697
0 references
0.87297297
0 references
0 references
