Efficient multigrid algorithms for locally constrained parallel systems (Q580927): Difference between revisions

A theoretical study of the organization of computer structures, consisting of independent processors coupled via common local memories, is used to investigate the speed up and efficiency of a parallelization of multigrid methods.

0 references

zbMATH Keywords

parallelization

0 references

tree and nearest-neighbour systems

0 references

organization of computer structures

0 references

speed up

0 references

efficiency

0 references

multigrid methods

0 references

reviewed by

Robert S. Anderssen

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0096-3003(86)90103-7

0 references

cites work

Parallel Networks for Multi-Grid Algorithms: Architecture and Complexity

0 references

Q3885184

0 references

Q3675465

0 references

Identifiers

zbMATH Open document ID

0626.65102

0 references

DOI

10.1016/0096-3003(86)90103-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:580927

@@ Property / author @@
+Sumit K. Garg
@@ Property / author: Sumit K. Garg / rank @@
+Normal rank
@@ Property / review text @@
+A theoretical study of the organization of computer structures, consisting of independent processors coupled via common local memories, is used to investigate the speed up and efficiency of a parallelization of multigrid methods.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+N22
@@ Property / Mathematics Subject Classification ID: 65N22 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Y05
@@ Property / Mathematics Subject Classification ID: 65Y05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+J05
@@ Property / Mathematics Subject Classification ID: 35J05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F10
@@ Property / Mathematics Subject Classification ID: 65F10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+4018301
@@ Property / zbMATH DE Number: 4018301 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parallelization
@@ Property / zbMATH Keywords: parallelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tree and nearest-neighbour systems
@@ Property / zbMATH Keywords: tree and nearest-neighbour systems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+organization of computer structures
@@ Property / zbMATH Keywords: organization of computer structures / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+speed up
@@ Property / zbMATH Keywords: speed up / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+efficiency
@@ Property / zbMATH Keywords: efficiency / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multigrid methods
@@ Property / zbMATH Keywords: multigrid methods / rank @@
+Normal rank
@@ Property / reviewed by @@
+Robert S. Anderssen
@@ Property / reviewed by: Robert S. Anderssen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0096-3003(86)90103-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2066061531
@@ Property / OpenAlex ID: W2066061531 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Networks for Multi-Grid Algorithms: Architecture and Complexity
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3675465
@@ Property / cites work: Q3675465 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:580927