@presentation {peters2017SINBADFaaj,
	title = {Algorithms and Julia software for FWI with multiple constraints},
	year = {2017},
	publisher = {SINBAD},
	abstract = {We present a framework to add multiple convex and non-convex constraints to nonlinear inverse problems, specifically FWI. The constraints mitigate problems related to noisy data, artifacts arising from working with very few simultaneous sources, inaccurate starting models and using approximate physical forward models. Compared to earlier work at SLIM, the current framework is algorithmically simpler and computationally more efficient. We show examples where the model estimation is improved when we use very limited prior knowledge directly as constraints. We also present the software implementation in Julia and how it is used together with other software that compute data-misfit values and gradients w.r.t. the model parameters.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/peters2017SINBADFaaj/peters2017SINBADFaaj.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/peters2017SINBADFaaj/peters2017SINBADFaaj.m4v},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {wang2017SINBADFnra,
	title = {Noise robust and time-domain formulations of Wavefield Reconstruction Inversion},
	year = {2017},
	publisher = {SINBAD},
	abstract = {We propose a wave-equation-based subsurface inversion method that in many cases is more robust than conventional Full-Waveform Inversion. The new formulation is written in a denoising form that allows the synthetic data to match the observed ones up to a small error. Compared to regular Full-Waveform Inversion, our method treats the noise arising from the data meassuring/recording process and that from the synthetic modelling process separately. Compared to Wavefields Reconstruction Inversion, the new formulation mitigates the difficulty of choosing the penalty parameter λ. To solve the proposed optimization problem, we develop an efficient frequency domain algorithm that alternatively updates the model and the data. Numerical experiments confirm strong stability of the proposed method by comparisons between the results of our algorithm with that from both plain FWI and a weighted formulation of the FWI. We also discuss a new memory efficient time-domain formulation for Wavefield Reconstruction Inversion based on duality.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/wang2017SINBADFnra/wang2017SINBADFnra.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/wang2017SINBADFnra/wang2017SINBADFnra.mov},
	author = {Rongrong Wang and Mathias Louboutin and Bas Peters and Emmanouil Daskalakis and Felix J. Herrmann}
}
@presentation {herrmann2016SINBADFcvp,
	title = {Constraints versus penalties for edge-preserving full-waveform inversion},
	year = {2016},
	publisher = {SINBAD},
	abstract = {Full-waveform inversion is challenging in complex geological areas. Even when provided with an accurate starting model, the inversion algorithms often struggle to update the velocity model. Contrary to other areas in applied geophysics, including prior information in full-waveform inversion is still relatively in its infancy. In part this is due to the fact that incorporating prior information that relates to geological settings where strong discontinuities in the velocity model dominate is difficult, because these settings call for non-smooth regularizations. We tackle this problem by including constraints on the spatial variations and value ranges of the inverted velocities, as opposed to adding penalties to the objective as is more customary in main stream geophysical inversion. By demonstrating the lack of predictability of edge-preserving inversion when the regularization is in the form of an added penalty term, we advocate the inclusion of constraints instead. Our examples show that the latter lead to more predictable results and to significant improvements in the delineation of Salt bodies. This is joint work with Bas Peters.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/herrmann2016SINBADFcvp/herrmann2016SINBADFcvp.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/herrmann2016SINBADFcvp/herrmann2016SINBADFcvp.mov},
	author = {Felix J. Herrmann and Bas Peters}
}
@presentation {peters2016SINBADFcnc,
	title = {Convex \& non-convex constraint sets for full-waveform inversion},
	year = {2016},
	publisher = {SINBAD},
	abstract = {We extend some of our previous work on constrained formulations of full-waveform inversion. Some motivating examples illustrate why solving constrained problems directly is a simpler approach for solving non-linear inverse problems than penalized problem formulations. So far we used constraints which can be represented as convex sets, for which most optimization theory is developed. Some non-convex counterparts of convex sets are introduced and examples show that the algorithms developed for convex sets also work well with non-convex sets. The motivation to also explore non-convex sets, is that they sometimes translate prior geological knowledge into mathematical constraints in a more direct way. All presented material is available as a user-friendly toolbox. The toolbox works with any code which can provide a data-misfit function value and a gradient direction.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/peters2016SINBADFcnc/peters2016SINBADFcnc.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/peters2016SINBADFcnc/peters2016SINBADFcnc.mov},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {gorman2016SINBADFopp,
	title = {Open Performance portablE SeismiC Imaging{\textendash}-OPESCI},
	year = {2016},
	publisher = {SINBAD},
	abstract = {In this project, we introduce OPESCI-FD, a Python package built on symbolic mathematics to automatically generate Finite Difference models from a high-level description of the model equations. We investigate applying this framework to generate the propagator program used in seismic imaging. We implement the 3D acoustic and anisotropic FD scheme as an example and demonstrate the advantages of usability, flexibility and accuracy of the framework. The design of OPESCI-FD aims to allow rapid development, analysis and optimisation of Finite Difference programs. OPESCI-FD is the foundation for continuing development by the OPESCI project team, building on the research presented in this report. This talk concludes by reviewing the further developments that are already under way, as well as the scope for extension to cater for other equations and numerical schemes. This joint work with SINBAD and SENAI CIMATEC and has received additional funding from Intel.},
	keywords = {Presentation, private, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/gorman2016SINBADFopp/gorman2016SINBADFopp.pdf},
	url2 = {https://slim.gatech.edu/Publications/Private/Conferences/SINBAD/2016/Fall/gorman2016SINBADFopp/gorman2016SINBADFopp.mov},
	author = {Gerard Gorman and Marcos de Aguiar and David Ham and Felix J. Herrmann and Paul H. J. Kelly and Navjot Kukreja and Michael Lange and Mathias Louboutin and Fabio Luporini and Paulius Velesko and Vincenzo Pandolfo and Felippe Vieira Zacarias}
}
@presentation {peters2015SINBADF3dw,
	title = {3D WRI},
	year = {2015},
	publisher = {SINBAD},
	abstract = {The Wavefield Reconstruction Inversion (WRI) approach to seismic inversion is a topic of active research in the SLIM group. Several variants have been proposed, all of which rely on the solution of a linear least-squares problem with a Helmholtz discretization. While algorithms based on LU or QR factorization are very efficient for 2D problems, 3D problems required the development of a factorization-free iterative method. This talk introduces the current version of the algorithm, which requires significantly less memory and computation and uses existing Helmholtz solvers as an important building block. We plan to discuss early results of 3-D WRI on a small 3-D synthetic example.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADF3dw/peters2015SINBADF3dw.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADF3dw/peters2015SINBADF3dw.mov},
	author = {Bas Peters and Chen Greif and Felix J. Herrmann}
}
@presentation {peters2015SINBADFqpf,
	title = {A quadratic-penalty full-space method for waveform inversion},
	year = {2015},
	publisher = {SINBAD},
	abstract = {In PDE-constrained optimization problems other than geophysical full-waveform inversion, full-space optimization methods are commonly used. This type of optimization method updates both the medium parameters and the wavefields, instead of solving wave equations explicitly. In the FWI context, this means the objective function value and gradient can be obtained at very little computational cost. A major obstacle is, however, the requirement to have all wavefields in memory.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADFqpf/peters2015SINBADFqpf.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADFqpf/peters2015SINBADFqpf.mov},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {dasilva2015SINBADrii,
	title = {Recent improvements to the 2/3{\textemdash}D imaging \& inversion algorithms in the SLIM software release},
	year = {2015},
	publisher = {SINBAD},
	abstract = {The SLIM software release contains algorithms for frequency domain 2D imaging and inversion based on direct LU and QR factorizations. Recent improvments include significant speedups, by utilizing the latest parallel direct factorization algorithms and inversion strategies which solve for each frequency on its corresponding grid. The iterative Helmholtz solvers available in the software release are now also applicable to 2D problems, extending the 2D algorithms to very large \& high frequency 2D imaging and inversion.},
	keywords = {Presentation, SINBAD, SINBADSPRING2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Spring/dasilva2015SINBADrii/dasilva2015SINBADrii.pdf},
	author = {Curt Da Silva and Bas Peters and Felix J. Herrmann}
}
@presentation {peters2015SINBADrwi,
	title = {Regularizing waveform inversion by projections onto convex sets},
	year = {2015},
	publisher = {SINBAD},
	abstract = {A framework is proposed for regularizing the waveform inversion problem by projections onto intersections of convex sets. Multiple pieces of prior information about the geology are represented by multiple convex sets, for example limits on the velocity or minimum smoothness conditions on the model. The data-misfit is then minimized, such that the estimated model is always in the intersection of the convex sets. Therefore, it is clear what properties the estimated model will have at each iteration. This approach does not require any quadratic penalties to be used and thus avoids the known problems and limitations of those types of penalties. It is shown that by formulating waveform inversion as a constrained problem, regularization ideas such as Tikhonov regularization and gradient filtering can be incorporated into one framework. The algorithm is generally applicable, in the sense that it works with any (differentiable) objective function and does not require significant additional computation. The method is demonstrated on the inversion of the 2D marine isotropic elastic synthetic seismic benchmark by Chevron using an acoustic modeling code. To highlight the effect of the projections, we apply no data pre-processing.},
	keywords = {Presentation, SINBAD, SINBADSPRING2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Spring/peters2015SINBADrwi/peters2015SINBADrwi.pdf},
	author = {Bas Peters and Brendan R. Smithyman and Felix J. Herrmann}
}
@presentation {peters2015SINBADFrwi,
	title = {Regularizing waveform inversion by projections onto intersections of convex sets},
	year = {2015},
	publisher = {SINBAD},
	abstract = {Common strategies to regularize waveform inversion (and other geophysical inverse problems) are adding quadratic penalty terms to the objective function or filtering the gradients used to update the model estimate. An example are penalties or filters to prevent/filter spurious high spatial frequency oscillations in the model while working with low frequency data. We present an alternative way of regularization, which works by projecting the model onto an intersection of convex sets, where each sets encodes certain desired model properties. This approach has certain theoretical and practical advantages over quadratic penalties or gradient filters. Some examples of useful convex sets in various challenging waveform inversion settings are shown on both real and synthetic data.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADFrwi/peters2015SINBADFrwi.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADFrwi/peters2015SINBADFrwi.mov},
	author = {Bas Peters and Brendan R. Smithyman and Mathias Louboutin and Felix J. Herrmann}
}
@presentation {dasilva2015SINBADFsss,
	title = {Scaling SINBAD software to 3-D on Yemoja},
	year = {2015},
	publisher = {SINBAD},
	abstract = {We present early results on the scalability of SINBAD{\textquoteright}s wavefield reconstruction and wave-equation based inversion technologies on Yemoja, a 17k core cluster made available to us by BG Group at SENAI CIMATEC Supercomputing Centre in Brazil.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/dasilva2015SINBADFsss/dasilva2015SINBADFsss.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/dasilva2015SINBADFsss/dasilva2015SINBADFsss.mov},
	author = {Curt Da Silva and Haneet Wason and Mathias Louboutin and Bas Peters and Shashin Sharan and Zhilong Fang and Felix J. Herrmann}
}
@presentation {peters2015SINBADswr,
	title = {Solving WRI{\textquoteright}s data-augmented wave equation in 3D},
	year = {2015},
	publisher = {SINBAD},
	abstract = {The Wavefield Reconstruction Inversion (WRI) approach to seismic inversion is a topic of active research in the SLIM group. Several variants have been proposed, all of which rely on the solution of a linear least-squares problem with a Helmholtz discretization. While algorithms based on LU or QR factorization are very efficient for 2D problems, 3D problems required the development of a factorization-free iterative method. This talk introduces the current version of the algorithm, which requires significantly less memory and computation then a few months ago and uses existing Helmholtz solvers as an important building block.},
	keywords = {Presentation, SINBAD, SINBADSPRING2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Spring/peters2015SINBADswr/peters2015SINBADswr.pdf},
	author = {Bas Peters and Chen Greif and Felix J. Herrmann}
}
@presentation {fang2015SINBADFwri,
	title = {Wavefield-reconstruction inversion with source estimation and minimum smoothness constraint {\textendash} application to the Chevron 2014 dataset},
	year = {2015},
	publisher = {SINBAD},
	abstract = {We present a robust wavefield reconstruction inversion with source estimation. The source wavelet is estimated with the reconstruction of wavefield simultaneously by solving an extended data-augmented problem. We apply this method to the 2014 Chevron synthetic blind test dataset and show the robustness of our method.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/fang2015SINBADFwri/fang2015SINBADFwri.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/fang2015SINBADFwri/fang2015SINBADFwri.mov},
	author = {Zhilong Fang and Bas Peters and Felix J. Herrmann}
}
@presentation {petrenko2014SINBADaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	year = {2014},
	publisher = {SINBAD},
	abstract = {An implementation of seismic wave simulation on a platform consisting of a conventional host processor and a reconfigurable hardware accelerator is presented. This research is important in the field of exploration for oil and gas resources, where a 3D model of the subsurface is frequently required. By comparing seismic data collected in a real-world survey with synthetic data generated by simulated waves, it is possible to deduce such a model. However this requires many time-consuming simulations with different Earth models to find the one that best fits the measured data. Speeding up the wave simulations would allow more models to be tried, yielding a more accurate estimate of the subsurface. The reconfigurable hardware accelerator employed in this work is a field programmable gate array (FPGA). FPGAs are computer chips that consist of electronic building blocks that the user can configure and reconfigure to represent their algorithm in hardware. Whereas a traditional processor can be viewed as a pipeline for processing instructions, an FPGA is a pipeline for processing data. The chief advantage of the FPGA is that all the instructions in the algorithm are already hardwired onto the chip. This means that execution time depends only on the amount of data to be processed, and not on the complexity of the algorithm. The main contribution is an implementation of the well-known Kaczmarz row projection algorithm on the FPGA, using techniques of dataflow programming. This kernel is used as the preconditioning step of CGMN, a modified version of the conjugate gradients method that is used to solve the time-harmonic acoustic isotropic constant density wave equation. Using one FPGA accelerator, the current implementation allows seismic wave simulations to be performed over twice as fast, compared to running on one Intel Xeon E5-2670 core. I also discuss the effect of modifications of the algorithm necessitated by the hardware on the convergence properties of CGMN. Finally, a specific plan for future work is set-out in order to fully exploit the accelerator platform, and my work is set in its larger context},
	keywords = {Presentation, SINBAD, SINBADSPRING2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Spring/petrenko2014SINBADaih/petrenko2014SINBADaih.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Diego Oriato and Simon Tilbury and Felix J. Herrmann}
}
@presentation {peters2014SINBADcda,
	title = {Challenges and developments arising from 2D FWI of a land VSP dataset in the Permian Basin},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Full-waveform inversion was carried out to map 3D velocity structures for a site in the Permian Basin of Texas, USA. The data come from co-located surface and 3D VSP seismic surveys that share common source vibration points. This challenging on-land setting has been used as a testbed to evaluate our FWI algorithms and their effectiveness when applied to real-data problems. We discuss the challenges posed by this case study, and several new techniques and methodological refinements that have been developed and tested as a result. These include: regularization and incorporation of multiple datasets in an on-land FWI workflow; restrictions on the types of models allowed (viz., smoothness regularization) by quadratic penalty and by Projected Quasi-Newton (PQN) inversion; corrections to enable 2D FWI and recovery of 3D models; the state of ongoing work in WRI ({\textquoteleft}{\textquoteleft}Penalty Method{\textquoteright}{\textquoteright} inversion) and the handling of anisotropy.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/peters2014SINBADcda/peters2014SINBADcda.pdf},
	author = {Brendan R. Smithyman and Bas Peters and Felix J. Herrmann}
}
@presentation {peters2014SINBADiss,
	title = {Iterative solution strategy for least-squares problem with a PDE-block},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Waveform inversion using the Wavefield Reconstruction Inversion (WRI) is a quadratic-penalty based method developed in our group and has shown to have advantages over the reduced Lagrangian based conventional FWI methods. WRI involves no explicit PDE solves, but a least-squares problem with a PDE block. This type of least-squares problem is very challenging to solve using iterative methods. In this talk we show algorithms we developed specifically for this application and which involve a combination of preconditioning, low-rank decomposition and deflation.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/peters2014SINBADiss/peters2014SINBADiss.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {peters2014SINBADmpw,
	title = {Multi-parameter waveform inversion; exploiting the structure of penalty-methods},
	year = {2014},
	publisher = {SINBAD},
	abstract = {In this talk I consider the problem of inverting waveforms for multiple medium parameters. The governing PDE is chosen to be the Helmholtz equation with compressibility and buoyancy as the unknowns. Both unknowns occur in the same equation and practice has shown it is very hard to estimate both equally accurate; the buoyancy estimate (or density if a slightly different parametrization is used) is typically much smoother than the compressibility (or velocity). Here I introduce a new waveform inversion algorithm: a full Newton-type method based on a penalty method which adds the PDE constraint as a quadratic penalty term. This method updates both the {\textquoteright}wavefields{\textquoteright} and medium parameters, without explicitly solving PDE{\textquoteright}s. One of the main advantages is the availability of a sparse Hessian and exact gradient which are not the result of any PDE solves. We asses if the availability of the Hessian, which includes information about the coupling between the two medium parameters, can help reconstruct both compressibility and buoyancy.},
	keywords = {Presentation, SINBAD, SINBADSPRING2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Spring/peters2014SINBADmpw/peters2014SINBADmpw.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {peters2014SINBADqpb,
	title = {Quadratic-penalty based full-space methods for waveform inversion},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Waveform inversion problems are commonly solved by eliminating the field variables. Full-space methods store and update the fields, rather than solving for them. This leads to a problem with nice properties, such as free function value evaluation and exact gradients and Hessians at no cost. The existing literature is almost exclusively based on the Lagrangian formulation. We propose to work with a quadratic penalty formulation, which allows us to reduce the storage requirements and gives the Newton system a favourable structure which we exploit to obtain a intrinsically parallel updating scheme for the fields and medium parameters. We will show a comparison with reduced-space methods.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/peters2014SINBADqpb/peters2014SINBADqpb.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {peters2014SINBADsmp,
	title = {Single- and multi-parameter WRI {\textendash}- synthetic examples},
	year = {2014},
	publisher = {SINBAD},
	abstract = {We demonstrate the performance of WRI on a number of single- and multi-parameter synthetic examples. The examples shot that WRI is less reliant on accurate starting models while this formulation is also conducive to multi-parameter inversion.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/peters2014SINBADsmp/peters2014SINBADsmp.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {fang2014SINBADsew,
	title = {Source estimation for WRI and its application},
	year = {2014},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/fang2014SINBADsew/fang2014SINBADsew.pdf},
	author = {Zhilong Fang and Xiang Li and Bas Peters and Felix J. Herrmann}
}
@presentation {petrenko2013SINBADaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Solution of the Helmholtz equation is the main computational burden of full-waveform inversion in the frequency domain. For this task we employ the CARP-CG algorithm (Gordon \& Gordon 2010), an iterative solver that preconditions the original Helmholtz system into an equivalent symmetric positive definite system and then applies the method of conjugate gradients. Forming the matrix for the new system is not necessary as its multiplicative action on a vector is implemented using a series of projections onto the rows of the original system. Our contribution is implementing CARP-CG for a host + accelerator (FPGA) computing environment. The computational paradigm is one of dataflow: vector and matrix elements are streamed from memory through the accelerator which applies the row projections. The advantage of an FPGA to process streams of data is that unless the algorithm is memory bandwidth limited, computation time is directly proportional to the amount of data. The complexity of the algorithm implemented on the FPGA is irrelevant since all the operations programmed onto the FPGA happen in the same clock tick. In contrast, on a CPU, more complex algorithms require more clock ticks as the instructions are executed sequentially, or with only a small amount of parallelism. Ongoing work porting the CARP-CG algorithm to the accelerator is presented.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/petrenko2013SINBADaih/petrenko2013SINBADaih.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Felix J. Herrmann and Diego Oriato and Simon Tilbury}
}
@presentation {peters2013SINBADepm,
	title = {Examples from the penalty-method},
	year = {2013},
	publisher = {SINBAD},
	abstract = {A novel penalty method for PDE-constrained optimization was recently proposed by van Leeuwen and Herrmann (2013). The conventional PDE-constrained optimization formulation used in seismic waveform inversion is based on calculating the gradient of the data misfit objective functional via the adjoint-state method, at the cost of two PDE solves. The penalty method requires only one solution of an overdetermined linear system, in the least-squares sense. In this talk some numerical properties of this linear system will be exposed. The penalty method for PDE-constrained optimization involves a parameter, balancing the data misfit and PDE-misfit parts of the objective functional. This talk will address how to select this very important parameter. Some examples will be shown in which the penalty method outperforms the conventional method in non-linear waveform inversion, as well as linearized seismic imaging by migration.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/peters2013SINBADepm/peters2013SINBADepm.pdf},
	author = {Bas Peters and Tristan van Leeuwen and Felix J. Herrmann}
}
@presentation {wang2013SINBADnru,
	title = {Noise reduction by using interferometric measurements},
	year = {2013},
	publisher = {SINBAD},
	abstract = {The interferometric formulation of linear wave-based inversion problem was proposed by Demanet and Jugnon recently. Instead of directly fitting the data, they proposed to fit a subset of the data{\textquoteright}s cross-correlation. It can be verified that if the full cross-correlation is used, then the problem is equivalent to the usual least square problem. The subsampling, which is usually considered to cause instability to the solution, is surprisingly useful in this setting. Numerical experiments for the inverse source problem and the inverse scatting problem have both suggested that a {\textquoteright}good{\textquoteright} sampling strategy can actually increase the stability under modeling error caused by the uncertainty of a kinetic nature. We will study the mathematical mechanism behind this phenomenon, and try to see whether or not there exists a universally {\textquoteright}good{\textquoteright} sampling strategy independent of the types of forward operators we use.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/wang2013SINBADnru/wang2013SINBADnru.pdf},
	author = {Rongrong Wang and Bas Peters and Felix J. Herrmann}
}
@presentation {pong2013SINBADppg,
	title = {The proximal-proximal gradient algorithm},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In many applications, one has to minimize the sum of a smooth loss function modeling misfit and a regularization term inducing structures. In this talk, we consider the case when the regularization is a composition of a convex function, whose proximal mapping is easy to compute, and a nonzero linear map. Such instances arise in system identification and realization problems. In this talk, we present a new algorithm, the proximal-proximal gradient algorithm, which admits easy subproblems. Our algorithm reduces to the proximal gradient algorithm if the linear map is just the identity map, and can be viewed as "very inexact" inexact proximal gradient algorithm. We show that the whole sequence generated from the algorithm converges to an optimal solution, and establish an upper bound on iteration complexity.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/pong2013SINBADppg/pong2013SINBADppg.pdf},
	author = {Ting Kei Pong and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {vanleeuwen2013SINBADsda,
	title = {Solving the data-augmented wave equation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {The recently proposed penalty method promises to mitigate some of the non-linearity inherent in full-waveform inversion by relaxing the requirement that the wave-equation needs to be solved exactly. The basic workflow of this new method is as follows; i) solve an overdetermined wave-equation (the data-augmented wave-equation), where the data serves as additional constraints for the wavefields, ii) compute the wavefield-residual by substituting this wavefield in the wave-equation, and iii) correlate the wavefield with the wavefield-residual to obtain a model-update. As opposed to the conventional workflow, no explicit adjoint solve is needed to compute the model-update. However, instead of solving a wave-equation, we need to solve a data-augmented wave-equation. In this talk we explore some of the challenges of solving this data-augmented wave-equation and review some possible solution strategies for both time and frequency-domain applications.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/vanleeuwen2013SINBADsda/vanleeuwen2013SINBADsda.pdf},
	author = {Tristan van Leeuwen and Bas Peters and Felix J. Herrmann}
}
@presentation {fang2013SINBADsfwi,
	title = {Swift FWI},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In 3D case, there is much more data and modeling is much more expensive. As a result, parallel computing is very important for 3D full-waveform inversion. Both domain decomposition and data decomposition need a large number of parallel computing resources. However, programs based on parallel MATLAB suffer from the limitation of licenses. In order to obtain a MATLAB licenses free solution, we use SWIFT, which is a fast and easy parallel scripting language. Once the original Mat file is complied to an executable file, SWIFT can run the code inside the executable file in parallel without using parallel MATLAB. We use the SWIFT to compute the object functions and gradients of different shots in parallel, and test the parallel 3D FWI code with overthrust data. This is joint work with Thomas Lai, Harsh Juneja, Bas Peters.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/fang2013SINBADsfwi/fang2013SINBADsfwi.pdf},
	author = {Zhilong Fang and Henryk Modzelewski and Tristan van Leeuwen and Thomas Lai and Harsh Juneja and Bas Peters and Felix J. Herrmann}
}
@presentation {petrenko2012SINBADcarp,
	title = {CARP-CG: a computational study},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Forward modelling of the wave equation is a key ingredient in seismic full waveform inversion (FWI). Simulation in the time domain and solution of the wave equation in the frequency domain are two competing approaches to modelling. Frequency domain approaches can further be categorized as using either direct or iterative solvers. For 3D FWI, iterative solvers in the frequency domain are attractive, partly because they require less memory than the other methods. This is due to the fact that there is no need to store the wavefield at each time step, or compute a factorization of the Helmholtz operator that will not be as sparse as the original matrix. One iterative solver that has been applied to the Helmholtz equation is CARP-CG. CARP-CG uses Kaczmarz row projections for each block of a domain decomposition scheme to precondition the Helmholtz system into being symmetric and positive semidefinite. The method of conjugate gradients is then used to solve the preconditioned system. We present a comparison of the performance of CARP-CG implemented in several languages (MATLAB, C, FORTRAN, julia) and in two different hardware environments: the LIMA HPC cluster hosted at UBC, and the Checkers cluster which is part of the Westgrid consortium. Parallelization of the algorithm via domain decomposition implemented with MPI (distributed memory) and OMP (shared memory) is also examined.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/petrenko2012SINBADcarp/petrenko2012SINBADcarp_pres.pdf},
	author = {Art Petrenko}
}
@presentation {peters2012SINBADfde,
	title = {Frequency domain 3D elastic wave propagation in general anisotropic media},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Elastic wave propagation in 3 spatial dimensions is modeled using a wave equation containing the full stiffness tensor consisting of 21 independent components. This allows modeling in general anisotropic media. The wave equation is discretized on several Cartesian and rotated Cartesian staggered finite-difference grids (using a 2nd order approximation). The grids are linearly combined and, in combination with a antilumped mass strategy, minimize numerical dispersion while requiring a low number of grid points per wavelength. In case not all 21 components need to be modeled, an approximation of the stiffness tensor can be used (e.g., orthorhombic anisotropy, TTI, ...). This results in a linear system of equations, which is solved using an iterative method. The modeling of all 21 components of the stiffness tensor (or an approximation) enables the development of new waveform inversion functionalities.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/peters2012SINBADfde/peters2012SINBADfde_pres.pdf},
	author = {Bas Peters}
}
@presentation {pacteau2010SINBADkpo,
	title = {Kronecker product optimization in SPOT},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/pacteau2010SINBADkpo/pacteau2010SINBADkpo_pres.pdf},
	author = {Sebastien Pacteau}
}
