✦ LIBER ✦

Fast algorithm for calculation of Dirac's gamma-matrices traces

✍ Scribed by Ilyin, V. A.; Kryukov, A. P.; Rodioniov, A. Y.; Taranov, A. Y.

Book ID: 117993194
Publisher: Association for Computing Machinery
Year: 1989
Weight: 369 KB
Volume: 23
Category: Article
ISSN: 0163-5824
DOI: 10.1145/70927.70929

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new method for calculation of traces o

A new method for calculation of traces of Dirac γ-matrices in Minkowski space

✍ Alexander L. Bondarev 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Fast algorithms for the calculation of K

Fast algorithms for the calculation of Kendall’s τ

✍ David Christensen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 507 KB

A fast algorithm for macromolecular pack

A fast algorithm for macromolecular packing calculation

✍ Mande, S. C. ;Suguna, K. 📂 Article 📅 1989 🏛 International Union of Crystallography 🌐 English ⚖ 353 KB

Fast Algorithm for Calculation of the Un

Fast Algorithm for Calculation of the Union-Based Probability

✍ Jancovic, P. 📂 Article 📅 2007 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 131 KB

Fast Calculation of Spectral Bounds for

Fast Calculation of Spectral Bounds for Hessian Matrices on Hyperrectangles

✍ Mönnigmann, M. 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 249 KB

A fast algorithm for the inversion of ge

A fast algorithm for the inversion of general Toeplitz matrices

✍ P.G. Martinsson; V. Rokhlin; M. Tygert 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 590 KB

we propose a "fast" algorithm for the construction of a data-sparse inver'~ of a general Toeplitz matrix. The computational cost for inverting an N × N Toeplitz matrix equals the cost of four length-N FFTs plus an O(N)-term. This cost should be compared to the O(Nlog2N) cost of previously published