1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Opción 2: Descargar recurso

Detalles del recurso

Descripción

The QR-method is a method for the solution of linear system of equations. The matrix R is upper triangular and Q is a unitary matrix. In equation solving Q is not always computed explicitly. The matrix R can be obtained by applying a sequence of unitary transformations to the matrix defining the system of equations. Householder's method or Given's method can be used to determine unitary transformation matrices. This paper describes a concurrent algorithm and corresponding array for computing the triangular matrix R by Householder transformations. Particular attention is given to issues such as broadcasting and pipelining.

Pertenece a

Caltech Authors  

Autor(es)

Johnsson, Lennart - 

Id.: 55237010

Versión: 1.0

Estado: Final

Tipo:  application/pdf -  image/png - 

Tipo de recurso: Report or Paper  -  PeerReviewed  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Formatos:  application/pdf -  image/png - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] http://resolver.caltech.edu/CaltechAUTHORS:20120423-165211870
[References] http://authors.library.caltech.edu/30263/

Fecha de contribución: 27-dic-2012

Contacto:

Localización:
* Johnsson, Lennart (1982) A Computational Array for the QR-Method. California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechAUTHORS:20120423-165211870

Otros recursos del mismo autor(es)

  1. Social Integration as Professional Field: Psychotherapy in Sweden

    The present article describes and analyses the emergence and development of a professional field ...

  2. VLSI algorithms for Doolittle's, Crout's, and Cholesky's methods In order to take full advantage of the emerging VLSI technology it is required to recognize its limi...
  3. A mathematical approach to modelling the flow of data and control in computational networks This paper proposes a mathematical formalism for the synthesis and qualitative analysis of computati...
  4. Pipelined linear equation solvers and VLSI Many of the commonly used methods for solution of linear systems of equations on sequential machines...
  5. A Formal Derivation of Array Implementations of FFT Algorithms Fast Fourier Transform, FFT, algorithms are interesting for direct hardware implementation in VLSI. ...

Otros recursos de la mismacolección

  1. On ground states for the L^2-critical boson star equation We consider ground state solutions u ⩾ 0 for the L^2-critical boson star equation √−u − (|x|^(−1) ∗ ...
  2. The NuSTAR View of the Seyfert 2 Galaxy NGC 4388 We present analysis of NuSTAR X-ray observations in the 3-79 keV energy band of the Seyfert 2 galaxy...
  3. Uniqueness of ground states for the L^2-critical boson star equation We establish uniqueness of ground states u(x)≥0 for the L^2-critical boson star equation √−Δu−(|x|^(...
  4. Remarks on eigenvalue estimates and semigroup domination We present an overview over recent results concerning semi-classical spectral estimates for magnetic...
  5. The Complete Calibration of the Color-Redshift Relation (C3R2) Survey: Survey Overview and Data Release 1 A key goal of the Stage IV dark energy experiments Euclid, LSST and WFIRST is to measure the growth ...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.