Search results

Create the page "Serial-parallel method" on this wiki! See also the search results found.

• Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, locality
  ...holder_qtq_1.png|thumb|center|700px|Figure 1. The Householder (reflection) method for reducing symmetric matrices to tri-diagonal form. Overall memory access ...profile for an implementation of the Householder (reflection) method. This method reduces a symmetric matrix to tri-diagonal form. The profile obviously has
  5 KB (820 words) - 08:41, 9 July 2022
• The serial-parallel summation method, scalability
  [[Ru:The serial-parallel summation method, scalability]]
  3 KB (456 words) - 15:08, 8 July 2022
• Linpack benchmark
  ...are forward substitution in the Gauss method and back substitution in this method. ...purple, respectively. Figure 2 shows the graph of a layer (one step of the method). The notation is the same as in the full graph. Dotted lines denote data c
  11 KB (1,723 words) - 16:15, 12 July 2022
• Givens method
  | name = Givens (rotation) method for the<br />QR decomposition of a square matrix '''Givens method''' (which is also called '''the rotation method''' in the Russian mathematical literature) is used to represent a matrix in
  19 KB (2,974 words) - 16:32, 8 July 2022
• Single-qubit transform of a state vector
  ...ndependent too, as can bee seen from Fig.3. For shared memory systems such method leads to the near ideal speed-up. However, for the distributed memory machi
  11 KB (1,666 words) - 15:56, 19 July 2022
• Cooley–Tukey Fast Fourier Transform, radix-2 case
  ...best reflected on a [[hypercube]] type network. The popularity of FFT as a method to address various tasks has therefore popularized the idea of computationa
  10 KB (1,588 words) - 16:45, 1 July 2022
• One step of the dqds algorithm
  The method is given by the following formulas: The operations in the method are performed in the following order:
  12 KB (1,807 words) - 09:51, 8 July 2022
• Cholesky decomposition
  ...al literature, the Cholesky decomposition is also known as the square-root method<ref>Voevodin V.V. Computational foundations of linear algebra Moscow: Nauka ...e Cholesky decomposition is also widely used as the main stage of a direct method for solving linear systems. In order to reduce the memory requirements and
  27 KB (4,386 words) - 18:37, 2 July 2023
• Cholesky decomposition, locality
  ...e; however, this rate is lower than that of the LINPACK test or the Jacobi method.
  6 KB (960 words) - 12:46, 7 July 2022

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)