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

ISSN： 1017-1398

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

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

Direct and Inverse Eigenvalue Problems for Diagonal-Plus-Semiseparable Matrices

By Fasino Dario Gemignani Luca

Numerical Algorithms, Vol. 34, Iss. 2-4, 2003-12 ,pp. : 313-324

Springer Publishing Company

Access to resources Recommend Favorite

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

By Gansterer W. Schneid J. Ueberhuber C.

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

Springer Publishing Company

Access to resources Recommend Favorite

Computing Eigenelements of Real Symmetric Matrices via Optimization

By Mongeau M. Torki M.

Computational Optimization and Applications, Vol. 29, Iss. 3, 2004-12 ,pp. : 263-287

Springer Publishing Company

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

High‐performance direct algorithms for computing the sign function of triangular matrices

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 25, Iss. 2, 2018-03 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite