1 of 98

PRESENTATION

ACADEMIC AND PROJECT WORK

2 of 98

BACKGROUND

EDUCATION

  • University of Wisconsin − Madison

MS/PhD Mechanical Engineering Dec 2023

  • Indian Institute of Technology − Bombay

BTech/MTech Mechanical Engineering - Thermal & Fluid Engineering– 2011

Google scholar: https://scholar.google.com/citations?user=1EtqFh0AAAAJ

3 of 98

RESEARCH & ACADEMIC PROJECTS

Master’s Project: “Mesh Generation for thermal diffusion using Adaptive gird refinement”

Spatial Automation Lab

  • “Systems modelling of Fabrics”
  • CUDA Project: “Fabric simulation using High Performance Computing”
  • “Octree simulation using MATLAB/C++”
  • “Fabric Simulation models using Model based Design”

Soft Matter Lab

  • ” Soft Matter and instability Simulation of Magneto Active Elastomers” − Soft Matter Lab

- 1st Author paper https://www.sciencedirect.com/science/article/pii/S002074032100583X

4 of 98

ADAPTIVE GRID REFINEMENT �FOR UNSTEADY DIFFUSION EQUATION �ON UNSTRUCTURED TRIANGULAR MESH

By Parag Pathak 06D10017

5 of 98

Discretization Methods

  •  

Spatial discretization of Equation

Finite Volume Methods

6 of 98

Discretization Methods

  •  

Spatial discretization of Equation

Finite Element Methods

 

7 of 98

Problem : Moving Gaussian

8 of 98

Adaptive Grid Refinement

9 of 98

Discretization

  •  

Temporal discretization of Equation and domain

10 of 98

Discretization

Discretization of Space Domain

Quadrilateral grids

11 of 98

Discretization

Discretization of Space Domain

Triangular Grids

12 of 98

Delaunay Triangulation

  • Every point is outside of the circum-circle of any other triangle.
  • Voronoi diagram is the dual to the Delaunay triangulation.

13 of 98

Delaunay Triangulation

  • The boundary points are Delaunay triangulated

14 of 98

Bower-Watson Point insertion

  •  

15 of 98

Laplace Smoothing

 

16 of 98

Mesh Quality Parameters

  • Jacobian ratio>0.6
  • Aspect Ratio
  • Orthogonal Quality
  • Skewness
  • Parallel Deviation
  • Warping Factor/Angle
  • Maximum Corner Angle
  • Taper

17 of 98

FABRIC MODELLING

  • Simulate the draping problem.

18 of 98

STANDARD NURB

  •  

19 of 98

GENERALIZED NURB (GNURBS )

  •  

20 of 98

AFFINE TRANSFORMATIONS

  •  

21 of 98

CAT-MULL ROM SPLINES

Advantage

  • It will not form loop or self-intersection within a curve segment.
  • Cusp will never occur within a curve segment.
  • It follows the control points more tightly.

More commonly used in the litrature

22 of 98

OCTREE & MARCHING CUBES

  • To quickly calculate a volumetric property the volume had to be integrated using quadrature points.
  • These quadrature points were fixed and belonged to a fixed grid.
  • We had to perform a point membership classification query, using an octree.

23 of 98

FOR POINTS NEAR THE SURFACE

  • Simulating an Octree surface was done using marching cubes representation.

0

9

10

8

2

1

6

3

11

5

25

7

26

4

20

21

23

22

24

27

X

Y

Z

24 of 98

RESULTS

25 of 98

Lumped parameter Modelling

SIMULINK PROJECT

26 of 98

Free vibrations

  • The behaviour of an MAE was studied under free oscillations. The system was allowed to oscillate freely. This was compared to a simscape model system.

27 of 98

Forced vibrations

  • Output signal was isolated from the input signals

28 of 98

Conclusions

  1. The MAEs could be tuned to remove noise and isolate the output from the input.
  2. The equilibrium point can be adjusted by applying a magnetic field.
  3. The only limitations are saturation and the stability limits for MAEs which need to be tuned for the desired output range.

29 of 98

References

  • Pathak, P., Arora, N., & Rudykh, S. (2022). Magnetoelastic instabilities in soft laminates with ferromagnetic hyper elastic phases. International Journal of Mechanical Sciences, 213, 106862.
  • Bertoldi, K., & Gei, M. (2011). Instabilities in multilayered soft dielectrics. Journal of the Mechanics and Physics of Solids, 59(1), 18-42.
  • Rudykh, S., & Debotton, G. (2011). Stability of anisotropic electroactive polymers with application to layered media. Zeitschrift für angewandte Mathematik und Physik, 62(6), 1131-1142.
  • Galipeau, E. (2012). Non-linear homogenization of magnetorheological elastomers at finite strain.
  • Rudykh, S., & Bertoldi, K. (2013). Stability of anisotropic magnetorheological elastomers in finite deformations: a micromechanical approach. Journal of the Mechanics and Physics of Solids, 61(4), 949-967.
  • Rudykh, S., Bhattacharya, K., & DeBotton, G. (2014). Multiscale instabilities in soft heterogeneous dielectric elastomers. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 470(2162), 20130618.
  • Goshkoderia, A., & Rudykh, S. (2017). Stability of magneto-active composites with periodic microstructures undergoing finite strains in the presence of a magnetic field. Composites Part B: Engineering, 128, 19-29.

30 of 98

Analysis of Microscopic Instabilities for Magneto-Active Elastomers (MAEs)

Parag Pathak

31 of 98

What are MAEs?

  • MAEs consist of magnetic particles, such as micron-size iron particles, dispersed in an elastomeric matrix. In our case, these are Fibers.
  • They can undergo large deformations when excited by a magnetic field.
  • Uses include tunable vibration absorbers, damping components , noise barrier system and sensors.

32 of 98

Transformations: Langrangian to Eulerian frame

Langraginan (Reference) configuration

 

 

 

 

 

 

Eulerian (Current) configuration

 

33 of 98

Eulerian Formulation

  •  

 

 

 

Eulerian (Current) configuration

34 of 98

Lagrangian Formulation

  •  

Langraginan (Reference) configuration

 

 

35 of 98

Stress-Energy Relation

  •  

36 of 98

Loading condition

  •  

 

 

 

MRE Sample

N

S

 

 

37 of 98

Transition point

 

 

38 of 98

Mesh deformation modelling

  • Main take way is the modelling of the displacement field and the deformation gradient.

39 of 98

CUDA optimization

FABRIC DRAPING

CS 750 HIGH PERFORMANCE COMPUTING – COURSE PROJECT

40 of 98

Contents

  • Draping Introduction
  • Blossom Polynomials
  • Problem definition and Inputs
  • Parallelized Reduction Algorithm
  • CUDA basics
  • Results
  • References

41 of 98

Draping

  • Draping of virtual characters is done using cloth simulation models.
  • The Fabric needs to be rendered and simulated in a time efficient manner.
  • CUDA optimization can help lower the time required to achieve this.
  • For maximum performance and process control, we choose programming language C++.

Yuksel, C., Kaldor, J. M., James, D. L., & Marschner, S. (2012). Stitch meshes for modeling knitted clothing with yarn-level detail. ACM Transactions on Graphics (TOG), 31(4), 1-12.

42 of 98

Rendering process

CAD model of the target

Target feature points

Grid of points for fabric

Physical simulation

Fabric geometry

Fully Rendered Fabric on Target

43 of 98

Our scope

  • Converting a grid of control points into a fabric geometry

Scope of project

Grid of points for fabric

Fabric geometry

44 of 98

B-Spline surface

45 of 98

Blossoming polynomials

46 of 98

Bi-variate Blossom : Quadratic Bspline

47 of 98

Tri-variate Blossom : Cubic Bspline

 

 

 

 

48 of 98

B-spline Construction

49 of 98

B-spline Construction

 

 

 

 

Blossom Construction

50 of 98

Surface blossoms

51 of 98

Grid of Control Points + u,v grid

 

 

52 of 98

Inputs

  •  

Grid of points for fabric

Fabric geometry

u, v coordinates

53 of 98

CUDA Intro

CUDA virtualizes the physical hardware into threads and blocks

Threads

  • Thread is a virtualized Scalar Processor

Blocks

  • Thread blocks is a virtualized Streaming multiprocessor.
  • Thread blocks need to be independent
  • They run to completion.
  • Order of blocks is undecided.

54 of 98

B-spline basis Construction

55 of 98

Thread(i,j): Across domain

  •  

56 of 98

Block(ib,jb) = 16 threads/ Per Block = 1 grid point (u,v)

  •  

 

57 of 98

 

58 of 98

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

59 of 98

Parallel Reduction: Sequential Addressing

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

60 of 98

Warps (Scheduling unit)

Each warp runs threads in a lock step fashion

61 of 98

Data transfer rates

62 of 98

63 of 98

Memory hierarchy

64 of 98

Code walk through

  • __Global__ function is called from the host and runs on the device.

  • * variables are for input and output.

  • __Shared variables are shared across the threads within a block.

65 of 98

Thread and Block IDs obtained

  • Thread ID i,j select the control points for each reduction operation.
  • Block ID ib,jb select the u,v grid co-ordinate.

66 of 98

Barriers an Thread Synchronization

  • __syncthreads ensures all threads within a block have reached here.
  • Used to prevent memory conflicts and race conditions from occurring.
  • Use atomic operations key words like and volatile, to prevent race conditions.

67 of 98

CUDA memory management.

  • Memory Allocation

  • Data transfer from host to device.

  • Data transfer from device to host.

68 of 98

69 of 98

70 of 98

71 of 98

72 of 98

73 of 98

Nsight : Visual Studio

74 of 98

Profiler

75 of 98

NVVP

76 of 98

NVVP

77 of 98

Results

Sample duration: (without yarn info)

  • Cuda time (ms)= 1.227840
  • Sequential time (ms) = 4.081682

  • Speed up factor :3.33
  • Tolerance<1e-4

78 of 98

CUDA streams for Asynchronous data transfer

79 of 98

References

CUDA

  • NVIDIA, GPU Programming Guide, Version 8.0.
  • http://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html
  • CS 759 Slides: High Performance Computing applications for Engineering
  • Jason Sanders and Edward Kandrot: CUDA by Example: An Introduction to General-Purpose GPU Programming, Addison-Wesley Professional, 2010
  • Lecture1.pdf (bu.edu)

Graphics

  • ME 535 slides : CAGD
  • Yuksel, C., Kaldor, J. M., James, D. L., & Marschner, S. (2012). Stitch meshes for modeling knitted clothing with yarn-level detail. ACM Transactions on Graphics (TOG)31(4), 1-12.

80 of 98

Turn Profile Creation �Algorithm

Co-ordinate Transform Method

81 of 98

Single sheet intersection method

  • Intersect a single sheet that passes through the turn axis with the body.
  • The body’s imprint on the plane is taken.
  • This imprint gives the turn profile of the body.
  • This method Works well for pure turn parts.

82 of 98

Multiple sheet Intersection method

In this method, the body is intersected with multiple sheets in the plane of the axis and body’s imprint on the planes are extracted.

83 of 98

Multiple sheet Intersection method

The imprints are dissected and a union operation is performed on the half sheet imprints.

84 of 98

Current issue with Multiple Plane Method�

85 of 98

Requirements of new approach

Following points need to be considered while developing the new approach.

  1. Performance.
  2. Mapping between turn profile/face and input body face.
  3. Success rate.
  4. Accuracy.
  5. Simple algorithm ( easy to understand and maintain).

86 of 98

Co-ordinate Transform Method on Cylinder

  •  

X

Z

Y

X

R

 

R

X

 

87 of 98

Transformation of Points

  •  

X

R

X

Z

Y

 

 

88 of 98

Transformation of Edge�

  •  

X

R

1

2

0

X

Z

Y

89 of 98

Transformation of Face

  • Each face is transformed to Cylindrical co-ordinates
  • Consider the Boundary edges (BE) and the inflection edges (IE).
  • Get R maximum and R minimum edges to get Turn Face.

 

u

v

X

R

X

R

X

Z

Y

 

BE

IE

BE

IE

BE

BE

BE

IE

90 of 98

ISRO work

Static and dynamic analysis

Modal analysis

91 of 98

Modal analysis

92 of 98

Failure identification

93 of 98

Displacement plots of component

94 of 98

KDTREE ALGORITHM

95 of 98

KD-TREE ASSIGNMENT

96 of 98

KD-TREE ASSIGNMENT

97 of 98

INPUTS

98 of 98

TRAVERSAL