RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      Numerical computation for stationary incompressible navier-stokes equations using meshless method

      한글로보기

      https://www.riss.kr/link?id=E807154

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

      We consider the meshless method concerned with the Stokes and the Navier-Stokes equations. Among all varieties of meshless methods, the moving least square reproducing kernel method or briefly speaking MLSRK method is mainly dealt with. We compute the numerical solutions for these equations to compare with exact solutions. Also we solve the driven cavity flow numerically as a test problem using MLSRK method.
      번역하기

      We consider the meshless method concerned with the Stokes and the Navier-Stokes equations. Among all varieties of meshless methods, the moving least square reproducing kernel method or briefly speaking MLSRK method is mainly dealt with. We compute the...

      We consider the meshless method concerned with the Stokes and the Navier-Stokes equations. Among all varieties of meshless methods, the moving least square reproducing kernel method or briefly speaking MLSRK method is mainly dealt with. We compute the numerical solutions for these equations to compare with exact solutions. Also we solve the driven cavity flow numerically as a test problem using MLSRK method.

      더보기

      목차 (Table of Contents)

      • 1. Introduction
      • 2. Preliminaries
      • 2.1 Graphs
      • 2.2 Distributed system model
      • 2.3 The Weighted Shortest-path Updating Problem (WSUP)
      • 1. Introduction
      • 2. Preliminaries
      • 2.1 Graphs
      • 2.2 Distributed system model
      • 2.3 The Weighted Shortest-path Updating Problem (WSUP)
      • 2.4 Measures of efficiency
      • 3. Algorithm solving the WSUP
      • 3.1 The idea of our algorithm
      • 3.2 The outline of our algorithm
      • 4. Complexities
      • 5. Conclusions
      • References
      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼