A fast algorithm for the computation of an upper bound on the -norm Craig T. Lawrence,y Andre L. Titsy Department of Electrical Engineering and Institute for Systems Research, University of Maryland, College Park,

First Page		Document Content
Date: 2004-11-07 21:58:48 Matrix theory Numerical linear algebra Eigenvalues and eigenvectors Singular value decomposition XTR Eigendecomposition of a matrix Time-evolving block decimation Kalman filter Algebra Linear algebra Mathematics		A fast algorithm for the computation of an upper bound on the -norm Craig T. Lawrence,y Andre L. Titsy Department of Electrical Engineering and Institute for Systems Research, University of Maryland, College Park, Add to Reading List Source URL: www.ece.umd.edu Download Document from Source Website File Size: 281,77 KB Share Document on Facebook

	Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas DocID: 1xUE0 - View Document
	1 Roadmap for the Development of a Linear Algebra Library for Exascale Computing SLATE: Software for Linear Algebra Targeting Exascale DocID: 1xUyc - View Document
	Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIP DocID: 1xUmT - View Document
	3 Designing SLATE SLATE: Software for Linear Algebra Targeting Exascale Jakub Kurzak Panruo Wu DocID: 1xT5s - View Document
	9. Linear Algebra Po-Shen Loh CMU Putnam Seminar, Fall DocID: 1vrLR - View Document