A Low-Complexity Divide-and-Conquer Method for Computing Eigenvalues and Eigenvectors of Symmetric Band Matrices

Author： Gansterer W. Schneid J. Ueberhuber C.

ISSN： 0006-3835

Source： Bit Numerical Mathematics, Vol.41, Iss.5, 2001-12, pp. : 967-976

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

Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices

By Mastronardi N. Camp E. Barel M.

Numerical Algorithms, Vol. 39, Iss. 4, 2005-08 ,pp. : 379-398

Springer Publishing Company

Access to resources Recommend Favorite

Eigenvalues of Real Symmetric Matrices

By Geck Meinolf

American Mathematical Monthly, Vol. 122, Iss. 5, 2015-05 ,pp. : 482-483

Mathematical Association of America

Access to resources Recommend Favorite

A Cache‐Aware Implementation of the Spectral Divide‐and‐Conquer Approach for the Non‐Symmetric Generalized Eigenvalue Problem

PROCEEDINGS IN APPLIED MATHEMATICS & MECHANICS (ELECTRONIC), Vol. 14, Iss. 1, 2014-12 ,pp. : 819-820

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Divide-and-Conquer Implementation of the Discrete Variational DFT Method for Large Molecular and Solid Systems

By Warschkow O. Dyke J.M. Ellis D.E.

Journal of Computational Physics, Vol. 143, Iss. 1, 1998-06 ,pp. : 70-89

Academic Press

Access to resources Recommend Favorite

Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence

By Wang B.F.

Journal of Algorithms, Vol. 23, Iss. 2, 1997-05 ,pp. : 329-344

Academic Press

Access to resources Recommend Favorite