NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX

doi:10.2172/4412175

Title: NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX

Full Record
Other Related Research

Authors:: Givens, W.

Publication Date:: 1954-03-01

Research Org.:: Oak Ridge National Lab.

OSTI Identifier:: 4412175

Report Number(s):: ORNL-1574

NSA Number:: NSA-08-002936

DOE Contract Number:: W-7405-ENG-26

Resource Type:: Technical Report

Resource Relation:: Other Information: Orig. Receipt Date: 31-DEC-54

Country of Publication:: United States

Language:: English

Subject:: PHYSICS; EIGENVALUES; MATHEMATICS; MATRICES; NUMERICALS

Citation Formats


                    Givens, W. NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX.  United States: N. p., 1954. 
        Web.  doi:10.2172/4412175.

Copy to clipboard


                    Givens, W. NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX.  United States.  doi:10.2172/4412175.

Copy to clipboard


                    Givens, W. Mon .  
        "NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX".  United States.  doi:10.2172/4412175.  https://www.osti.gov/servlets/purl/4412175.

Copy to clipboard


                    
@article{osti_4412175,

  title        = {NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX},

  author       = {Givens, W.},

  abstractNote = {},

  doi          = {10.2172/4412175},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {1954},

  month        = {3}

}

Copy to clipboard

Technical Report:

View Technical Report (7.90 MB)

DOI: 10.2172/4412175

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

LAPACK Working Note No. 2: Block reduction of matrices to condensed forms for eigenvalue computations

Technical Report Dongarra, J.J. ; Hammarling, S.J. ; Sorensen, D.C.

In this paper we describe block algorithms for the reduction of a real symmetric matrix to tridiagonal form and for the reduction of a general real matrix to either bidiagonal or Hessenberg form using Householder transformations. The approach is to aggregate the transformations and to apply them in a blocked fashion, thus achieving algorithms that are rich in matrix-matrix operations. These reductions to condensed form typically comprise a preliminary step in the computation of eigenvalues or singular values. With this in mind, we also demonstrate how the initial reduction to tridiagonal or bidiagonal form may be pipelined with the dividemore »« less
Numerical computation of the matrix exponential with accuracy estimate

Technical Report Ward, R.C.
Eigensystem computation for skew-symmetric matrices and a class of symmetric matrices. [Subroutines TRIZD, IMZD, and TBAKZD in FORTRAN for IBM 360/91 computer]

Technical Report Ward, R.C. ; Gray, L.J.

An algorithm is given for computing the eigenvalues and (optionally) the eigenvectors of either a skew-symmetric matrix or a symmetric tridiagonal matrix with constant diagonal. The algorithm uses only orthogonal similarity transformations, and is believed to be the most efficient algorithm available for computing all the eigenvalues or the complete eigensystem. 2 tables.
DOI: 10.2172/7350249

Full Text Available
Algorithms for sparse, symmetric, definite quadratic lambda-matrix eigenproblems

Conference Scott, D.S. ; Ward, R.C.

Methods are presented for computing eigenpairs of the quadratic lambda-matrix, M lambda/sup 2/ + C lambda + K, where M, C, and K are large and sparse, and have special symmetry-type properties. These properties are sufficient to insure that all the eigenvalues are real and that theory analogous to the standard symmetric eigenproblem exists. The methods employ some standard techniques such as partial tri-diagonalization via the Lanczos Method and subsequent eigenpair calculation, shift-and- invert strategy and subspace iteration. The methods also employ some new techniques such as Rayleigh-Ritz quadratic roots and the inertia of symmetric, definite, quadratic lambda-matrices.
Full Text Available
ERATO4 and computing the smallest eigenvalue of the pencil A-lambdaB

Technical Report Scott, D.S.

Computation of the smallest eigenvalue (and eigenvector) of the generalized eigenvalue problem A-lambdaB is addressed; the matrices A and B are real and symmetric, B is positive definite, and both are quite sparse. Previous methods of computation used the inverse power method; this approach requires large amounts of computer storage. Alternative calculation methods were investigated with varying degrees of success and practicality. The ERATO code uses the inverse power method, but stores arrays in such a way as to minimize storage requirements. Use of this code greatly eased the execution of MHD calculations on the CRAY computer. (RWR)

Similar Records