By Tiantian Liu et al (SIGGRAPH 2017) Presented By Anirudh Ganesh

Slides:



Advertisements
Similar presentations
Bending, Breaking and Squishing Stuff Marq Singer Red Storm Entertainment
Advertisements

Constrained Dynamics Marq Singer
Instabilities of SVD Small eigenvalues -> m+ sensitive to small amounts of noise Small eigenvalues maybe indistinguishable from 0 Possible to remove small.
Modeling of Neo-Hookean Materials using FEM
Spacetime Constraints David Coyne Joe Ishikura. The challenge of kinematics Successful animation requires control, but looks real Traditional principles.
Integration Techniques
Aspects of Conditional Simulation and estimation of hydraulic conductivity in coastal aquifers" Luit Jan Slooten.
Notes Assignment questions… cs533d-winter-2005.
1cs533d-term Notes  Assignment 2 is up. 2cs533d-term Modern FEM  Galerkin framework (the most common)  Find vector space of functions that.
1cs533d-term Notes  Required reading: Baraff & Witkin, “Large steps in cloth animation”, SIGGRAPH’98 Grinspun et al., “Discrete shells”, SCA’03.
Nonlinearity Structural Mechanics Displacement-based Formulations.
Gradient Methods April Preview Background Steepest Descent Conjugate Gradient.
1 L-BFGS and Delayed Dynamical Systems Approach for Unconstrained Optimization Xiaohui XIE Supervisor: Dr. Hon Wah TAM.
Interactive Animation of Structured Deformable Objects Mathieu Desbrun Peter Schroder Alan Barr.
Ch. 7: Dynamics.
1 L-BFGS and Delayed Dynamical Systems Approach for Unconstrained Optimization Xiaohui XIE Supervisor: Dr. Hon Wah TAM.
Gradient Methods May Preview Background Steepest Descent Conjugate Gradient.
MANE 4240 & CIVL 4240 Introduction to Finite Elements
1cs533d-winter-2005 Notes  More reading on web site Baraff & Witkin’s classic cloth paper Grinspun et al. on bending Optional: Teran et al. on FVM in.
Modeling Fluid Phenomena -Vinay Bondhugula (25 th & 27 th April 2006)
Martin Burger Total Variation 1 Cetraro, September 2008 Numerical Schemes Wrap up approximate formulations of subgradient relation.
Linear Discriminant Functions Chapter 5 (Duda et al.)
Why Function Optimization ?
1cs533d-winter-2005 Notes  Assignment 2 instability - don’t worry about it right now  Please read D. Baraff, “Fast contact force computation for nonpenetrating.
READING QUIZ To write the equations of static equilibrium for a particle, it is necessary to apply ___. A) Newton’s law of gravitation B) Newton’s first.

ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
UT DALLAS Erik Jonsson School of Engineering & Computer Science FEARLESS engineering Stable Real-Time Deformations Authors: Matthias Muller, Julie Dorsey,
4.5 Solving Systems using Matrix Equations and Inverses.
Fitting a line to N data points – 1 If we use then a, b are not independent. To make a, b independent, compute: Then use: Intercept = optimally weighted.
Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Quasi-Newton Methods of Optimization Lecture 2. General Algorithm n A Baseline Scenario Algorithm U (Model algorithm for n- dimensional unconstrained.
2.1 – Linear and Quadratic Equations Linear Equations.
INTRO TO OPTIMIZATION MATH-415 Numerical Analysis 1.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
3.8B Solving Systems using Matrix Equations and Inverses.
Linear Discriminant Functions Chapter 5 (Duda et al.) CS479/679 Pattern Recognition Dr. George Bebis.
Physically-Based Motion Synthesis in Computer Graphics
CSCE 441: Computer Graphics Forward/Inverse kinematics
Manipulator Dynamics 1 Instructor: Jacob Rosen
Computational Optimization
Geometric Optimization via Composite Majorization
Warm-Up BC 3. |A|.
14. TMMC, Flat-Histogram and Wang-Landau Method
CS5321 Numerical Optimization
CS5321 Numerical Optimization
Solution of Equations by Iteration
Non-linear Least-Squares
For convex optimization
CSCE 441: Computer Graphics Forward/Inverse kinematics
Computers in Civil Engineering 53:081 Spring 2003
Chapter 10. Numerical Solutions of Nonlinear Systems of Equations
Advanced Computer Graphics Spring 2008
Structure from Motion with Non-linear Least Squares
Instructor :Dr. Aamer Iqbal Bhatti
Solving Quadratics Using Square Roots
INTERPOLASI.
Mathematical Solution of Non-linear equations : Newton Raphson method
Solving Simultaneous equations by the Graphical Method
Physically Based Modeling -Overview-
2.2: Graphing a linear equation
1.) What is the value of the discriminant?
By Naga Govindaraju UNC Chapel Hill
Section 3: Second Order Methods
Numerical Analysis – Solving Nonlinear Equations
Computer Animation Algorithms and Techniques
Structure from Motion with Non-linear Least Squares
Presentation transcript:

By Tiantian Liu et al (SIGGRAPH 2017) Presented By Anirudh Ganesh Quasi-Newton Methods for Real-time Simulation of Hyperelastic Materials By Tiantian Liu et al (SIGGRAPH 2017) Presented By Anirudh Ganesh

Motivation Real Time Simulation focused Contrast with Offline application Hence they want to create a fast enough method for real-time for hyper-elastic materials that is more generalizable than the existing methods

Existing Methods (Historic) Baraff and Witkin 1998 Cloth dynamics with Euler which it solved using 1 Newton iteration Goldenthal et al 2007 extention to simulate in-extensible cloth Touriner et al 2015 support for stiff materials robustly All the above use Newton’s Method hence cannot be run in real time

Existing Methods (Modern) PBD gives a superfast solution for softbody simulation Position based dynamics, Muller at al 2007 Unified particle physics for real-time applications, Macklin et al 2014 Fast simulation, but material property degrades over iterations

Existing Work (Projective Dynamics) Fast Simulation of Mass-Spring Systems, Liu et al 2013 Shape-Up: Shaping Discrete Geometry with Projections, Bouazis et al 2014 ADMM ⊇ Projective Dynamics: Fast Simulation of General Constitutive Models, Narain et al 2016

Existing Work (Chebyshev Methods) Huamin Wang. 2015. A Chebyshev semi-iterative approach for accelerating projective and position-based dynamics. Huamin Wang and Yin Yang. 2016. Descent Methods for Elastic Body Simulation on the GPU. ACM Transactions on Graphics (SIGGRAPH Asia). Can be seen as a Quasi Newton method

Quasi Newton Method For a traditional newton method, Compute gradient Compute Hessian Step is then computed using inverse of Hessian times the gradient For a quasi newton method, Instead of using Hessian, we try to approximate it using a spd matrix.

Projective Dynamics Projective Dynamics Energy is defined as Ei(x) = min pi∈Mi E˜ i(x, pi), E˜ i(x, z) = kGix − zk 2 F Then the total energy is E(x) = X i wiEi(x), When trying to minimize it, we can get the solution as x ∗ = (M/h2 + L) −1 (Jp + My/h2 )

Limitations of Projective Dynamics Energy needs to be in quadratic distance form. This is not the case in most hyper-elastic material. For eg, Neo Hookian, Co- Rotated linear elasticity or Kirchoff cannot be represented as a quadratic distance.

Proposed Solution Approximate p in terms of x so that it becomes function of x Then take gradient of it using chain rule ∇g(x) = 1 h2 M(x − y) + Lx − Jp(x) Jacobian is 0 for Projective Dynamics kind of energy. So replacing this in Newton’s equation yields, (M/h2 +L) −1∇g(x) = x − (M/h2 +L) −1 (Jp(x) +My/h2 ) Which can be solved as x* = −(M/h2 + L) −1∇g(x)

Generalizing the proposed solution In last step we assumed J is 0, but this is only true for Projective Dynamics style of Energy. In order to generalize we bring it in Valanis-Landel form then we approximate the stiffness of the material as the slope of best linear approximation of f(σ1) = ∂Ψ / ∂σ1 σ2=1,σ3=1 = a’ 0 (σ1) + 2b’ 0 (σ1) + c’ 0 (σ1) Also in projective dynamics the line search parameter is always 1, but this also needs to be generalised. In order to do this, they perform a backtracking line search starting from 2 and dividing it by 2 each iteration till it converges.

Results https://www.youtube.com/watch?v=7o3g-rG1qYg

Convergence Rates (compared to Chebyshev)

Convergence Rate (comparison of various L BFGS settings)

Convergence (compared to other methods)