Computational Solutions of Helmholtz Equation Yau Shu Wong Department of Mathematical & Statistical Sciences University of Alberta Edmonton, Alberta, Canada.

Slides:

Advertisements

Similar presentations

Parallel Jacobi Algorithm Steven Dong Applied Mathematics.

Advertisements

1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.

Applied Linear Algebra - in honor of Hans SchneiderMay 25, 2010 A Look-Back Technique of Restart for the GMRES(m) Method Akira IMAKURA † Tomohiro SOGABE.

MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA

Geometric (Classical) MultiGrid. Hierarchy of graphs Apply grids in all scales: 2x2, 4x4, …, n 1/2 xn 1/2 Coarsening Interpolate and relax Solve the large.

July 11, 2006 Comparison of Exact and Approximate Adjoint for Aerodynamic Shape Optimization ICCFD 4 July 10-14, 2006, Ghent Giampietro Carpentieri and.

The Finite Element Method Defined

Rayan Alsemmeri Amseena Mansoor. LINEAR SYSTEMS Jacobi method is used to solve linear systems of the form Ax=b, where A is the square and invertible.

Iterative Methods and QR Factorization Lecture 5 Alessandra Nardi Thanks to Prof. Jacob White, Suvranu De, Deepak Ramaswamy, Michal Rewienski, and Karen.

Aspects of Conditional Simulation and estimation of hydraulic conductivity in coastal aquifers" Luit Jan Slooten.

Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.

The Improved 3D Matlab_based FDFD Model and Its Application Qiuzhao Dong(NU), Carey Rapapport(NU) (contact: This.

An Optimal Nearly-Analytic Discrete Method for 2D Acoustic and Elastic Wave Equations Dinghui Yang Depart. of Math., Tsinghua University Joint with Dr.

Shawn Sickel A Comparison of some Iterative Methods in Scientific Computing.

Avoiding Communication in Sparse Iterative Solvers Erin Carson Nick Knight CS294, Fall 2011.

1/36 Gridless Method for Solving Moving Boundary Problems Wang Hong Department of Mathematical Information Technology University of Jyväskyklä

CS240A: Conjugate Gradients and the Model Problem.

Iterative Solvers for Coupled Fluid-Solid Scattering Jan Mandel Work presentation Center for Aerospace Structures University of Colorado at Boulder October.

Why Function Optimization ?

Finite Difference Time Domain Method (FDTD)

PETE 603 Lecture Session #29 Thursday, 7/29/ Iterative Solution Methods Older methods, such as PSOR, and LSOR require user supplied iteration.

Numerical methods for PDEs PDEs are mathematical models for –Physical Phenomena Heat transfer Wave motion.

ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.

Example: Introduction to Krylov Subspace Methods DEF: Krylov sequence

Applications of the 3D electromagnetic model to some challenging optical problems September 24, 2004 Xiuhong wei, Paul Urbach, Arther Wachters Supported.

Finite Differences Finite Difference Approximations  Simple geophysical partial differential equations  Finite differences - definitions  Finite-difference.

Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.

Finite element modeling of the electric field for geophysical application Trofimuk Institute of Petroleum Geology and Geophysics SB RAS Shtabel Nadezhda,

Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.

C M C C Centro Euro-Mediterraneo per i Cambiamenti Climatici COSMO General Meeting - September 8th, 2009 COSMO WG 2 - CDC 1 An implicit solver based on.

Finite Element Method.

1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 31.

C GasparAdvances in Numerical Algorithms, Graz, Fast interpolation techniques and meshless methods Csaba Gáspár Széchenyi István University, Department.

Periodic Boundary Conditions in Comsol

Mathematical foundationsModern Seismology – Data processing and inversion 1 Some basic maths for seismic data processing and inverse problems (Refreshement.

1 Incorporating Iterative Refinement with Sparse Cholesky April 2007 Doron Pearl.

Elliptic PDEs and the Finite Difference Method

1 Marijn Bartel Schreuders Supervisor: Dr. Ir. M.B. Van Gijzen Date:Monday, 24 February 2014.

Parallel Solution of the Poisson Problem Using MPI

CS240A: Conjugate Gradients and the Model Problem.

On implicit-factorization block preconditioners Sue Dollar 1,2, Nick Gould 3, Wil Schilders 2,4 and Andy Wathen 1 1 Oxford University Computing Laboratory,

Computation of the complete acoustic field with Finite-Differences algorithms. Adan Garriga Carlos Spa Vicente López Forum Acusticum Budapest31/08/2005.

Lecture 21-22: Sound Waves in Fluids Sound in ideal fluid Sound in real fluid. Attenuation of the sound waves 1.

Discretization for PDEs Chunfang Chen,Danny Thorne Adam Zornes, Deng Li CS 521 Feb., 9,2006.

Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.

F. Fairag, H Tawfiq and M. Al-Shahrani Department of Math & Stat Department of Mathematics and Statistics, KFUPM. Nov 6, 2013 Preconditioning Technique.

2D Complex-Valued Eikonal Equation Peijia Liu Department of Mathematics The University of Texas at Austin.

The Application of the Multigrid Method in a Nonhydrostatic Atmospheric Model Shu-hua Chen MMM/NCAR.

Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.

Finite Element Method. History Application Consider the two point boundary value problem.

MA5233 Lecture 6 Krylov Subspaces and Conjugate Gradients Wayne M. Lawton Department of Mathematics National University of Singapore 2 Science Drive 2.

Programming assignment # 3 Numerical Methods for PDEs Spring 2007 Jim E. Jones.

Multipole-Based Preconditioners for Sparse Linear Systems. Ananth Grama Purdue University. Supported by the National Science Foundation.

Conjugate gradient iteration One matrix-vector multiplication per iteration Two vector dot products per iteration Four n-vectors of working storage x 0.

The Landscape of Sparse Ax=b Solvers Direct A = LU Iterative y’ = Ay Non- symmetric Symmetric positive definite More RobustLess Storage More Robust More.

EEE 431 Computational Methods in Electrodynamics

Introduction to Diffraction Tomography

Convergence in Computational Science

A Comparison of some Iterative Methods in Scientific Computing

Scientific Computing Lab

Conjugate Gradient Method

Convergence in Numerical Science

Linear Algebra Lecture 3.

Numerical Analysis Lecture13.

6.5 Taylor Series Linearization

Finite Difference Method for Poisson Equation

Numerical Linear Algebra

Systems of Equations Solve by Graphing.

Chapter 2 A Survey of Simple Methods and Tools

Atilla Ozgur Cakmak, PhD

Presentation transcript:

Computational Solutions of Helmholtz Equation Yau Shu Wong Department of Mathematical & Statistical Sciences University of Alberta Edmonton, Alberta, Canada

MD-11

Noise radiation from NACA 0012 airfoil at zero incidence

Sound radiation from a jet pipe Near field pressure at 1623 Hz at 0.45 Mach number

Wave Equation: where For a time - periodic solution, Helmholtz Equation: orin homogeneous media

K denotes the wave number, it is related to the frequency of the wave propagation The wavelength The number of points per wavelength

Discretization Boundary condition Solution of the resulting system of equations Computational methods for Helmholtz Equation Problem: high frequency, large wave number and short wave

Finite-difference method: Exact solution Hence, Discretization

Sixth-order Compact Finite Difference: Recall

New Finite Differene – Lambe, Luczak & Nehrbass Taylor’s expansion: Recall:

2D Helmholtz equation: Finite Difference: New Finite Difference:

Boundary condition: Radiation condition Absorption condition Damping Layer Perfectly Matched Layer

Noise radiation in turbofan

Radiation boundary condition: Finite Difference: New Finite Difference: Uniqueness of numerical solutions using new finite difference schemes for the 1D and 2D problems.

Solution of system of linear equations: The matrix A is usually large, non-diagonally dominant, indefinite and with complex coefficients The system is very ill-conditioned Solution methods: Direct: Gaussian elimination Iterative: Conjugate Gradient, bi-CG, CGS, preconditioning, multi-grid, GMRES Direct: Iterative:

Generalized Minimum Residual (GMRES) is a Krylov subspace method, compute an approximate solution from the space GMRES algorithm ensures that the residual has a minimal 2-norm.

GMRES algorithm Matrix-vector Full GMRES GMRES(m)

m=5 m=1 m=50 m=100

K=20,kh=0.625 ResidualError

Numerical Simulations: Elliptic BVP:

Numerical wave number: 1D Helmholtz equation

1D Problem, h = 0.01

1D Problem, k = 50

2D Helmholtz equation Exact solution Let

Concluding Remarks: Solving Helmholtz equation numerically is a difficult task for large wave numbers The effects on discretization, boundary conditions and linear solver are reported For 1D problem, exact solution can be computed For 2D and 3D problems, more works and new ideas are needed

Thank You!