Skip to content
Free planNo credit card requiredStart writing

article · Keisan Rikigaku Koenkai koen ronbunshu/Keisan Rikigaku Kouenkai kouen rombunshuu · 2004

A Mesh Partitioning based on Learning Vector Quantization For the Parallel Finite Element Analysis

Osamu OKUDA

Cited by 0Open access

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

OKUDA, O. (2004). A Mesh Partitioning based on Learning Vector Quantization For the Parallel Finite Element Analysis. Keisan Rikigaku Koenkai koen ronbunshu/Keisan Rikigaku Kouenkai kouen rombunshuu, 2004.17(0), 363–364. https://doi.org/10.1299/jsmecmd.2004.17.363

MLA 9

OKUDA, Osamu. “A Mesh Partitioning based on Learning Vector Quantization For the Parallel Finite Element Analysis.” Keisan Rikigaku Koenkai koen ronbunshu/Keisan Rikigaku Kouenkai kouen rombunshuu, vol. 2004.17, no. 0, 2004, pp. 363–64, https://doi.org/10.1299/jsmecmd.2004.17.363.

Chicago

OKUDA, Osamu. 2004. “A Mesh Partitioning based on Learning Vector Quantization For the Parallel Finite Element Analysis.” Keisan Rikigaku Koenkai koen ronbunshu/Keisan Rikigaku Kouenkai kouen rombunshuu 2004.17 (0): 363–64. https://doi.org/10.1299/jsmecmd.2004.17.363.

Harvard

OKUDA, O. (2004) ‘A Mesh Partitioning based on Learning Vector Quantization For the Parallel Finite Element Analysis’, Keisan Rikigaku Koenkai koen ronbunshu/Keisan Rikigaku Kouenkai kouen rombunshuu, 2004.17(0), pp. 363–364. Available at: https://doi.org/10.1299/jsmecmd.2004.17.363.

BibTeX
@article{okuda2004mesh,
  title = {{A Mesh Partitioning based on Learning Vector Quantization For the Parallel Finite Element Analysis}},
  author = {OKUDA, Osamu},
  journal = {Keisan Rikigaku Koenkai koen ronbunshu/Keisan Rikigaku Kouenkai kouen rombunshuu},
  volume = {2004.17},
  number = {0},
  pages = {363--364},
  year = {2004},
  doi = {10.1299/jsmecmd.2004.17.363}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.