• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 576
Next 10 →

A new discrepancy principle

by A. G. Ramm - J. Math. Anal. Appl , 2005
"... The aim of this note is to prove a new discrepancy principle. The advantage of the new discrepancy principle compared with the known one consists of solving a minimization problem (see problem (2) below) approximately, rather than exactly, and in the proof of a stability result. To explain this in m ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
The aim of this note is to prove a new discrepancy principle. The advantage of the new discrepancy principle compared with the known one consists of solving a minimization problem (see problem (2) below) approximately, rather than exactly, and in the proof of a stability result. To explain

Discrepancy principle for DSM II

by A. G. Ramm , 2008
"... Let Ay = f, A is a linear operator in a Hilbert space H, y ⊥ N(A): = {u: Au = 0}, R(A): = {h: h = Au, u ∈ D(A)} is not closed, �fδ − f � ≤ δ. Given fδ, one wants to construct uδ such that limδ→0 �uδ − y � = 0. Two versions of discrepancy principles for the DSM (dynamical systems method) for findin ..."
Abstract - Add to MetaCart
Let Ay = f, A is a linear operator in a Hilbert space H, y ⊥ N(A): = {u: Au = 0}, R(A): = {h: h = Au, u ∈ D(A)} is not closed, �fδ − f � ≤ δ. Given fδ, one wants to construct uδ such that limδ→0 �uδ − y � = 0. Two versions of discrepancy principles for the DSM (dynamical systems method

Discrepancy principle for DSM

by A. G. Ramm - I, II, Comm. Nonlin. Sci. and Numer. Simulation , 2008
"... Let Ay = f, A is a linear operator in a Hilbert space H, y ⊥ N(A): = {u: Au = 0}, R(A): = {h: h = Au,u ∈ D(A)} is not closed, ‖fδ − f ‖ ≤ δ. Given fδ, one wants to construct uδ such that limδ→0 ‖uδ − y ‖ = 0. A version of the DSM (dynamical systems method) for finding uδ consists of solving the pr ..."
Abstract - Cited by 7 (6 self) - Add to MetaCart
the problem ˙uδ(t) = −uδ(t) + T −1 a(t) A ∗ fδ, u(0) = u0, (∗) where T: = A ∗ A, Ta: = T + aI, and a = a(t)> 0, a(t) ց 0 as t → ∞ is suitably chosen. It is proved that uδ: = uδ(tδ) has the property limδ→0 ‖uδ − y ‖ = 0. Here the stopping time tδ is defined by the discrepancy principle: ∫ t 0 e −(t−s) a

L.: A discrepancy principle for Poisson data

by M Bertero, P Boccacci, G Talenti, R Zanella, L Zanni - Inverse Problems , 2010
"... A discrepancy principle for Poisson data ..."
Abstract - Cited by 14 (2 self) - Add to MetaCart
A discrepancy principle for Poisson data

reconstruction and a related discrepancy principle

by P Boccacci, M Bertero , 2011
"... Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle This article has been downloaded from IOPscience. Please scroll down to see the full text article. ..."
Abstract - Add to MetaCart
Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle This article has been downloaded from IOPscience. Please scroll down to see the full text article.

REGULARIZATION AND MOROZOV’S DISCREPANCY PRINCIPLE by

by Marygeorge L. Whitney, Marygeorge L. Whitney, Under Direction, Dr. Alexandra Smirnova, Marygeorge L. Whitney, Marygeorge Llewellyn Whitney
"... A concept of a well-posed problem was initially introduced by J. Hadamard in 1923, who expressed the idea that every mathematical model should have a unique solution, stable with respect to noise in the input data. If at least one of those properties is violated, the problem is ill-posed (and unstab ..."
Abstract - Add to MetaCart
(normally available), in order to solve an ill-posed problem in a stable fashion. In this thesis, theoretical and numerical investigation of Tikhonov’s (variational) regularization is presented. The regularization parameter is computed by the discrepancy principle of Morozov, and a first-kind integral

Discrepancy principle for the dynamical systems method

by A. G. Ramm , 2005
"... ..."
Abstract - Cited by 17 (15 self) - Add to MetaCart
Abstract not found

The Discrepancy Principle for Choosing Bandwidths in Kernel Density Estimation

by Thoralf Mildenberger , 2012
"... We investigate the discrepancy principle for choosing smoothing parameters for kernel density estimation. The method is based on the distance between the empirical and estimated distribution functions. We prove some new positive and negative results on L1-consistency of kernel estimators with bandwi ..."
Abstract - Add to MetaCart
We investigate the discrepancy principle for choosing smoothing parameters for kernel density estimation. The method is based on the distance between the empirical and estimated distribution functions. We prove some new positive and negative results on L1-consistency of kernel estimators

ON THE GENERALIZED DISCREPANCY PRINCIPLE FOR TIKHONOV REGULARIZATION IN HILBERT SCALES

by S. Lu, S. V. Pereverzev, Y. Shao, U. Tautenhahn, Dedicated Charles, W. Groetsch
"... Abstract. For solving linear ill-posed problems regularization methods are required when the right hand side and the operator are with some noise. In the present paper regularized solutions are obtained by Tikhonov regularization in Hilbert scales and the regularization parameter is chosen by the ge ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
by the generalized discrepancy principle. Under certain smoothness assumptions we provide order optimal error bounds that characterize the accuracy of the regularized solution. It appears that for getting small error bounds a proper scaling of the penalizing operator B is required. For the computation

A discrepancy principle for equations with monotone continuous operators

by N. S. Hoang, A. G. Ramm - NONLINEAR ANALYSIS , 2008
"... ..."
Abstract - Cited by 7 (6 self) - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 576
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University