While the proper orthogonal decomposition (POD) is optimal under certain norms, it's also expensive to compute. For large matrix sizes, the qr decomposition provides a tractable alternative. Under the assumption t...
详细信息
While the proper orthogonal decomposition (POD) is optimal under certain norms, it's also expensive to compute. For large matrix sizes, the qr decomposition provides a tractable alternative. Under the assumption that it is a rank-revealing qr (RRqr), the approximation error incurred is similar to the POD error;furthermore, the authors show the existence of an RRqr with exactly the same error estimate as POD. To numerically realize an RRqr decomposition, they discuss the (iterative) modified Gram Schmidt with pivoting and reduced basis methods. They show that these two seemingly different approaches are equivalent. They then describe an MPI/OpenMP parallel code that implements one of the qr-basedmodelreductionalgorithms analyzed, and document the code's scalability for large problems, such as gravitational waves, and demonstrate excellent scalability up to 32,768 cores and, for complex dense matrices, as large as 10,000x3,276,800.
暂无评论