A Hamiltonian $QR$ Algorithm

1986 ◽  
Vol 7 (1) ◽  
pp. 212-229 ◽  
Author(s):  
Ralph Byers
Keyword(s):  
Qr Algorithm

scholarly journals Total positivity and the QR algorithm

1998 ◽  
Vol 271 (1-3) ◽  
pp. 257-272 ◽  
Author(s):  
G.M.L. Gladwell
Keyword(s):  
Total Positivity ◽  
Qr Algorithm

A lattice algorithm dual to the extended inverse QR algorithm

1995 ◽  
Vol 47 (2) ◽  
pp. 115-133 ◽  
Author(s):  
PooGyeon Park ◽  
Thomas Kailath
Keyword(s):  
Qr Algorithm ◽  
Lattice Algorithm

scholarly journals A COMPLEX MIX-SHIFTED PARALLEL QR ALGORITHM FOR THE C-METHOD

2016 ◽  
Vol 68 ◽  
pp. 159-171
Author(s):  
Cihui Pan ◽  
Richard Dusseaux ◽  
Nahid Emad
Keyword(s):  
Qr Algorithm

scholarly journals Algorithm 1019: A Task-based Multi-shift QR/QZ Algorithm with Aggressive Early Deflation

2022 ◽  
Vol 48 (1) ◽  
pp. 1-36
Author(s):  
Mirko Myllykoski
Keyword(s):  
Eigenvalue Problems ◽  
Critical Path ◽  
Hessenberg Matrix ◽  
Single Node ◽  
Standard Case ◽  
Qr Algorithm ◽  
Schur Form ◽  
Tightly Coupled ◽  
Qz Algorithm ◽  
New Ideas

The QR algorithm is one of the three phases in the process of computing the eigenvalues and the eigenvectors of a dense nonsymmetric matrix. This paper describes a task-based QR algorithm for reducing an upper Hessenberg matrix to real Schur form. The task-based algorithm also supports generalized eigenvalue problems (QZ algorithm) but this paper concentrates on the standard case. The task-based algorithm adopts previous algorithmic improvements, such as tightly-coupled multi-shifts and Aggressive Early Deflation (AED) , and also incorporates several new ideas that significantly improve the performance. This includes, but is not limited to, the elimination of several synchronization points, the dynamic merging of previously separate computational steps, the shortening and the prioritization of the critical path, and experimental GPU support. The task-based implementation is demonstrated to be multiple times faster than multi-threaded LAPACK and ScaLAPACK in both single-node and multi-node configurations on two different machines based on Intel and AMD CPUs. The implementation is built on top of the StarPU runtime system and is part of the open-source StarNEig library.

The mechanics of locating earthquakes

1976 ◽  
Vol 66 (1) ◽  
pp. 173-187
Author(s):  
Ray Buland
Keyword(s):  
Degrees Of Freedom ◽  
A Priori Estimates ◽  
A Priori ◽  
Joint Probability ◽  
Step Length ◽  
Earth Model ◽  
Random Errors ◽  
Qr Algorithm ◽  
Location Parameters ◽  
Chi Squared

abstract A complete reexamination of Geiger's method in the light of modern numerical analysis indicates that numerical stability can be insured by use of the QR algorithm and the convergence domain considerably enlarged by the introduction of step-length damping. In order to make the maximum use of all data, the method is developed assuming a priori estimates of the statistics of the random errors at each station. Numerical experiments indicate that the bulk of the joint probability density of the location parameters is in the linear region allowing simple estimates of the standard errors of the parameters. The location parameters are found to be distributed as one minus chi squared with m degrees of freedom, where m is the number of parameters, allowing the simple construction of confidence levels. The use of the chi-squared test with n-m degrees of freedom, where n is the number of data, is introduced as a means of qualitatively evaluating the correctness of the earth model.

The QR Algorithm for Band Symmetric Matrices

1971 ◽  
pp. 266-272
Author(s):  
R. S. Martin ◽  
C. Reinsch ◽  
J. H. Wilkinson
Keyword(s):  
Symmetric Matrices ◽  
Qr Algorithm
Sign in / Sign up

Export Citation Format

Share Document