Minimal Split Checkerboard Method for Exponentiating Sparse Matrices and Its Applications in Quantum Statistical Mechanics

DOI10.1137/110838716zbMATH Open1266.15040OpenAlexW2007419318MaRDI QIDQ5300151FDOQ5300151

Che-Rung Lee

Publication date: 26 June 2013

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110838716

Recommendations

• Sparse approximate matrix-matrix multiplication for density matrix purification with error control
• Computation of the Exponential of Large Sparse Skew-Symmetric Matrices
• Efficient computation of the exponential operator for large, sparse, symmetric matrices
• Fast matrix exponent for deterministic or random excitations
• scientific article; zbMATH DE number 687752
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
• Optimal sparse eigenspace and low-rank density matrix estimation for quantum systems
• A formulation of a matrix sparsity approach for the quantum ordered search algorithm

zbMATH Keywords

sparse matricessplitting methodmatrix exponentialcheckerboard method

Mathematics Subject Classification ID

Fuzzy matrices (15B15)

Cited In (1)

• Sparse approximate matrix-matrix multiplication for density matrix purification with error control

Uses Software

• OSKI
• SPARSKIT

This page was built for publication: Minimal Split Checkerboard Method for Exponentiating Sparse Matrices and Its Applications in Quantum Statistical Mechanics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300151)