Search results

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

Page title matches

• The serial-parallel summation method
  ...s into double ones; b) on serial computers and for certain operations, the method was able to reduce the impact of round-off errors at the results. Here, we Formulas of the method: the integer <math>N</math> is represented as <math>N = (p - 1) k + q</math
  7 KB (1,189 words) - 15:12, 8 July 2022
• The serial-parallel summation method, locality
  ...ince we discuss the serial implementation of the serial-parallel summation method, the profile structure is practically independent of the number of branches ...at these values are sufficiently high, and they are close to those for the serial-parallel dot product of two vectors. This is not surprising because both procedures
  3 KB (511 words) - 14:59, 8 July 2022
• The serial-parallel summation method, scalability
  [[Ru:The serial-parallel summation method, scalability]]
  3 KB (456 words) - 15:08, 8 July 2022
• Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions
  269 bytes (8 words) - 15:34, 14 March 2018
• Serial Jacobi (rotations) method for symmetric matrices
  198 bytes (6 words) - 16:08, 14 March 2018
• Serial Jacobi (rotations) method with thresholds for symmetric matrices
  220 bytes (6 words) - 16:10, 14 March 2018

Page text matches

• Pairwise summation of numbers
  Formulas of the method: At each stage, the current array is first partitioned into pairs, and then The computational kernel of the serial-parallel summation method can be compiled either of elementary pairwise additions (there are on the w
  5 KB (686 words) - 12:52, 8 July 2022
• The serial-parallel summation method
  ...s into double ones; b) on serial computers and for certain operations, the method was able to reduce the impact of round-off errors at the results. Here, we Formulas of the method: the integer <math>N</math> is represented as <math>N = (p - 1) k + q</math
  7 KB (1,189 words) - 15:12, 8 July 2022
• The serial-parallel summation method, locality
  ...ince we discuss the serial implementation of the serial-parallel summation method, the profile structure is practically independent of the number of branches ...at these values are sufficiently high, and they are close to those for the serial-parallel dot product of two vectors. This is not surprising because both procedures
  3 KB (511 words) - 14:59, 8 July 2022
• Horners method
  | name = Horners method Unfortunately, Horner’s method is often reduced only to the calculation of a polynomial <math>P_n(x)</math
  7 KB (1,082 words) - 10:15, 8 July 2022
• Dot product
  ...al and complex arithmetic. Here, we deal only with real arithmetic and the serial-parallel implementation. Formulas of the method:
  9 KB (1,353 words) - 14:49, 8 July 2022
• Methods for solving tridiagonal SLAEs
  ...братная подстановка в СЛАУ с двухдиагональной матрицей|substitution]]. The method is almost serial (except for the possibility to solve the first bi-diagonal ...y from the top end and lower end of a SLAE (which explains the name of the method).
  10 KB (1,222 words) - 15:32, 9 November 2017
• Gaussian elimination, compact scheme for tridiagonal matrices and its modifications
  ==== Serial-parallel algorithm for the <math>LU</math> decomposition of tri-diagonal matrices == ...As a result, the algorithm has a larger region of stability than the Stone method. There exists a block version for block tri-diagonal matrices; however, it
  10 KB (1,469 words) - 16:41, 16 March 2018
• Algorithm classification
  # {{level|Uniform norm of a vector: Real version, serial-parallel variant}} # {{level|The serial-parallel summation method}}
  14 KB (1,596 words) - 13:06, 15 March 2018
• Dense matrix-vector multiplication
  Formulas of the method: There also exists a block version of the method; however, this description treats only the pointwise version.
  8 KB (1,273 words) - 12:54, 8 July 2022
• Thomas algorithm, pointwise version
  ...amine the so-called right-elimination, which is the variant of elimination method in which a SLAE is processed top-down and then in the reverse direction. In [[file:Progonka.png|thumb|right|200px|Figure 1. Graph of the elimination method for n=8. The input and output data are not shown. The symbols / and f denot
  12 KB (1,761 words) - 09:20, 14 July 2022
• Dense matrix multiplication (serial version for real matrices)
  Formulas of the method: There exists also a block version of the method; however, this description treats only the pointwise version.
  8 KB (1,340 words) - 10:55, 8 July 2022
• Two-sided Thomas algorithm, pointwise version
  ...ithm''' (in the LINPACK Users’ Guide it was called the “burn at both ends“ method) is a variant of Gaussian elimination used for solving a system of linear a ...sided elimination can be regarded as the simplest version of the reduction method (in which m = 1 and monotone eliminations are conducted in opposite directi
  13 KB (1,984 words) - 11:57, 14 July 2022
• Forward substitution
  ...he process of solving a SLAE is a modification of the general substitution method and this process can be described by simple formulas. ...Gaussian elimination for solving SLAEs''', namely, the final stage of this method.
  10 KB (1,624 words) - 09:48, 18 July 2022
• Householder (reflections) method for reducing a symmetric matrix to tridiagonal form
  | name = The Householder (reflection) method for reducing symmetric matrices to tridiagonal form ...determined by a vector. For the classical implementation of the reflection method, this makes it possible to store the results of decomposition in place of t
  16 KB (2,480 words) - 12:09, 7 July 2022
• Thomas, locality
  ...one of the recommendations to application engineers using the elimination method is as follows: Arrange the calculations so that all the elimination paths a ...g operations. This sharply deteriorates the performance of the elimination method even for modern single-processor and single-core systems.
  8 KB (1,235 words) - 09:29, 14 July 2022
• Thomas algorithm, locality
  ...one of the recommendations to application engineers using the elimination method is as follows: Arrange the calculations so that all the elimination paths a ...g operations. This sharply deteriorates the performance of the elimination method even for modern single-processor and single-core systems.
  8 KB (1,236 words) - 09:15, 14 July 2022
• Stone doubling algorithm for the LU decomposition of a tridiagonal matrix
  ...Es such as, for instance, the [[Complete cyclic reduction|cyclic reduction method]]. Theoretically, the Stone method is based on the following considerations. Define the values <math>q_i</math
  11 KB (1,833 words) - 15:51, 8 July 2022
• Dot product, locality
  ...are looking at the serial implementation of the serial-parallel summation method, the profile has little dependence on the number of branches chosen – onl
  4 KB (558 words) - 14:38, 8 July 2022
• Two-sided Thomas, locality
  ...e recommendations to application engineers using the two-sided elimination method is as follows: Arrange the calculations so that all the elimination paths a ...ely preceding operations. This sharply deteriorates the performance of the method even for modern single-processor and single-core systems. That is why, in t
  9 KB (1,373 words) - 11:50, 14 July 2022
• Backward substitution
  ...th the matrix <math>U</math> is a modification of the general substitution method and can be written using simple formulas. ...of the '''backward Gaussian elimination''' in the '''Gaussian elimination method for solving linear systems'''.
  16 KB (2,569 words) - 14:31, 18 July 2022

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