On theoretical and numerical aspects of symplectic Gram–Schmidt-like algorithms

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.39, Iss.4, 2005-08, pp. : 437-462

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms

By Salam A. Al-Aidarous E.

Bit Numerical Mathematics, Vol. 54, Iss. 1, 2014-03 ,pp. : 283-302

Springer Publishing Company

Access to resources Recommend Favorite

Block Algorithms for Orthogonal Symplectic Factorizations

By Kressner D.

Bit Numerical Mathematics, Vol. 43, Iss. 4, 2003-12 ,pp. : 775-790

Springer Publishing Company

Access to resources Recommend Favorite

Theoretical and numerical aspects in the multiphasic modelling of human brain tissue

PROCEEDINGS IN APPLIED MATHEMATICS & MECHANICS (ELECTRONIC), Vol. 15, Iss. 1, 2015-10 ,pp. : 117-118

John Wiley & Sons Inc

Access to resources Recommend Favorite

A generalization of Gram–Schmidt orthogonalization generating all Parseval frames

By Casazza Peter Kutyniok Gitta

Advances in Computational Mathematics, Vol. 27, Iss. 1, 2007-07 ,pp. : 65-78

Springer Publishing Company

Access to resources Recommend Favorite

Preconditioners for the conjugate gradient algorithm using Gram-Schmidt and least squares methods

International Journal of Computer Mathematics, Vol. 84, Iss. 1, 2007-01 ,pp. : 89-108

Taylor & Francis Ltd

Access to resources Recommend Favorite