Algorithms that satisfy a stopping criterion, probably

DOI10.1007/S10013-015-0167-6zbMath1334.65013arXiv1408.5946OpenAlexW2963667391MaRDI QIDQ269806

Farbod Roosta-Khorasani, Uri M. Ascher

Publication date: 6 April 2016

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5946

zbMATH Keywords

inverse problemMonte Carlo methoditerative methodmathematical softwareDC resistivityerror tolerancelarge scale simulationtrace estimation

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Monte Carlo methods (65C05) Iterative numerical methods for linear systems (65F10) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical methods for inverse problems for initial value and initial-boundary value problems involving PDEs (65M32)

Uses Software

• SPGL1
• RESINVM3D
• kappa_SQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chaotic nature of faster gradient descent methods
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• Improved bounds on sample size for implicit matrix trace estimators
• Statistical and computational inverse problems.
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Quantitative Photoacoustic Tomography
• Stochastic Algorithms for Inverse Problems Involving PDEs and many Measurements
• Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
• Solving Ordinary Differential Equations I
• Simulating Hamiltonian Dynamics
• An Application of Random Projection to Parameter Estimation in Partial Differential Equations
• Assessing Stochastic Algorithms for Large Scale Nonlinear Least Squares Problems Using Extremal Probabilities of Linear Combinations of Gamma Random Variables
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Lectures on Stochastic Programming
• Two-Point Step Size Gradient Methods
• Global Error versus Tolerance for Explicit Runge-Kutta Methods
• Gradient Method with Retards and Generalizations
• Optical tomography in medical imaging
• Electrical Impedance Tomography
• A shape reconstruction method for electromagnetic tomography using adjoint fields and level sets
• A Posteriori Error Estimation and Global Error Control for Ordinary Differential Equations by the Adjoint Method
• Computational Methods for Inverse Problems
• An Effective Method for Parameter Estimation with PDE Constraints with Multiple Right-Hand Sides
• The Midpoint Scheme and Variants for Hamiltonian Systems: Advantages and Pitfalls
• Solving Ordinary Differential Equations II
• The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares Problems
• Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds
• High-contrast impedance tomography
• A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
• Adaptive finite volume method for distributed non-smooth parameter identification
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Algorithms that satisfy a stopping criterion, probably