By Topic

Fast solvers and Sylvester equations: both sides now

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

We're using the structure of a problem with n2 unknowns to reduce the amount of computation from O(n6) (using the Cholesky decomposition) to O(n4) (exploiting sparsity) and then to O(n3) (using the Sylvester structure), a substantial savings when n is large. But knowing just a bit more about the problem's structure allows further reduction, down to O(n2 log2n) when n is a power of two. Because we're computing n2 answers, this is close to optimal, and it illustrates the value of exploiting every possible bit of structure in our problems.

Published in:

Computing in Science & Engineering  (Volume:7 ,  Issue: 6 )