Computing Matrix-Matrix Addition using QR and/or SVD
    5 ビュー (過去 30 日間)
  
       古いコメントを表示
    
Apologies if this sounds like an uninformed question but I was wondering if there are theoretical results that talk about the following problem:
Suppose we have two  matrices
 matrices  and
 and  with
 with  and they can be written as the following via QR decomposition:
 and they can be written as the following via QR decomposition:
 matrices
 matrices  and
 and  with
 with  and they can be written as the following via QR decomposition:
 and they can be written as the following via QR decomposition: and
 and  
 Is there a way we can get the QR decomposition of the matrix  without explicitly adding
 without explicitly adding  and
 and  together and by only using the individual QR decomposition of both
 together and by only using the individual QR decomposition of both  and
 and  . Specifically, I want to know if there are theoretical results that either talk about the feasibility of this algorithmically or if not? provide a justification of why it cannot be done. Also, can the same be said about the SVD of
. Specifically, I want to know if there are theoretical results that either talk about the feasibility of this algorithmically or if not? provide a justification of why it cannot be done. Also, can the same be said about the SVD of  ?
?
 without explicitly adding
 without explicitly adding  and
 and  together and by only using the individual QR decomposition of both
 together and by only using the individual QR decomposition of both  and
 and  . Specifically, I want to know if there are theoretical results that either talk about the feasibility of this algorithmically or if not? provide a justification of why it cannot be done. Also, can the same be said about the SVD of
. Specifically, I want to know if there are theoretical results that either talk about the feasibility of this algorithmically or if not? provide a justification of why it cannot be done. Also, can the same be said about the SVD of  ?
?4 件のコメント
  Matt J
      
      
 2021 年 7 月 4 日
				
      編集済み: Matt J
      
      
 2021 年 7 月 4 日
  
			I don't think I see how that would help you. Let's take the simple case where,
A=e*eye(2);
B=1/e*eye(2);
The QR decomposition of A+B is 
Q=eye(2);
R=(e+1/e)*eye(2);
How do you use this to deal with the the case where (e+1/e)  absorbs to 1/e in double float precision? 
回答 (0 件)
参考
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!


