About: QR algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: QR algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

In numerical linear algebra, the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR algorithm was developed in the late 1950s by John G. F. Francis and by Vera N. Kublanovskaya, working independently. The basic idea is to perform a QR decomposition, writing the matrix as a product of an orthogonal matrix and an upper triangular matrix, multiply the factors in the reverse order, and iterate.

Attributes	Values
rdf:type	software
rdfs:label	QR algorithm (en)
rdfs:comment	In numerical linear algebra, the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR algorithm was developed in the late 1950s by John G. F. Francis and by Vera N. Kublanovskaya, working independently. The basic idea is to perform a QR decomposition, writing the matrix as a product of an orthogonal matrix and an upper triangular matrix, multiply the factors in the reverse order, and iterate. (en)
sameAs	QR algorithm
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Clarify dbt:Harv dbt:Harvtxt dbt:Reflist dbt:Numerical_linear_algebra dbt:PlanetMath
Subject	Numerical linear algebra
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/QR_algorithm?oldid=1068781970&ns=0
Wikipage page ID	594072 (xsd:integer)
page length (characters) of wiki page	16205 (xsd:nonNegativeInteger)
Wikipage revision ID	1068781970 (xsd:integer)
has abstract	In numerical linear algebra, the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR algorithm was developed in the late 1950s by John G. F. Francis and by Vera N. Kublanovskaya, working independently. The basic idea is to perform a QR decomposition, writing the matrix as a product of an orthogonal matrix and an upper triangular matrix, multiply the factors in the reverse order, and iterate. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/QR_algorithm
is Wikipage redirect of	Bulge chasing Francis algorithm QR iteration QR method
is Link from a Wikipage to another Wikipage of	Numerical linear algebra Arnoldi iteration Bartels–Stewart algorithm Beresford Parlett Bidiagonal matrix Divide-and-conquer eigenvalue algorithm Householder transformation List of inventions and discoveries by women List of multiple discoveries List of numerical analysis topics Eigendecomposition of a matrix Eigenvalue algorithm Eigenvalues and eigenvectors Hessenberg matrix John G. F. Francis List of algorithms Gauss–Legendre quadrature Bulge chasing Francis algorithm Lanczos algorithm Matrix pencil
is known for of	John G. F. Francis

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software