• No results found

Wave Propagation Models Using Large-Scale Convex Optimization

N/A
N/A
Protected

Academic year: 2021

Share "Wave Propagation Models Using Large-Scale Convex Optimization"

Copied!
14
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Identification of Black-Box

Wave Propagation Models Using Large-Scale Convex Optimization

Toon van Waterschoot

1

, Moritz Diehl

1

, Marc Moonen

1

, and Geert Leus

2

1Dept. ESAT-SCD, KU Leuven, Belgium

2Faculty EEMCS, TU Delft, The Netherlands

SYSID 2012 – July 2012, Brussels, Belgium

(2)

Outline

•  Introduction and Motivation

•  Identification of Black-Box Wave Propagation Models

•  Simulation Results

•  Conclusion

2

(3)

Introduction and Motivation (1)

•  Wave propagation in 3-D enclosures

•  Input-output relation given by wave equation

+ boundary conditions in spatiotemporal domain

•  Assumption 1: = superposition of M point sources alternative input-output relation using Green’s function

•  Assumption 2: wave field measured at J observer positions wave propagation = MIMO-LTI system

Problem under study

(4)

Introduction and Motivation (2)

•  Useful for prediction, simulation, deconvolution

•  Black-box model: common-denominator pole-zero model (related to “assumed modes solution” of wave equation)

+ linear estimation problem (for ARX model)

– structural information on wave equation hardly exploited

•  Grey-box model: parametrization of pole-zero model in terms of resonance frequencies and damping factors

+ structural information on wave equation largely exploited – nonlinear estimation problem

Parametric models for wave propagation

4

(5)

Introduction and Motivation (3)

•  Goal: incorporate structural information on wave equation while keeping estimation problem simple to solve (convex)

•  Key ingredients:

–  representation of structural information on wave equation using numerical rather than analytical solution to wave equation

finite element method (FEM)

–  exploitation of structure and sparsity in FEM representation for formulation of related estimation problem

large-scale convex optimization

•  Result: increased model accuracy at selected frequencies (e.g., resonance frequencies)

Main contribution

(6)

Identification of Black-Box

Wave Propagation Models (1)

•  M point sources (inputs) at positions

•  J observers (outputs) at positions

•  data set:

•  model:

•  parameter vector :

Problem statement

6

(7)

Identification of Black-Box

Wave Propagation Models (2)

•  frequency domain data model:

•  least squares (LS) frequency domain criterion:

•  equivalent QP formulation:

Data-based identification [Verboven et al. ‘04]

(8)

Identification of Black-Box

Wave Propagation Models (3)

•  incorporation of structural information requires to:

1.  discretize wave equation in space and time

2.  rewrite wave equation in terms of pole-zero model parameter vector

•  Main result:

–  spatiotemporal → spatiospectral domain (Helmholtz equation) –  substitute black-box model + exploit common denominator

–  define FEM grid (think of increasing number of observers J → K) –  define extended parameter vector

–  apply FEM to obtain set of linear equations (“Galerkin equations”) –  rewrite Galerkin equations in terms of extended parameter vector

•  is sparse & highly structured matrix, depending on FEM grid, FEM basis functions, point source positions, and source spectra

Hybrid identification

8

(9)

Identification of Black-Box

Wave Propagation Models (4)

•  proposed hybrid identification method:

with selection matrix C defined such that

•  large-scale equality-constrained QP:

–  data-based objective in terms of original parameter vector

–  equality constraints in terms of extended parameter vector are used

Hybrid identification

(10)

Identification of Black-Box

Wave Propagation Models (5)

•  depends on point source positioning matrix

•  contains barycentric point source coordinates relative to FEM grid sparse, nonnegative, columns sum up to 1

•  if initial estimate of pole-zero model denominator’s frequency response function is available, the Galerkin equations can be rewritten in terms of and

•  can then be estimated by solving a sparse

approximation problem with additional structural constraints

What if point source positions are unknown?

data term

Galerkin equations sparsity and

structural constraints 10

(11)

•  application: indoor acoustic wave propagation

•  scenario: m room, sources, sensors

Simulation results (1)

Simulation scenario

(12)

•  data set: samples,

•  model order:

•  FEM mesh: 315 grid points, 1152 tetrahedral elements

Simulation results (2)

Simulation parameters

12

(13)

•  comparison of inverse denominator frequency magnitude response obtained using different methods

•  (4

th

resonance frequency)

•  (4

th

,1

st

resonance freq.)

Simulation results (3)

Simulation results

exact source positioning matrix estimated source positioning matrix

(14)

•  Novel approach to identification of MIMO-LTI wave

propagation models having common-denominator pole- zero parametrization

•  Traditional data-based identification can be improved by incorporating physical wave propagation model

•  FEM discretization yields high-dimensional, sparse, and structured linear set of equations that can be imposed at frequencies where high model accuracy is desired

•  Proposed hybrid identification approach consists in

sequentially solving two large-scale convex optimization problems:

•  sparse approximation problem for estimating point source positioning matrix appear in FEM Galerkin equations

•  equality-constrained QP for estimating common-denominator pole-zero model parameters

Conclusion

14

Referenties

GERELATEERDE DOCUMENTEN

The analysis of our algorithm uses properties of the entropic barrier, mixing times for hit-and-run random walks by Lov´ asz and Vempala [Foundations of Computer Science,

In this article, instead of offering a comprehensive overview of algorithms under different low-rank decomposition models or particular types of constraints, we provide a unified

Table IV provides a comparison of the mean estimated error, mean value of cardinality of prototype vectors (PV or SV, denoted in Table IV by SV) and a comparison of the mean run

In Section II we introduce the convex feasibility problem that we want to solve, we provide new reformulations of this problem as separable optimization problems, so that we can

Analogous to Gauss-Newton and Rayleigh quotient iteration for one matrix, the new Rayleigh quotient method estimates one common root only and should be provided with good

The paper is organized as follows. In Section 2 we formulate the separable convex problem followed by a brief description of some of the existing decomposition methods for this

Analogous to Newton-Raphson and Rayleigh quotient iteration for one matrix, the new Rayleigh quotient method estimates one common root only and should be provided with good

Examples are the corrected item-total correlation (Nunnally, 1978, p. 281), which quantifies how well the item correlates with the sum score on the other items in the test;