Back to Results
First PageMeta Content
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

Document Date: 2004-11-07 21:58:48

Open Document

File Size: 281,77 KB

Share Result on Facebook

Country

Belgium / /

Currency

Rs / /

Facility

University of Maryland / College Park / /

Holiday

Assumption / /

IndustryTerm

cient algorithms / cient algorithm / bisection search / similar algorithm / /

Organization

University of Maryland / College Park / World Congress / L. Titsy Department of Electrical Engineering / National Science Foundation / Institute for Systems Research / /

Person

Paul Van Doorenz Universit / Craig T. Lawrence / /

/

Position

Prime Minister / /

ProvinceOrState

Maryland / /

PublishedMedium

Technology and Culture / /

Technology

similar algorithm / This algorithm / cient algorithms / cient algorithm / /

SocialTag