@unpublished {park2026IMAGEnoa,
	title = {Neural Operators with Accurate Jacobian for High-Fidelity Image-Domain Seismic Inversion},
	year = {2026},
	month = {3},
	abstract = {Neural operators (NOs) provide efficient surrogates for wave-equation-based imaging operators, but accurate forward prediction alone does not guarantee reliable inversion. As inversion updates depend on the adjoint Jacobian, errors in learned sensitivities lead to unphysical updates and degraded quality in recovered models. To this end, we propose a Jacobian-informed training strategy that enforces accuracy in Jacobian in the directions where gradient descent occurs during Least-Squares. Numerical experiments with Fourier Neural Operators demonstrate that supervising only a small fraction ($0.1 \sim 0.01\%$) of Jacobian information significantly improves gradient quality and leads to more accurate subsurface velocity reconstruction. In particular, the proposed approach reduces mid to deep layer artifacts and improves structural continuity compared to models trained only with forward misfit term. These results highlight that learning inversion-relevant sensitivities, rather than forward mappings alone, is critical for reliable surrogate-assisted seismic inversion.},
	keywords = {deep learning, derivative-informed, Fisher-information, FNO, IMAGE, Imaging, Inverse problems, reduced-order modeling, RTM, SEG, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Submitted/2026/park2026IMAGEnoa/abstract.html},
	url2 = {https://slim.gatech.edu/Publications/Public/Submitted/2026/park2026IMAGEnoa/IMAGE_Jayjay.pdf},
	author = {Jeongjin Park and Huseyin Tuna Erdinc and Grant Bruer and Richard Rex and Nisha Chandramoorthy and Felix J. Herrmann}
}
@conference {park2025ML4SEISMICftn,
	title = {Fisher-Informed Training of Neural Operators for Reliable PDE Inversion},
	booktitle = {ML4SEISMIC Partners Meeting},
	year = {2025},
	month = {11},
	abstract = {Neural operators have shown strong performance for PDE-solution learning; however, their effectiveness in PDE-constrained optimization, such as inversion, remains limited, in part because inaccurately learned derivatives can mislead gradient-based updates. Standard training typically optimizes only the forward least-squares fit, so during iterative inversion the optimization variable can drift outside the training distribution, further degrading quality of derivative information and inversion performance. To address this limitation, we propose a training algorithm designed for inversion: the surrogate is trained not only to predict forward outputs but also to learn observation-relevant gradients, which leads to Fisher-information directed parameter updates. We evaluate forward and gradient accuracy, as well as the inversion trajectory, on problems governed by PDEs{\textemdash}Darcy flow and laminar (incompressible) Navier{\textendash}Stokes{\textemdash}which are relevant to porous-media fluid flow and energy-storage applications. Our results suggest that training for gradient fidelity with forward accuracy unlocks a pathway to reliable, efficient, neural operator{\textendash}based inversion.},
	keywords = {deep learning, derivatve-informed, Fisher-information, FNO, GCS, Inverse problems, ML4SEISMIC, permeability, reduced-order modeling, reservoir simulation, SLIM, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ML4SEISMIC/2025/park2025ML4SEISMICftn},
	author = {Jeongjin Park and Grant Bruer and Huseyin Tuna Erdinc and Richard Rex Arockiasamy and Nisha Chandramoorthy and Felix J. Herrmann}
}
@conference {park2025IMAGErdn,
	title = {A reduced-order derivative-informed neural operator for subsurface fluid-flow},
	booktitle = {International Meeting for Applied Geoscience and Energy},
	year = {2025},
	month = {8},
	keywords = {deep learning, derivatve-informed, Fisher-information, FNO, GCS, IMAGE, Inverse problems, permeability, reduced-order modeling, reservoir simulation, SEG, Uncertainty quantification},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2025/park2025IMAGErdn/IMAGE_Jayjay.pdf},
	author = {Jeongjin Park and Grant Bruer and Huseyin Tuna Erdinc and Abhinav Prakash Gahlot and Felix J. Herrmann}
}
@conference {park2025ML4SEISMICvmb,
	title = {Velocity Model Building with Jacobian-Informed Neural Operators},
	booktitle = {ML4SEISMIC Partners Meeting},
	year = {2025},
	month = {11},
	keywords = {deep learning, derivatve-informed, FNO, GCS, Inverse problems, ML4SEISMIC, permeability, reduced-order modeling, SLIM, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ML4SEISMIC/2025/park2025ML4SEISMICvmb},
	author = {Jeongjin Park and Huseyin Tuna Erdinc and Felix J. Herrmann}
}
@article {orozco2023invnet,
	title = {InvertibleNetworks.jl: A Julia package for scalable normalizing flows},
	journal = {Journal of Open Source Software},
	volume = {9},
	year = {2024},
	month = {7},
	abstract = {InvertibleNetworks.jl is a Julia package designed for the scalable implementation of normalizing flows, a method for density estimation and sampling in high-dimensional distributions. This package excels in memory efficiency by leveraging the inherent invertibility of normalizing flows, which significantly reduces memory requirements during backpropagation compared to existing normalizing flow packages that rely on automatic differentiation frameworks. InvertibleNetworks.jl has been adapted for diverse applications, including seismic imaging, medical imaging, and CO2 monitoring, demonstrating its effectiveness in learning high-dimensional distributions.},
	keywords = {Bayesian inference, computing, conditional normalizing flows, deep learning, HPC, Inverse problems, memory, Normalizing flows, software, Uncertainty quantification},
	doi = {10.21105/joss.06554},
	url = {https://doi.org/10.21105/joss.06554},
	author = {Rafael Orozco and Philipp A. Witte and Mathias Louboutin and Ali Siahkoohi and Gabrio Rizzuti and Bas Peters and Felix J. Herrmann}
}
@presentation {park2024ML4SEISMICpbi,
	title = {Physical Bayesian Inference for Two-Phase Flow Problems},
	year = {2024},
	month = {11},
	abstract = {Previous research on surrogate modeling of multiphase flow systems has shown that even models with low generalization error in forward predictions can generate posterior estimates that are out of distribution and physically unrealistic. To address this, we propose a regularization method that leverages the Fisher Information Matrix (FIM) to guide the training process. By integrating the FIM into a differentiable optimization framework, we aim to improve the reliability of surrogate models, such as Fourier Neural Operators (FNO), for both forward predictions and posterior inference. Our experiments on benchmark problems, including the Lorenz-63 system and Navier-Stokes equations, demonstrate that our approach significantly enhances physical consistency throughout time evolution, keeping predictions within the correct spatial distribution. Looking ahead, we plan to extend our framework to more complex applications, such as Geological Carbon Storage, with an emphasis on scaling FIM computations for high-dimensional problems.},
	keywords = {Bayesian inference, deep learning, Fisher Information Matrix, FNO, Inverse problems, ML4SEISMIC, SLIM, two-phase flow, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ML4SEISMIC/2024/park2024ML4SEISMICpbi},
	author = {Jeongjin Park and Huseyin Tuna Erdinc and Haoyun Li and Richard Rex and Nisha Chandramoorthy and Felix J. Herrmann}
}
@conference {witte2021JULIACONmedlj,
	title = {InvertibleNetworks.jl - Memory efficient deep learning in Julia},
	booktitle = {JuliaCon},
	year = {2021},
	note = {(JuliaCon, virtual)},
	month = {07},
	abstract = {We present InvertibleNetworks.jl, an open-source package for invertible neural networks and normalizing flows using memory-efficient backpropagation. InvertibleNetworks.jl uses manually implement gradients to take advantage of the invertibility of building blocks, which allows for scaling to large-scale problem sizes. We present the architecture and features of the library and demonstrate its application to a variety of problems ranging from loop unrolling to uncertainty quantification.},
	keywords = {deep learning, Invertible network, Julia, Normalizing flows, segmentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/JuliaCon/2021/witte2021JULIACONmedlj/witte2021JULIACONmedlj.pdf},
	url2 = {https://www.youtube.com/watch?v=9M-zEGHY4i4},
	author = {Philipp A. Witte and Mathias Louboutin and Ali Siahkoohi and Gabrio Rizzuti and Bas Peters and Felix J. Herrmann}
}
@article {peters2019aos,
	title = {Algorithms and software for projections onto intersections of convex and non-convex sets with applications to inverse problems},
	journal = {arXiv e-prints},
	year = {2019},
	note = {(arXiv)},
	month = {03},
	abstract = {We propose algorithms and software for computing projections onto the intersection of multiple convex and non-convex constraint sets. The software package, called SetIntersectionProjection, is intended for the regularization of inverse problems in physical parameter estimation and image processing. The primary design criterion is working with multiple sets, which allows us to solve inverse problems with multiple pieces of prior knowledge. Our algorithms outperform the well known Dykstra{\textquoteright}s algorithm when individual sets are not easy to project onto because we exploit similarities between constraint sets. Other design choices that make the software fast and practical to use, include recently developed automatic selection methods for auxiliary algorithm parameters, fine and coarse grained parallelism, and a multilevel acceleration scheme. We provide implementation details and examples that show how the software can be used to regularize inverse problems. Results show that we benefit from working with all available prior information and are not limited to one or two regularizers because of algorithmic, computational, or hyper-parameter selection issues.},
	keywords = {algorithm, software},
	url = {http://arxiv.org/abs/1902.09699},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {peters2019SIAMGEOgmrip,
	title = {Generalized Minkowski sets for the regularization of inverse problems},
	booktitle = {SIAM Conference on Mathematical and Computational Issues in the Geosciences},
	year = {2019},
	note = {(SIAM)},
	month = {05},
	abstract = {We present a new algorithm to compute projections onto the intersection of constraint sets, designed particularly for multiple sets because we exploit similarities between constraint sets. When we do not know projections onto the individual sets in closed form, as is the case for total-variation constraints, our algorithm does not need other optimization algorithms to solve sub-problems. This a significant advantage in terms of computational cost and number of tuning parameters and stopping conditions, compared to classical algorithms to compute projections onto the intersection, such as Dykstra{\textquoteright}s algorithm. The proposed algorithm is suitable for problems with a large number of model parameters such as full-waveform inversion because it exploits coarse and fine-grained parallelism, and we also present a multilevel accelerated version. The corresponding software is open-source and implemented in Julia. We present strategies to use projections onto multiple constraints to regularize full-waveform inversion for models with salt domes or sedimentary geology.},
	keywords = {Intersections, Inverse problems, Minkowski set, Projections, Sets},
	url = {https://www.pathlms.com/siam/courses/11267/sections/14618/video_presentations/128671},
	url2 = {https://meetings.siam.org/sess/dsp_talk.cfm?p=97656},
	author = {Bas Peters and Felix J. Herrmann}
}
@article {peters2019gms,
	title = {Generalized Minkowski sets for the regularization of inverse problems},
	journal = {arXiv e-prints},
	year = {2019},
	note = {(arXiv)},
	month = {03},
	abstract = {Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive model descriptions for regularization lead to better imaging results. These include cartoon-texture decomposition, morphological component analysis, and robust principal component analysis; methods that typically rely on penalty functions. We propose a regularization framework, based on the Minkowski set, that merges the strengths of additive models and constrained formulations. We generalize the Minkowski set, such that the model parameters are the sum of two components, each of which is constrained to an intersection of sets. Furthermore, the sum of the components is also an element of another intersection of sets. These generalizations allow us to include multiple pieces of prior knowledge on each of the components, as well as on the sum of components, which is necessary to ensure physical feasibility of partial-differential-equation based parameters estimation problems. We derive the projection operation onto the generalized Minkowski sets and construct an algorithm based on the alternating direction method of multipliers. We illustrate how we benefit from using more prior knowledge in the form of the generalized Minkowski set using seismic waveform inversion and video background-anomaly separation.},
	keywords = {inverse},
	url = {http://arxiv.org/abs/1903.03942},
	author = {Bas Peters and Felix J. Herrmann}
}
@mastersthesis {peters2019THiso,
	title = {Intersections and sums of sets for the regularization of inverse problems},
	year = {2019},
	note = {(PhD)},
	month = {05},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {Inverse problems in the imaging sciences encompass a variety of applications. The primary problem of interest is the identification of physical parameters from observed data that come from experiments governed by partial-differential-equations. The secondary type of imaging problems attempts to reconstruct images and video that are corrupted by, for example, noise, subsampling, blur, or saturation. The quality of the solution of an inverse problem is sensitive to issues such as noise and missing entries in the data. The non-convex seismic full-waveform inversion problem suffers from parasitic local minima that lead to wrong solutions that may look realistic even for noiseless data. To meet some of these challenges, I propose solution strategies that constrain the model parameters at every iteration to help guide the inversion. To arrive at this goal, I present new practical workflows, algorithms, and software, that avoid manual tuning-parameters and that allow us to incorporate multiple pieces of prior knowledge. Opposed to penalty methods, I avoid balancing the influence of multiple pieces of prior knowledge by working with intersections of constraint sets. I explore and present advantages of constraints for imaging. Because the resulting problems are often non-trivial to solve, especially on large 3D grids, I introduce faster algorithms, dedicated to computing projections onto intersections of multiple sets. To connect prior knowledge more directly to problem formulations, I also combine ideas from additive models, such as cartoon-texture decomposition and robust principal component analysis, with intersections of multiple constraint sets for the regularization of inverse problems. The result is an extension of the concept of a Minkowski set. Examples from non-unique physical parameter estimation problems show that constraints in combination with projection methods provide control over the model properties at every iteration. This can lead to improved results when the constraints are carefully relaxed.},
	keywords = {FWI, Optimization, PhD, regularization, Sets},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2019/peters2019THiso/peters2019THiso.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2019/peters2019THiso/peters2019THiso_pres.pdf},
	author = {Bas Peters}
}
@conference {peters2019SEGans,
	title = {A numerical solver for least-squares sub-problems in 3D wavefield reconstruction inversion and related problem formulations},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2019},
	note = {(SEG, San Antonio)},
	month = {09},
	pages = {1536-1540},
	abstract = {Recent years saw a surge of interest in seismic waveform inversion approaches based on quadratic-penalty or augmented-Lagrangian methods, including Wavefield Reconstruction Inversion. These methods typically need to solve a least-squares sub-problem that contains a discretization of the Helmholtz equation. Memory requirements for direct solvers are often prohibitively large in three dimensions, and this limited the examples in the literature to two dimensions. We present an algorithm that uses iterative Helmholtz solvers as a black-box to solve the least-squares problem corresponding to 3D grids. This algorithm enables Wavefield Reconstruction Inversion and related formulations, in three dimensions. Our new algorithm also includes a root-finding method to convert a penalty into a constraint on the data-misfit without additional computational cost, by reusing precomputed quantities. Numerical experiments show that the cost of parallel communication and other computations are small compared to the main cost of solving one Helmholtz problem per source and one per receiver.},
	keywords = {Full-waveform inversion, least-squares, numerical linear algebra, penalty method, quadratic constraints, root finding, SEG},
	doi = {10.1190/segam2019-3216638.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2019/peters2019SEGans/peters2019SEGans.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2019/peters2019SEGans/peters2019SEGans_pres.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {peters2018CMSWMissrip,
	title = {Intersections and sums of sets for the regularization of inverse problems},
	booktitle = {Canadian Mathematical Society Winter Meeting},
	year = {2018},
	note = {(CMSWM)},
	month = {12},
	abstract = {We present new algorithms to compute projections onto the intersection of constraint sets. We focus on problems with multiple sets for which there is no simple and closed-form projection. Different from more classical methods such as Dykstra{\textquoteright}s algorithm, we do not need other algorithms to solve sub-problems. Our algorithms are based on the alternating direction method of multipliers and apply to models/images/video on small 2D and large 3D grids because we exploit computational similarity between constraint sets, coarse and fine-grained parallelism, and we also present a multilevel accelerated version. To obtain more flexible descriptions of prior knowledge, we introduce a formulation that allows constraint sets to be the sum of intersections of sets, which is essentially an extension of a Minkowski set. This formulation builds on the success of additive image descriptions that are usually based on penalty methods, such as cartoon-texture decomposition and robust principal component analysis. We show applications where we use multiple constraint sets to regularize partial-differential-equation based parameter estimation problems such as seismic waveform inversion, as well as various image and video processing and segmentation tasks.},
	keywords = {Intersections, Inverse problems, Projections, Sets},
	url = {https://cms.math.ca/Events/winter18/abs/ipi$\#$bp},
	author = {Bas Peters and Felix J. Herrmann}
}
@article {peters2018pmf,
	title = {Projection methods and applications for seismic nonlinear inverse problems with multiple constraints},
	journal = {Geophysics},
	volume = {84},
	number = {2},
	year = {2018},
	note = {(Geophysics)},
	month = {02},
	pages = {R251-R269},
	abstract = {Nonlinear inverse problems are often hampered by non-uniqueness and local minima because of missing low frequencies and far offsets in the data, lack of access to good starting models, noise, and modeling errors. A well-known approach to counter these deficiencies is to include prior information on the unknown model, which regularizes the inverse problem. While conventional regularization methods have resulted in enormous progress in ill-posed (geophysical) inverse problems, challenges remain when the prior information consists of multiple pieces. To handle this situation, we propose an optimization framework that allows us to add multiple pieces of prior information in the form of constraints. Compared to additive regularization penalties, constraints have a number of advantages making them more suitable for inverse problems such as full-waveform inversion. The proposed framework is rigorous because it offers assurances that multiple constraints are imposed uniquely at each iteration, irrespective of the order in which they are invoked. To project onto the intersection of multiple sets uniquely, we employ Dykstra{\textquoteright}s algorithm that scales to large problems and does not rely on trade-off parameters. In that sense, our approach differs substantially from approaches such as Tikhonov regularization, penalty methods, and gradient filtering. None of these offer assurances, which makes them less suitable to full-waveform inversion where unrealistic intermediate results effectively derail the iterative inversion process. By working with intersections of sets, we keep expensive objective and gradient calculations unaltered, separate from projections, and we also avoid trade-off parameters. These features allow for easy integration into existing code bases. In addition to more predictable behavior, working with constraints also allows for heuristics where we built up the complexity of the model gradually by relaxing the constraints. This strategy helps to avoid convergence to local minima that represent unrealistic models. We illustrate this unique feature with examples of varying complexity.},
	keywords = {constraints, Full-waveform inversion, intersection, Optimization, projection, regularization},
	doi = {10.1190/geo2018-0192.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2018/peters2018pmf/peters2018pmf.html},
	author = {Bas Peters and Brendan R. Smithyman and Felix J. Herrmann}
}
@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}
}
@article {peters2016cvp,
	title = {Constraints versus penalties for edge-preserving full-waveform inversion},
	journal = {The Leading Edge},
	volume = {36},
	number = {1},
	year = {2017},
	note = {(The Leading Edge)},
	month = {01},
	pages = {94-100},
	abstract = {Full-waveform inversion is challenging in complex geologic areas. Even when provided with an accurate starting model, the inversion algorithms often struggle to update the velocity model. Compared with other areas in applied geophysics, including prior information in full-waveform inversion is still in its relative infancy. In part, this is due to the fact that it is difficult to incorporate prior information that relates to geologic settings where strong discontinuities in the velocity model dominate, because these settings call for nonsmooth 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, which is more customary in mainstream 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 leads to more predictable results and to significant improvements in the delineation of salt bodies when these constraints are relaxed gradually in combination with extending the search space to approximately fit the observed data but not the noise.},
	keywords = {algorithm, full waveform inversion, noise, Optimization, penalty methods, salt dome, total variation},
	doi = {10.1190/tle36010094.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2016/peters2016cvp/peters2016cvp.html},
	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}
}
@conference {herrmann2016SEGWScvp,
	title = {Constraints versus penalties for edge-preserving full-waveform inversion},
	booktitle = {SEG Workshop on Where are we heading with FWI; Dallas},
	year = {2016},
	note = {(SEG Workshop, Dallas)},
	month = {10},
	abstract = {Full-waveform inversion is arguably one of the most challenging inverse problems out there. For this reason, it is remarkable that so much progress has been made over the years. While we can look back with confidence at an increasing number of success stories, the application of full-waveform technologies to deeper targets and complex geologies remains challenging making it an expensive proposition. So far, efforts to overcome some of these challenges have mainly been directed towards extended formulations such as Symes{\textquoteright}s and Biondi{\textquoteright}s subsurface offset/rau-parameters, Mike Warner/Lluis Guasch{\textquoteright}s Wiener filters in their adaptive full-waveform inversion, and van Leeuwen/Herrmann{\textquoteright}s Wavefield Reconstruction Inversion, where the wave-equation appears as a least-squares term in the objective. While this recent work {\textendash}- including other approaches such as different data-misfit objective functions {\textendash}- has removed some of FWI cycle-skip issues it does, with the exception perhaps of box constraints, not incorporate rudimentary information on the geology on the unknown model. Following recent work by Ernie Esser, we present a general framework how to incorporate this type of information in the form of constraints. Contrary to Tikhonov-like regularization or gradient filtering, imposing constraints has several key advantages, namely (i) they can be expressed in simple human understandable terms such as lower and upper limits for the velocity without the necessity to introduce additional parameters and assumptions on the probability distribution of the model; (ii) they can consist of several constraints, e.g. box and smoothness constraints, as long as their intersection in non-empty; and (iii) they can be imposed in a separate inner loop, which does not affect gradients and Hessians of full-waveform inversion itself. By means of examples, we will demonstrate the advocacy of constrained formulations as they apply to full-waveform inversion. This is joint work with Bas Peters.},
	keywords = {Full-waveform inversion, SEG, workshop},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/herrmann2016SEGWScvp/herrmann2016SEGWScvp_pres.pdf},
	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}
}
@conference {lange2016dtg,
	title = {Devito: Towards a generic finite difference DSL using symbolic python},
	booktitle = {6th Workshop on Python for High-Performance and Scientific Computing},
	year = {2016},
	note = {(PyHPC, Utah)},
	month = {11},
	pages = {67-75},
	abstract = {Domain specific languages (DSL) have been used in a variety of fields to express complex scientific problems in a concise manner and provide automated performance optimization for a range of computational architectures. As such DSLs provide a powerful mechanism to speed up scientific Python computation that goes beyond traditional vectorization and pre-compilation approaches, while allowing domain scientists to build applications within the comforts of the Python software ecosystem. In this paper we present Devito, a new finite difference DSL that provides optimized stencil computation from high-level problem specifications based on symbolic Python expressions. We demonstrate Devito{\textquoteright}s symbolic API and performance advantages over traditional Python acceleration methods before highlighting its use in the scientific context of seismic inversion problems.},
	keywords = {acoustic, finite differences, HPC, inversion, Modelling, python, software optimization},
	doi = {10.1109/PyHPC.2016.9},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/PyHPC/2016/lange2016dtg/lange2016dtg.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/PyHPC/2016/lange2016dtg/lange2016dtg_pres.pdf},
	author = {Michael Lange and Navjot Kukreja and Mathias Louboutin and Fabio Luporini and Felippe Vieira Zacarias and Vincenzo Pandolfo and Paulius Velesko and Paulius Kazakas and Gerard Gorman}
}
@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}
}
@conference {peters2016SEGprs,
	title = {Parallel reformulation of the sequential adjoint-state method},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2016},
	note = {(SEG, Dallas)},
	month = {10},
	pages = {1411-1415},
	abstract = {This abstract is about reducing the total computation time to solve full-waveform inversion problems. A common problem formulation is a nonlinear least-squares problem where the gradient is computed using the adjoint-state algorithm. This formulation offers parallelism for the computation of gradients for different sources and frequencies. The adjoint-state algorithm itself is sequential however and this is a limiting factor when a lot of compute nodes are available and only a few wavefields need to be computed. This situation occurs when stochastic optimization strategies are used to minimize the objective function. We present a parallel reformulation of the sequential adjoint-state algorithm, which allows the forward- and adjoint wavefields to be computed in parallel. Both algorithms are mathematically equivalent but the parallel version is twice as fast in run time. An important characteristic of the proposed algorithm is that one wavefield needs to be computed per source and one per receiver. These fields can be used to apply the (inverse) Gauss-Newton Hessian to a vector without recomputing wavefields. A 2D example shows that good full-waveform inversion results are obtained, even when a small number of sources and receivers is used.},
	keywords = {FWI, numerical linear algebra, parallel computing, PDE-constrained optimization, SEG},
	doi = {10.1190/segam2016-13966771.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/peters2016SEGprs/peters2016SEGprs.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/peters2016SEGprs/peters2016SEGprs_pres.pdf},
	author = {Bas Peters and Tristan van Leeuwen and Felix J. Herrmann}
}
@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}
}
@conference {peters2015PRECONasl,
	title = {An algorithm for solving least-squares problems with a Helmholtz block and multiple right-hand-sides},
	booktitle = {International Conference On Preconditioning Techniques For Scientific And Industrial Applications},
	year = {2015},
	note = {(PRECON, The Netherlands)},
	month = {06},
	keywords = {CGMN, Helmholtz, least-squares, matrix-free, randomized linear algebra},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/PRECON/2015/peters2015PRECONasl/peters2015PRECONasl_pres.pdf},
	author = {Bas Peters and Chen Greif and Felix J. Herrmann}
}
@conference {smithyman2015EAGEcwi,
	title = {Constrained waveform inversion of colocated VSP and surface seismic data},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2015},
	note = {(EAGE, Madrid)},
	month = {06},
	abstract = {Constrained Full-Waveform Inversion (FWI) is applied to produce a high-resolution velocity model from both Vertical Seismic Profiling (VSP) and surface seismic data. The case study comes from the Permian Basin in Texas, USA. This dataset motivates and tests several new developments in methodology that enable recovery of model results that sit within multiple a priori constraint sets. These constraints are imposed through a Projected Quasi-Newton (PQN) approach, wherein the projection set is the intersection of physical property bounds and anisotropic wavenumber filtering. This enables the method to recover geologically-reasonable models while preserving the fast model convergence offered by a quasi-Newton optimization scheme like l-BFGS. In the Permian Basin example, low-frequency data from both arrays are inverted together and regularized by this projection approach. Careful choice of the constraint sets is possible without requiring tradeoff parameters as in a quadratic penalty approach to regularization. Multiple 2D FWI results are combined to produce an interpolated 3D model that is consistent with the models from migration velocity analysis and VSP processing, while offering improved resolution and illumination of features from both datasets.},
	keywords = {EAGE, VSP, waveform inversion},
	doi = {10.3997/2214-4609.201412906},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/smithyman2015EAGEcwi/smithyman2015EAGEcwi.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/smithyman2015EAGEcwi/smithyman2015EAGEcwi_pres.pdf},
	author = {Brendan R. Smithyman and Bas Peters and Felix J. Herrmann}
}
@conference {peters2015SIAMmfq,
	title = {Matrix-free quadratic-penalty methods for PDE-constrained optimization},
	booktitle = {SIAM Conference on Computational Science and Engineering},
	year = {2015},
	note = {(SIAM, Salt Lake City)},
	month = {03},
	abstract = {The large scale of seismic waveform inversion makes matrix free implementations essential. We show how to exploit the quadratic penalty structure to construct matrix free reduced-space and full-space algorithms, which have some advantages over the commonly used Lagrangian based methods for PDE-constrained optimization. This includes the construction of effective and sparse Hessian approximations and reduced sensitivity to the initial guess. A computational bottleneck is the need to solve a large least squares problem with a PDE block. When direct solvers are not available, we propose a fast matrix free iterative approach with reasonable memory requirements. It takes advantage of the structure of the least squares problem with a combination of preconditioning, low rank decomposition and deflation.},
	keywords = {least-squares, low-rank, PDE-constrained optimization, quadratic-penalty, waveform inversion},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SIAM/2015/peters2015SIAMmfq/peters2015SIAMmfq.pdf},
	author = {Bas Peters and Felix J. Herrmann and Chen Greif}
}
@conference {herrmann2015SIAMpcf,
	title = {Pros and cons of full- and reduced-space methods for Wavefield Reconstruction Inversion},
	booktitle = {SIAM Conference on Mathematical and Computational Issues in the Geosciences},
	year = {2015},
	note = {(SIAM Conference on Mathematical and Computational Issues in the Geosciences, Stanford University, California)},
	month = {06-07},
	abstract = {By insisting on fitting observed data, Wavefield Reconstruction Inversion (WRI) is no longer cycle skipped and therefore less reliant on the accuracy of starting models. While extending the search space mitigates local minima, there are challenges scaling to 3D seismic when using reduced-space methods that require accurate solves. Conversely, full-space methods allow for inaccurate solves but require storage of all wavefields. We weigh pros and cons of these two approaches in the seismic context.},
	keywords = {FWI, SIAM, WRI},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SIAM/2015/herrmann2015SIAMpcf/herrmann2015SIAMpcf_pres.pdf},
	author = {Felix J. Herrmann and Bas Peters}
}
@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}
}
@techreport {peters2015EAGErwi,
	title = {Regularizing waveform inversion by projection onto intersections of convex sets},
	number = {TR-EOAS-2015-4},
	year = {2015},
	month = {01},
	institution = {UBC},
	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, several gradient and quasi-Newton based solvers and does not require significant additional computation. The method is demonstrated on the inversion of very noisy synthetic data and vertical seismic profiling field data.},
	keywords = {convex sets, regularization, waveform inversion},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2015/peters2015EAGErwi/peters2015EAGErwi.html},
	author = {Bas Peters and Brendan R. Smithyman 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}
}
@techreport {peters2015SEGrwi,
	title = {Regularizing waveform inversion by projections onto convex sets {\textendash}- application to the 2D Chevron 2014 synthetic blind-test dataset},
	number = {TR-EOAS-2015-7},
	year = {2015},
	month = {06},
	institution = {UBC},
	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 = {blind-test, projection, regularization, SEG, Wavefield Reconstruction Inversion, waveform inversion},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2015/peters2015SEGrwi/peters2015SEGrwi.html},
	author = {Bas Peters and Zhilong Fang and Brendan R. Smithyman and Felix J. Herrmann}
}
@conference {louboutin2015IIPFWIrwi,
	title = {Regularizing waveform inversion by projections onto convex sets},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	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. This is joint work with Bas Peters.},
	keywords = {convex, FWI, regularization},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/louboutin2015IIPFWIrwi/louboutin2015IIPFWIrwi_pres.pdf},
	author = {Mathias Louboutin and 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}
}
@conference {peters2015SEGWSsew,
	title = {Simultaneous estimation of wavefields and medium parameters - reduced-space versus full-space waveform inversion},
	booktitle = {SEG Workshop on The Limit of FWI in Subsurface Parameter Recovery; New Orleans},
	year = {2015},
	note = {(SEG, New Orleans)},
	month = {10},
	keywords = {full-space, PDE-constrained optimization, quadratic penalty method, SEG, waveform inversion, workshop},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2015/peters2015SEGWSsew/peters2015SEGWSsew_pres.pdf},
	author = {Bas Peters 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}
}
@conference {peters2015AIPwri,
	title = {Wavefield-reconstruction inversion},
	booktitle = {Conference on Applied Inverse Problems},
	year = {2015},
	note = {(AIP, Helsinki)},
	month = {05},
	abstract = {Wavefield Reconstruction Inversion is a method for PDE-constrained optimization, which revolves around the estimation of fields using the PDE as well as the observed data in a least-squares sense. The method is quadratic penalty based, which offers some interesting possibilities for the construction of algorithms, compared to the Lagrangian form. One of the main benefits of the method is when the initial guess is far from the global minimizer. Reduced-space and full-space algorithms are discussed, including illustrative examples. The method was developed with seismic applications in mind, but applies to other PDE-constrained optimization problems as well.},
	keywords = {AIP, Full-waveform inversion, Optimization, penalty method, Waveform reconstruction inversion},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/AIP/2015/peters2015AIPwri/peters2015AIPwri.pdf},
	author = {Bas Peters 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}
}
@mastersthesis {petrenko2014THaih,
	title = {Accelerating an iterative Helmholtz solver using reconfigurable hardware},
	year = {2014},
	note = {(MSc)},
	month = {04},
	school = {The University of British Columbia},
	type = {masters},
	address = {Vancouver},
	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 of the Earth 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-based 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 the work is set in its larger context.},
	keywords = {CG, CGMN, FPGA, Helmholtz, Kaczmarz, linear solver, Maxeler, MSc, thesis, wave equation},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2014/petrenko2014THaih/petrenko2014THaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2014/petrenko2014THaih/petrenko2014THaih_pres.pdf},
	author = {Art Petrenko}
}
@conference {petrenko2014EAGEaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {We implement the Kaczmarz row-projection algorithm (Kaczmarz (1937)) on a CPU host + FPGA accelerator platform using techniques of dataflow programming. This algorithm is then used as the preconditioning step in CGMN, a modified version of the conjugate gradients method (Bj{\"o}rck and Elfving (1979)) that we use to solve the time-harmonic acoustic isotropic constant density wave equation. Using one accelerator we achieve a speed-up of over 2{\texttimes} compared with one Intel core.},
	keywords = {CGMN, EAGE, FPGA, Helmholtz equation, Kaczmarz, reconfigurable computing},
	doi = {10.3997/2214-4609.20141141},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/petrenko2014EAGEaih/petrenko2014EAGEaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/petrenko2014EAGEaih/petrenko2014EAGEaih_pres.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Diego Oriato and Simon Tilbury and Felix J. Herrmann}
}
@conference {petrenko2014OGHPCaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	booktitle = {OGHPC},
	year = {2014},
	month = {03},
	abstract = {We implement the Kaczmarz row-projection algorithm [Kaczmarz, 1937] on a CPU host + FPGA accelerator platform using techniques of dataflow programming. This algorithm is then used as the preconditioning step in CGMN, a modified version of the conjugate gradients method [Bj?rck and Elfving, 1979] that we use to solve the time-harmonic acoustic isotropic constant density wave equation.},
	keywords = {CGMN, FPGA, Helmholtz equation, Kaczmarz, OGHPC, reconfigurable computing},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/OGHPC/2014/petrenko2014OGHPCaih/petrenko2014OGHPCaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/OGHPC/2014/petrenko2014OGHPCaih/petrenko2014OGHPCaih_poster.pdf},
	author = {Art Petrenko and Felix J. Herrmann and Diego Oriato and Simon Tilbury and Tristan van Leeuwen}
}
@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}
}
@conference {lago2014CMCCRMN,
	title = {CRMN method for solving time-harmonic wave equation},
	booktitle = {Copper Mountain Conference},
	year = {2014},
	note = {(Copper Mountain)},
	month = {04},
	abstract = {We address the solution of PDEs associated with the wave propagation phenomena in heterogeneous media using CGMN method. It consists of a conjugate gradients method using Kaczmarz double sweeps as preconditioner. This preconditioner has the property of {\textquoteleft}{\textquoteleft}symmetrizing" the problem allowing short recursion and Lanczos type of Krylov methods to be employed. In this talk we propose the use of CR, a minimal residual Krylov method closely related to CG. We study the proposed method which we call CRMN and discuss crucial aspects as the behaviour of the norm of the residual and the norm of the true error. We also discuss the result of an inversion of a small subsample of the 3D velocity model SEG/EAGE Overthrust using frugal full-waveform inversion method with CRMN and CGMN for solving the associated PDE, showing a strong interest in studying the behaviour of CRMN for larger realistic cases.},
	keywords = {CGMN, CRMN, Forward Modelling, Helmholtz equation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/CMC/2014/lago2014CMCCRMN.pdf},
	author = {Rafael Lago and Art Petrenko and Zhilong Fang and Felix J. Herrmann}
}
@conference {lago2014EAGEfst,
	title = {Fast solution of time-harmonic wave-equation for full-waveform inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {For many full-waveform inversion techniques, the most computationally intensive step is the computation of a numerical solution for the wave equation on every iteration. In the frequency domain approach, this requires the solution of very large, complex, sparse, ill-conditioned linear systems. In this extended abstract we bring out attention specifically to CGMN method for solving PDEs, known for being flexible (i.e. it is able to treat equally acoustic data as well as visco-elastic or more complex scenarios) efficient with respect both to memory and computation time, and controllable accuracy of the final approximation. We propose an improvement for the known CGMN method by imposing a minimal residual condition, which incurs in one extra model vector storage. The resulting algorithm called CRMN enjoys several interesting properties as monotonically nonincreasing behaviour of the norm of the residual and minimal residual, guaranteeing optimal convergence for the relative residual criterion. We discuss numerical experiments both in an isolated PDE solve and also within the inversion procedure, showing that in a realistic scenario we can expect a speedup around 25\% when using CRMN rather than CGMN.},
	keywords = {CGMN, CRMN, EAGE, FWI, Time-Harmonic Wave Equation},
	doi = {10.3997/2214-4609.20140812},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/lago2014EAGEfst/lago2014EAGEfst.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/lago2014EAGEfst/lago2014EAGEfst_pres.pdf},
	author = {Rafael Lago and Art Petrenko and Zhilong Fang 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}
}
@techreport {smithyman2014SEGjfw,
	title = {Joint full-waveform inversion of on-land surface and VSP data from the Permian Basin},
	number = {TR-EOAS-2014-4},
	year = {2014},
	month = {04},
	institution = {UBC},
	abstract = {Full-waveform Inversion is applied to generate a high-resolution model of P-wave velocity for a site in the Permian Basin, Texas, USA. This investigation jointly inverts seismic waveforms from a surface 3-D vibroseis surface seismic survey and a co-located 3-D Vertical Seismic Profiling (VSP) survey, which shared common source Vibration Points (VPs). The resulting velocity model captures features that were not resolvable by conventional migration velocity analysis.},
	keywords = {downhole receivers, Full-waveform inversion, land, seismic, vibroseis},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2014/smithyman2014SEGjfw/smithyman2014SEGjfw.html},
	author = {Brendan R. Smithyman and Bas Peters and Bryan DeVault 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}
}
@conference {leeuwen2014EAGEntf,
	title = {A new take on FWI: wavefield reconstruction inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {We discuss a recently proposed novel method for waveform inversion: Wavefield Reconstruction Inversion (WRI). As opposed to conventional FWI {\textendash} which attempts to minimize the error between observed and predicted data obtained by solving a wave equation {\textendash} WRI reconstructs a wave-field from the data and extracts a model-update from this wavefield by minimizing the wave-equation residual. The method does not require explicit computation of an adjoint wavefield as all the necessary information is contained in the reconstructed wavefield. We show how the corresponding model updates can be interpreted physically analogously to the conventional imaging-condition-based approach.},
	keywords = {EAGE, Full-waveform inversion, Optimization, penalty method, Wavefield Reconstruction Inversion},
	doi = {10.3997/2214-4609.20140703},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/leeuwen2014EAGEntf/leeuwen2014EAGEntf.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/leeuwen2014EAGEntf/leeuwen2014EAGEntf_pres.pdf},
	author = {Tristan van Leeuwen and Felix J. Herrmann and Bas Peters}
}
@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}
}
@conference {peters2014SEGsrh,
	title = {A sparse reduced Hessian approximation for multi-parameter wavefield reconstruction inversion},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2014},
	note = {(SEG)},
	month = {10},
	pages = {1206-1210},
	abstract = {Multi-Parameter full-waveform inversion is a challenging problem, because the unknown parameters appear in the same wave equation and the magnitude of the parameters can vary many orders of magnitude. This makes accurate estimation of multiple-parameters very difficult. To mitigate the problems, sequential strategies, regularization methods and scalings of gradients and quasi-Newton Hessians have been proposed. All of these require design, fine-tuning and adaptation to different waveform inversion problems. We propose to use a sparse approximation to the Hessian derived from a penalty-formulation of the objective function. Sparseness allows to have the Hessian in memory and compute update directions at very low cost. This results in decent reconstruction of the multiple parameters at very low additional memory and computational expense.},
	keywords = {Full-waveform inversion, Hessian, Optimization, penalty method, SEG},
	doi = {http://dx.doi.org/10.1190/segam2014-1667.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/peters2014SEGsrh/peters2014SEGsrh.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/peters2014SEGsrh/peters2014SEGsrh_pres.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {peters2014EAGEweb,
	title = {Wave-equation based inversion with the penalty method: adjoint-state versus wavefield-reconstruction inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {In this paper we make a comparison between wave-equation based inversions based on the adjoint-state and penalty methods. While the adjoint-state method involves the minimization of a data-misfit and exact solutions of the wave-equation for the current velocity model, the penalty-method aims to first find a wavefield that jointly fits the data and honours the physics, in a least-squares sense. Given this reconstructed wavefield, which is a proxy for the true wavefield in the true model, we calculate updates for the velocity model. Aside from being less nonlinear{\textendash}the acoustic wave equation is linear in the wavefield and model parameters but not in both{\textendash}the inversion is carried out over a solution space that includes both the model and the wavefield. This larger search space allows the algortihm to circumnavigate local minima, very much in the same way as recently proposed model extentions try to acomplish. We include examples for low frequencies, where we compare full-waveform inversion results for both methods, for good and bad starting models, and for high frequencies where we compare reverse-time migration with linearized imaging based on wavefield-reconstruction inversion. The examples confirm the expected benefits of the proposed method.},
	keywords = {EAGE, Full-waveform inversion, Imaging, Optimization, penalty method},
	doi = {10.3997/2214-4609.20140704},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/peters2014EAGEweb/peters2014EAGEweb.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/peters2014EAGEweb/peters2014EAGEweb_pres.pdf},
	author = {Bas Peters and Felix J. Herrmann and Tristan van Leeuwen}
}
@conference {herrmann2014SEGWS,
	title = {Wavefield Reconstruction Inversion (WRI) {\textendash} a new take on wave-equation based inversion},
	booktitle = {SEG Workshop on Full Waveform Inversion - Elastic Approaches and Issues with Anisotropy, Nonshallow Inversion, Poor Starting Model; Denver},
	year = {2014},
	note = {(SEG Workshop, Denver)},
	month = {10},
	keywords = {FWI, SEG, workshop, WRI},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/herrmann2014SEGWSwri/herrmann2014SEGWSwri_pres.pdf},
	author = {Felix J. Herrmann and Ernie Esser and Tristan van Leeuwen and Bas Peters}
}
@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}
}
@techreport {petrenko2013SEGsaoc,
	title = {Software acceleration of CARP, an iterative linear solver and preconditioner},
	number = {TR-EOAS-2013-4},
	year = {2013},
	institution = {UBC},
	abstract = {We present the results of software optimization of a row-wise preconditioner (Component Averaged Row Projections) for the method of conjugate gradients, which is used to solve the diagonally banded Helmholtz system representing frequency domain, isotropic acoustic seismic wave simulation. We demonstrate that in our application, a preconditioner bound to one processor core and accessing memory contiguously reduces execution time by 7\% for matrices having on the order of 108 non-zeros. For reference we note that our C implementation is over 80 times faster than the corresponding code written for a high-level numerical analysis language.},
	keywords = {frequency-domain, Helmholtz equation, Kaczmarz, software, wave propagation},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2013/petrenko2013SEGsaoc/petrenko2013SEGsaoc.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {petrenko2013HPCSsaoc,
	title = {Software acceleration of CARP, an iterative linear solver and preconditioner},
	year = {2013},
	month = {06},
	publisher = {HPCS},
	organization = {HPCS},
	abstract = {We present the results of software optimization of a row-wise preconditioner (Component Averaged Row Projections) for the method of conjugate gradients, which is used to solve the diagonally banded Helmholtz system representing frequency domain, isotropic acoustic seismic wave simulation. We demonstrate that in our application, a preconditioner bound to one processor core and accessing memory contiguously reduces execution time by 7\% for matrices having on the order of 108 non-zeros. For reference we note that our C implementation is over 80 times faster than the corresponding code written for a high-level numerical analysis language.},
	keywords = {frequency-domain, Helmholtz equation, HPCS, Kaczmarz, software, wave propagation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/HPCS/2013/petrenko2013HPCSsaoc/petrenko2013HPCSsaoc.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/HPCS/2013/petrenko2013HPCSsaoc/petrenko2013HPCSsaoc_poster.pdf},
	author = {Art Petrenko and Tristan van Leeuwen 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}
}
