Wednesday, January 28, 2015

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


A Computational Array for the QR-Method

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


  Descargar recurso   Descargar recurso

Detalles del recurso

Pertenece a: Caltech Authors  

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.

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. 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...
  2. 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...
  3. Pipelined linear equation solvers and VLSI Many of the commonly used methods for solution of linear systems of equations on sequential machines...
  4. A Formal Derivation of Array Implementations of FFT Algorithms Fast Fourier Transform, FFT, algorithms are interesting for direct hardware implementation in VLSI. ...
  5. VLSI Architecture and Design Integrated circuit technology is rapidly approaching a state where feature sizes of one micron or le...

Otros recursos de la misma colección

  1. Anatomy of the AGN in NGC 5548: III. The high-energy view with NuSTAR and INTEGRAL We describe the analysis of the seven broad-band X-ray continuum observations of the archetypal Seyf...
  2. NuSTAR Reveals Relativistic Reflection But No Ultra-Fast Outflow In The Quasar PG 1211+143 We report on four epochs of observations of the quasar PG 1211+143 using NuSTAR. The net exposure ti...
  3. Recovering Jointly Sparse Signals via Joint Basis Pursuit This work considers recovery of signals that are sparse over two bases. For instance, a signal might...
  4. On the Ingleton-Violating Finite Groups and Group Network Codes It is well known that there is a one-to-one correspondence between the entropy vector of a collectio...
  5. Simultaneously Structured Models with Application to Sparse and Low-rank Matrices The topic of recovery of a structured model given a small number of linear observations has been wel...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso