Re: [eigen] Including Spectra within Eigen 3.4 |

[ Thread Index | Date Index | More lists.tuxfamily.org/eigen Archives ]

*To*: eigen@xxxxxxxxxxxxxxxxxxx*Subject*: Re: [eigen] Including Spectra within Eigen 3.4*From*: Oleg Shirokobrod <oleg.shirokobrod@xxxxxxxxx>*Date*: Sun, 2 Apr 2017 21:19:21 +0300*Dkim-signature*: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025; h=mime-version:in-reply-to:references:from:date:message-id:subject:to; bh=1NfCFE57m//G9aFdMh48vF7uhR2JPWoXzxFW+ZAruJ4=; b=mvFQsCkOzzvPqLt8xE0RcwNRwf2oks9Wsxi9BBq7mAvK557msduuh5Ydcgj4edHIdz JIYskKgUu5lNrRKPa9xK5im9RfgyzJW/e/cbYRDL1J0pja+gK42LWsWN1ikQdnOVTwmK EeXkPX2ZlyBsCrRgGN6RCzNBbiU0eYHpucWilfSvvefT8t3J7CRXYCyE5T0N5Z/vwjEz Dx0SCWHPs9MXG77HGQ7uIUBlKS9OU5APP66Ogun9xXL24Bs9hDpy3L1fj7HebonjSiZa 4YWroAIGBc97ENddwE0iW6RuCxCqF1XBrEYN3+gw6v/4iEEW+hb0fzvtwqrFwg8ZfsQR kADg==

Hi Yixuan, Thank you for explanation. There are numerous applications using truncated svd. I am interested in rather general problem, namely using tsvd for unfolding measured data from detector response function (measured data inverse problem). I hope that together with dominant eigen problem for large matrix efficient tsvd will be implemented in Spectra module.

Kind regards,

Oleg

On Apr 2, 2017 6:26 PM, "Yixuan Qiu" <yixuanq@xxxxxxxxx> wrote:

YixuanBest,There are algorithms that can compute SVD without touching X'X, and I agree that these methods may be more appropriate for SVD problems. Bryan Lewis once wrote an article comparing the R pakcages "RSpectra" and "irlba", which also discussed the algorithm issues. https://bwlewis.github.io/Hi Oleg,I think part of the reason is that when using Spectra to compute SVD of X, we are actually calculating the eigenvalues of X'X or XX'. However, this doubles the condition number of X, and hence the numerical precision and stability is reduced.irlba/comparison.html 2017-04-02 10:59 GMT-04:00 Oleg Shirokobrod <oleg.shirokobrod@xxxxxxxxx>:Thanks Bill.Matlab lmsvd gives the same singular values with tolerance 1.e-8 as Spectra code does with tolerance 1.e-10. It gives the same values with tolerance 1.e-19 as Spectra does with tolerance 1.e-12. It uses algorithm described in a paper: Xin Liu, Zaiwen Wen and Yin Zhang, Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions, SIAM Journal on Scientific Computing, 35-3 (2013), A1641-A1668.

Does it mean that this algorithm converges faster than Spectra one?Best regards,Oleg Shirokobrod

--

**References**:**Re: [eigen] Including Spectra within Eigen 3.4***From:*Bill Greene

**Re: [eigen] Including Spectra within Eigen 3.4***From:*Oleg Shirokobrod

**Re: [eigen] Including Spectra within Eigen 3.4***From:*Yixuan Qiu

**Messages sorted by:**[ date | thread ]- Prev by Date:
**Re: [eigen] Including Spectra within Eigen 3.4** - Next by Date:
**[eigen] Eigenvalue solving and balancing** - Previous by thread:
**Re: [eigen] Including Spectra within Eigen 3.4** - Next by thread:
**[eigen] Eigenvalue solving and balancing**

Mail converted by MHonArc 2.6.19+ | http://listengine.tuxfamily.org/ |