Does anyone here know of any fast algorithms to diagonize large, symmetric matrices, that are mostly zeros? (by large I mean 300x300 up to several million by several million)(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Diagonalization algorithm

Loading...

Similar Threads for Diagonalization algorithm | Date |
---|---|

C/++/# Is there a flaw in my longest common subsequence algorithm? | Feb 24, 2018 |

C/++/# Finding duplicates algorithm | Jan 20, 2018 |

LAPACK dgeev: parameter had illegal value | May 26, 2015 |

Iterating all diagonal slices of a matrix | Oct 2, 2013 |

Diagonal line plotting in C | Jan 28, 2009 |

**Physics Forums - The Fusion of Science and Community**