Entry Parlett:2000:TR from jcomputapplmath2000.bib

Last update: Tue Mar 5 02:05:16 MST 2019                Valid HTML 4.0!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Parlett:2000:TR,
  author =       "Beresford N. Parlett",
  title =        "For tridiagonals {$T$} replace {$T$} with {$ L D L^t
                 $}",
  journal =      j-J-COMPUT-APPL-MATH,
  volume =       "123",
  number =       "1--2",
  pages =        "117--130",
  day =          "1",
  month =        nov,
  year =         "2000",
  CODEN =        "JCAMDI",
  DOI =          "https://doi.org/10.1016/S0377-0427(00)00394-0",
  ISSN =         "0377-0427 (print), 1879-1778 (electronic)",
  ISSN-L =       "0377-0427",
  MRclass =      "65F10 (65F35)",
  MRnumber =     "MR1798522 (2001j:65055)",
  bibdate =      "Sat Feb 25 12:43:37 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib;
                 http://www.math.utah.edu/pub/tex/bib/jcomputapplmath2000.bib",
  note =         "Numerical analysis 2000, Vol. III. Linear algebra",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0377042700003940",
  ZMnumber =     "0970.65032",
  abstract =     "The author discusses two of the ideas needed to
                 compute eigenvectors that are orthogonal without making
                 use of the Gram--Schmidt procedure when some of the
                 eigenvalues are tightly clustered. In the first of the
                 new schemes, the radical new goal is to compute an
                 approximate eigenvector for a given approximate
                 eigenvalue with a relative residual property. In the
                 second scheme, due to the relative gaps in the spectrum
                 the origin is shifted and the triangular factorization
                 is used. In the development, the recently discovered
                 differential stationary QD algorithms are used.
                 Examples of both ideas, using four by four systems, are
                 given",
  acknowledgement = ack-nhfb,
  classmath =    "*65F15 Eigenvalues (numerical linear algebra) 65F05
                 Direct methods for linear systems",
  fjournal =     "Journal of Computational and Applied Mathematics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03770427",
  keywords =     "clustered eigenvalues; eigenvalue; LDU factorization;
                 numerical examples; orthogonal eigenvectores; QD
                 algorithm; triangular factorization",
  reviewer =     "R. P. Tewarson (Stony Brook)",
}

Related entries