Search results
Jump to navigation
Jump to search
Create the page "Thomas" on this wiki! See also the search results found.
Page title matches
- [[Ru:Thomas, locality]]8 KB (1,235 words) - 09:29, 14 July 2022
- 80 bytes (6 words) - 15:25, 14 March 2018
- [[ru:Repeated Thomas, locality]]89 bytes (9 words) - 11:02, 14 July 2022
- [[Ru:Thomas algorithm, locality]]8 KB (1,236 words) - 09:15, 14 July 2022
- 95 bytes (6 words) - 15:40, 14 March 2018
- | name = Thomas algorithm, pointwise version Thomas algorithm is a variant of Gaussian elimination used for solving a system of12 KB (1,761 words) - 09:20, 14 July 2022
- [[Ru:Two-sided Thomas, locality]]9 KB (1,373 words) - 11:50, 14 July 2022
- 161 bytes (6 words) - 15:27, 14 March 2018
- [[ru:Repeated two-sided Thomas, locality]]99 bytes (10 words) - 13:22, 14 July 2022
- 130 bytes (6 words) - 15:42, 14 March 2018
- | name = Two-sided Thomas algorithm,<br /> pointwise version The '''two-sided Thomas algorithm''' (in the LINPACK Users’ Guide it was called the “burn at bo13 KB (1,984 words) - 11:57, 14 July 2022
- 151 bytes (6 words) - 15:36, 14 March 2018
Page text matches
- #REDIRECT [[Repeated Thomas algorithm, pointwise version]]58 bytes (6 words) - 15:26, 14 March 2018
- [[ru:Repeated Thomas, locality]]89 bytes (9 words) - 11:02, 14 July 2022
- [[ru:Repeated two-sided Thomas, locality]]99 bytes (10 words) - 13:22, 14 July 2022
- ===== Thomas algorithms ===== ====== Monotone Thomas algorithm ======10 KB (1,222 words) - 15:32, 9 November 2017
- ##### {{level|Thomas algorithm}} ###### {{level|Thomas algorithm, pointwise version}}14 KB (1,596 words) - 13:06, 15 March 2018
- | name = Thomas algorithm, pointwise version Thomas algorithm is a variant of Gaussian elimination used for solving a system of12 KB (1,761 words) - 09:20, 14 July 2022
- ...because it involves redundant calculations compared to, say, the classical Thomas algorithm. A serial implementation of the method makes no sense also for th ...sible. A faster approach would be to solve a SLAE on a common PC using the Thomas algorithm.11 KB (1,833 words) - 15:51, 8 July 2022
- | name = Two-sided Thomas algorithm,<br /> pointwise version The '''two-sided Thomas algorithm''' (in the LINPACK Users’ Guide it was called the “burn at bo13 KB (1,984 words) - 11:57, 14 July 2022
- [[Ru:Thomas, locality]]8 KB (1,235 words) - 09:29, 14 July 2022
- [[Ru:Thomas algorithm, locality]]8 KB (1,236 words) - 09:15, 14 July 2022
- ...n the [[http://algowiki-project.org/en/Thomas_algorithm,_pointwise_version|Thomas algorithm]].10 KB (1,469 words) - 16:41, 16 March 2018
- [[Ru:Two-sided Thomas, locality]]9 KB (1,373 words) - 11:50, 14 July 2022
- * '''Gabow's algorithm''' <ref>Gabow, Harold N, Zvi Galil, Thomas H Spencer, and Robert Endre Tarjan. “Efficient Algorithms for Finding Min9 KB (1,363 words) - 14:56, 19 June 2018