scholarly journals Resolving phase ambiguity in dual‐echo dixon imaging using a projected power method

2016 ◽  
Vol 77 (5) ◽  
pp. 2066-2076 ◽  
Author(s):  
Tao Zhang ◽  
Yuxin Chen ◽  
Shanshan Bao ◽  
Marcus T. Alley ◽  
John M. Pauly ◽  
...  
2010 ◽  
Vol 65 (1) ◽  
pp. 96-107 ◽  
Author(s):  
Holger Eggers ◽  
Bernhard Brendel ◽  
Adri Duijndam ◽  
Gwenael Herigault
Keyword(s):  

2011 ◽  
Vol 52 (10) ◽  
pp. 1847-1855 ◽  
Author(s):  
Xin-Gui Peng ◽  
Shenghong Ju ◽  
Yujiao Qin ◽  
Fang Fang ◽  
Xin Cui ◽  
...  

2017 ◽  
Vol 78 (6) ◽  
pp. 2203-2215 ◽  
Author(s):  
Eric G. Stinson ◽  
Joshua D. Trzasko ◽  
Joel G. Fletcher ◽  
Stephen J. Riederer

2017 ◽  
Vol 26 (1) ◽  
pp. 27 ◽  
Author(s):  
B Saranya ◽  
T Sulfikarali ◽  
S Chindhu ◽  
A M Muneeb ◽  
N K Leela ◽  
...  

Antioxidant activity of sequential extracts of black pepper, ginger, turmeric and cinnamon was determined by DPPH assay, phosphomolybdate method and ferric reducing power method and compared with that of the synthetic antioxidant BHA. The results revealed that methanol extract of cinnamon has highest antioxidant potential followed by chloroform extract of turmeric. The antioxidant potential was also correlated with total phenol content.  


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1522
Author(s):  
Anna Concas ◽  
Lothar Reichel ◽  
Giuseppe Rodriguez ◽  
Yunzi Zhang

The power method is commonly applied to compute the Perron vector of large adjacency matrices. Blondel et al. [SIAM Rev. 46, 2004] investigated its performance when the adjacency matrix has multiple eigenvalues of the same magnitude. It is well known that the Lanczos method typically requires fewer iterations than the power method to determine eigenvectors with the desired accuracy. However, the Lanczos method demands more computer storage, which may make it impractical to apply to very large problems. The present paper adapts the analysis by Blondel et al. to the Lanczos and restarted Lanczos methods. The restarted methods are found to yield fast convergence and to require less computer storage than the Lanczos method. Computed examples illustrate the theory presented. Applications of the Arnoldi method are also discussed.


2021 ◽  
Vol 88 (1) ◽  
Author(s):  
Antoine Gautier ◽  
Matthias Hein ◽  
Francesco Tudisco

AbstractWe analyze the global convergence of the power iterates for the computation of a general mixed-subordinate matrix norm. We prove a new global convergence theorem for a class of entrywise nonnegative matrices that generalizes and improves a well-known results for mixed-subordinate $$\ell ^p$$ ℓ p matrix norms. In particular, exploiting the Birkoff–Hopf contraction ratio of nonnegative matrices, we obtain novel and explicit global convergence guarantees for a range of matrix norms whose computation has been recently proven to be NP-hard in the general case, including the case of mixed-subordinate norms induced by the vector norms made by the sum of different $$\ell ^p$$ ℓ p -norms of subsets of entries.


Sign in / Sign up

Export Citation Format

Share Document