Related papers: On iterative methods for solving ill-posed problem…
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…
We show that Nesterov acceleration is an optimal-order iterative regularization method for linear ill-posed problems provided that a parameter is chosen accordingly to the smoothness of the solution. This result is proven both for an a…
Efficiently solving sparse linear algebraic equations is an important research topic of numerical simulation. Commonly used approaches include direct methods and iterative methods. Compared with the direct methods, the iterative methods…
Results about existence and uniqueness of solutions of initial value problem for certain types of partial differential equations are recalled as well as iterative scheme and an error estimate for approximate solutions obtained using this…
We study the iterated quasi-reversibility method to regularize ill-posed elliptic and parabolic problems: data completion problems for Poisson's and heat equations. We define an abstract setting to treat both equations at once. We…
We consider a general nonsymmetric second-order linear elliptic PDE in the framework of the Lax-Milgram lemma. We formulate and analyze an adaptive finite element algorithm with arbitrary polynomial degree that steers the adaptive…
In this paper, we study the convergence properties of an iterative algorithm for fast nonlinear model predictive control of quasi-linear parameter-varying systems without inequality constraints. Compared to previous works considering this…
Multiscale and multiphysics problems need novel numerical methods in order for them to be solved correctly and predictively. To that end, we develop a wavelet based technique to solve a coupled system of nonlinear partial differential…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrained optimization problem, where a regularization function is…
In 2005, Abramsky introduced various linear/affine combinatory algebras of partial involutions over a suitable formal language, to discuss reversible computation in a game-theoretic setting. These algebras arise as instances of the general…
We extend the piecewise orthogonal collocation method to computing periodic solutions of coupled renewal and delay differential equations. Through a rigorous error analysis, we prove convergence of the relevant finite-element method and…
In this paper, we consider effective discretization strategies and iterative solvers for nonlinear PDE-constrained optimization models for pattern evolution within biological processes. Upon a Sequential Quadratic Programming linearization…
In this work we discuss the possibility to reduce the computational complexity of modal methods, i.e. methods based on eigenmodes expansion, from the third power to the second power of the number of eigenmodes. The proposed approach is…
Robust Markov decision processes (MDPs) allow to compute reliable solutions for dynamic decision problems whose evolution is modeled by rewards and partially-known transition probabilities. Unfortunately, accounting for uncertainty in the…
Partial Differential Equations are precise in modelling the physical, biological and graphical phenomena. However, the numerical methods suffer from the curse of dimensionality, high computation costs and domain-specific discretization. We…
We revisit a unified methodology for the iterative solution of nonlinear equations in Hilbert spaces. Our key observation is that the general approach from [Heid & Wihler, Math. Comp. 89 (2020), Calcolo 57 (2020)] satisfies an energy…
The theory of complete generalized Jordan sets is employed to reduce the PDE with the irreversible linear operator $B$ of finite index to the regular problems. It is demonstrated how the question of the choice of boundary conditions is…
This paper concerns robust numerical treatment of an elliptic PDE with high contrast coefficients, for which classical finite-element discretizations yield ill-conditioned linear systems. This paper introduces a procedure by which the…
In this paper, we consider a class of nonconvex problems with linear constraints appearing frequently in the area of image processing. We solve this problem by the penalty method and propose the iteratively reweighted alternating…