Find a few eigenpairs of a matrix using the Davidson-Liu algorithm
-
Updated
Nov 18, 2017 - C++
Find a few eigenpairs of a matrix using the Davidson-Liu algorithm
Example code to try to run armadillo diagonalization in parallel
Port form svn repo of DiagHam from http://www.nick-ux.org/diagham/
Simple code to obtain the dispersion curve and z component of spin-spin correlation for a 1D Tight Binding model.
ParaDiag includes diagonalization-based Parallel-in-Time (PinT) algorithms, which can handle both both dissipative and hyperbolic equations.
Finding the finest simultaneous block diagonalization of multiple matrices by sequentially exploring invariant subspaces under matrix multiplications. Applications include the efficient analysis of arbitrary synchronization patterns in complex networks.
A simple algorithm that finds a simultaneous block diagonalization of multiple matrices through the eigendecomposition of a single matrix.
This gives steady state Network Flow from the given Pref-Defined Network Flow of a System. And a Python implementation of Larry Page's famous PageRank algorithm.
a short, simple public-domain header-only C++ library for calculating eigenvalues and eigenvectors of real symmetric matrices
Lecture Notes for Linear Algebra Featuring Python. This series of lecture notes will walk you through all the must-know concepts that set the foundation of data science or advanced quantitative skillsets. Suitable for statistician/econometrician, quantitative analysts, data scientists and etc. to quickly refresh the linear algebra with the assis…
my first project
Fortran 77/90/95 programs that deal with Physical Chemistry problems
complexarith is an attempt to model the complex field arithmetic in Java to be used in mathematical developments.
quantum circuit systems
Add a description, image, and links to the diagonalization topic page so that developers can more easily learn about it.
To associate your repository with the diagonalization topic, visit your repo's landing page and select "manage topics."