scholarly journals Generalized Subspace Methods For Large-Scale Inverse Problems

1993 ◽  
Vol 114 (1) ◽  
pp. 12-20 ◽  
Author(s):  
D. W. Oldenburg ◽  
P. R. Mcgillivray ◽  
R. G. Ellis
2021 ◽  
pp. 104790
Author(s):  
Ettore Biondi ◽  
Guillaume Barnier ◽  
Robert G. Clapp ◽  
Francesco Picetti ◽  
Stuart Farris

2008 ◽  
Vol 17 (03) ◽  
pp. 439-446
Author(s):  
HAOHANG SU ◽  
YIMEN ZHANG ◽  
YUMING ZHANG ◽  
JINCAI MAN

An improved method is proposed based on compressed and Krylov-subspace iterative approaches to perform efficient static and transient simulations for large-scale power grid circuits. It is implemented with CG and BiCGStab algorithms and an excellent result has been obtained. Extensive experimental results on large-scale power grid circuits show that the present method is over 200 times faster than SPICE3 and around 10–20 times faster than ICCG method in transient simulations. Furthermore, the presented algorithm saves the memory usage over 95% of SPICE3 and 75% of ICCG method, respectively while the accuracy is not compromised.


2021 ◽  
Vol 47 (2) ◽  
pp. 1-34
Author(s):  
Umberto Villa ◽  
Noemi Petra ◽  
Omar Ghattas

We present an extensible software framework, hIPPYlib, for solution of large-scale deterministic and Bayesian inverse problems governed by partial differential equations (PDEs) with (possibly) infinite-dimensional parameter fields (which are high-dimensional after discretization). hIPPYlib overcomes the prohibitively expensive nature of Bayesian inversion for this class of problems by implementing state-of-the-art scalable algorithms for PDE-based inverse problems that exploit the structure of the underlying operators, notably the Hessian of the log-posterior. The key property of the algorithms implemented in hIPPYlib is that the solution of the inverse problem is computed at a cost, measured in linearized forward PDE solves, that is independent of the parameter dimension. The mean of the posterior is approximated by the MAP point, which is found by minimizing the negative log-posterior with an inexact matrix-free Newton-CG method. The posterior covariance is approximated by the inverse of the Hessian of the negative log posterior evaluated at the MAP point. The construction of the posterior covariance is made tractable by invoking a low-rank approximation of the Hessian of the log-likelihood. Scalable tools for sample generation are also discussed. hIPPYlib makes all of these advanced algorithms easily accessible to domain scientists and provides an environment that expedites the development of new algorithms.


Author(s):  
Julianne Chung ◽  
Sarah Knepper ◽  
James G. Nagy
Keyword(s):  

Geophysics ◽  
2008 ◽  
Vol 73 (4) ◽  
pp. A23-A26 ◽  
Author(s):  
Gilles Hennenfent ◽  
Ewout van den Berg ◽  
Michael P. Friedlander ◽  
Felix J. Herrmann

Geophysical inverse problems typically involve a trade-off between data misfit and some prior model. Pareto curves trace the optimal trade-off between these two competing aims. These curves are used commonly in problems with two-norm priors in which they are plotted on a log-log scale and are known as L-curves. For other priors, such as the sparsity-promoting one-norm prior, Pareto curves remain relatively unexplored. We show how these curves lead to new insights into one-norm regularization. First, we confirm theoretical properties of smoothness and convexity of these curves from a stylized and a geophysical example. Second, we exploit these crucial properties to approximate the Pareto curve for a large-scale problem. Third, we show how Pareto curves provide an objective criterion to gauge how different one-norm solvers advance toward the solution.


1988 ◽  
Vol 94 (2) ◽  
pp. 237-247 ◽  
Author(s):  
B. L. N. Kennett ◽  
M. S. Sambridge ◽  
P. R. Williamson

Sign in / Sign up

Export Citation Format

Share Document