Avancerad sökning

Hittade 1 avhandling som matchar ovanstående sökkriterier.

1. 1. Subspace Computations via Matrix Decompositions and Geometric Optimization

   Författare :Lennart Simonsson; Axel Ruhe; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Numerical Analysis; Rank-revealing UTV; Jacobi-Davidson algorithm; Decomposition; Grassmann type algorithms; Numerical analysis; Numerisk analys;

   Sammanfattning : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. LÄS MER