Skip to content

Commit ff1b5ed

Browse files
committed
paper: Change bib label strang -> strang94
1 parent 4281e28 commit ff1b5ed

File tree

2 files changed

+2
-2
lines changed

2 files changed

+2
-2
lines changed

docs/paper/paper.bib

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ @inproceedings{mortensen17
3232
year = {2017}
3333
}
3434

35-
@article{strang,
35+
@article{strang94,
3636
ISSN = {00030996},
3737
URL = {http://www.jstor.org/stable/29775194},
3838
author = {Gilbert Strang},

docs/paper/paper.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@ bibliography: paper.bib
2626
The fast Fourier transform (FFT) is an algorithm that efficiently computes the
2727
discrete Fourier transform. The FFT is one of the most important algorithms
2828
utilized throughout science and society and it has been named *the most
29-
important numerical algorith of our time* by Prof Gilbert Strang [@strang].
29+
important numerical algorith of our time* by Prof Gilbert Strang [@strang94].
3030

3131
``mpi4py-fft`` (https://bitbucket.org/mpi4py/mpi4py-fft) is an open-source
3232
Python package for computing (in parallel) FFTs of possibly very large and

0 commit comments

Comments
 (0)