Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices-Reference-Cited by-同舟云学术

Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices

Published:2000-07 Issue:1-3 Volume:313 Page:107-114
ISSN:0024-3795
Container-title:Linear Algebra and its Applications
language:en
Short-container-title:Linear Algebra and its Applications

Author:

Chandrasekaran S.,Gu M.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory

Reference8 articles.

1. Allegro CL User Guide, version 4.3 (Franz Inc., 1995), University Ave., Berkeley, CA 94704, USA, March 1996

2. S. Chandrasekaran, M. Gu, A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semi-separable matrices, Numer. Math., to appear

3. Parameter estimation in the presence of bounded data uncertainties;Chandrasekaran;SIAM J. Matrix Anal. Appl.,1998

4. An efficient algorithm for a bounded errors-in-variables model;Chandrasekaran;SIAM J. Matrix Anal. Appl.,1999

5. Matrix Computations;Golub,1996

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Reduction Algorithms for Banded Symmetric Generalized Eigenproblems via Sequentially Semiseparable (SSS) Matrices;Mathematics;2022-05-13

2. When is a matrix unitary or Hermitian plus low rank?;Numerical Linear Algebra with Applications;2019-09-02

3. Nested Product Decomposition of Quasiseparable Matrices;SIAM Journal on Matrix Analysis and Applications;2013-01

4. An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices;SIAM Journal on Scientific Computing;2010-01

5. Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations;Numerical Algorithms;2008-02-27