Jump to content

Tridiagonal matrix algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

8 April 2024

  • curprev 21:0021:00, 8 April 2024 169.231.25.141 talk 20,400 bytes +33 The previous code wouldn't have run. You can see this because the loop is from ix = 1 to X-1 inclusive, and accesses c[ix], but c only has elements from 0 to X-2. This causes an error on the ix = X-1 iteration, however, note that scratch[X-1] is never used in the computation, so we can simply only execute the line when ix is less than X-1. undo

19 January 2024

1 November 2023

2 October 2023

10 August 2023

30 June 2023

22 February 2023

19 October 2022

15 September 2022

24 June 2022

  • curprev 13:1913:19, 24 June 2022 Mporterp talk contribs 17,474 bytes 0 In the periodic boundary section, B^-1u is simplified to y, but it should actually be q. (y is B^-1d in the formula above this line). As is, the formula and example code give the wrong results. undo

28 May 2022

27 May 2022

25 May 2022

6 April 2022

23 November 2021

11 July 2021

1 June 2021

28 May 2021

11 November 2020

10 November 2020

20 October 2020

18 September 2020

11 May 2020

6 May 2020

2 April 2020

27 February 2020

17 December 2019

18 November 2019

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)