Tuesday, March 31, 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. A Comparison Between Dislocation Theory and Experimental Measurements of Delayed Yield in Steel A dislocation model of a yield nucleus for materials, such as annealed low-carbon steel, which exhib...
  2. Quasinormal Modes Beyond Kerr The quasinormal modes (QNMs) of a black hole spacetime are the free, decaying oscillations of the sp...
  3. Tau -- a lightweight tool for specifying and verifying tiny automata models Tau is a small Tcl/Tk application that can be used to quickly specify and formally verify small auto...
  4. A 3d-3d appetizer We test the 3d-3d correspondence for theories that are labelled by Lens spaces. We find a full agree...
  5. IR fixed points in SU(3) gauge Theories We propose a novel RG method to specify the location of the IR fixed point in lattice gauge theories...

Valoración de los usuarios

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

Busque un recurso