相关论文: Perturbed preconditioned inverse iteration for ope…
This study investigates the variational posterior convergence rates of inverse problems for partial differential equations (PDEs) with parameters in Besov spaces $B_{pp}^\alpha$ ($p \geq 1$) which are modeled naturally in a Bayesian manner…
A nonlinear optimization method is proposed for the solution of inverse medium problems with spatially varying properties. To avoid the prohibitively large number of unknown control variables resulting from standard grid-based…
This paper deals with Tikhonov regularization for linear and nonlinear ill-posed operator equations with wavelet Besov norm penalties. We focus on $B^0_{p,1}$ penalty terms which yield estimators that are sparse with respect to a wavelet…
Inverse problems are ubiquitous in science and engineering. Many of these are naturally formulated as a PDE-constrained optimization problem. These non-linear, large-scale, constrained optimization problems know many challenges, of which…
The nonconforming virtual element method (NCVEM) for the approximation of the weak solution to a general linear second-order non-selfadjoint indefinite elliptic PDE in a polygonal domain is analyzed under reduced elliptic regularity. The…
Preconditioned iterative methods for numerical solution of large matrix eigenvalue problems are increasingly gaining importance in various application areas, ranging from material sciences to data mining. Some of them, e.g., those using…
We consider the non-self-adjoint Sturm-Liouville operator on a finite interval. The inverse spectral problem is studied, which consists in recovering this operator from its eigenvalues and generalized weight numbers. We prove local…
We develop an iterative refinement method that improves the accuracy of a user-chosen subset of $k$ eigenvectors ($k\ll n$) of an $n\times n$ real symmetric matrix. Using an orthogonal matrix represented in compact WY form, the method…
We adapt the inverse iteration method for symmetric matrices to some nonlinear PDE eigenvalue problems. In particular, for $p\in (1,\infty)$ and a given domain $\Omega\subset\mathbb{R}^n$, we analyze a scheme that allows us to approximate…
The iterated Arnoldi-Tikhonov (iAT) method is a regularization technique particularly suited for solving large-scale ill-posed linear inverse problems. Indeed, it reduces the computational complexity through the projection of the…
Hardware trends have motivated the development of mixed precision algo-rithms in numerical linear algebra, which aim to decrease runtime while maintaining acceptable accuracy. One recent development is the development of an adaptive…
We introduce a simple, general, and convergent scheme to compute generalized eigenfunctions of self-adjoint operators with continuous spectra on rigged Hilbert spaces. Our approach does not require prior knowledge about the eigenfunctions,…
We show that, under suitable conditions, finite-dimensional systems describing invariant solutions of partial differential equations (PDEs) inherit local Hamiltonian operators through the mechanism of invariant reduction, which applies…
The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary conditions. These operators can be realized as the…
While preconditioning is a long-standing concept to accelerate iterative methods for linear systems, generalizations to matrix functions are still in their infancy. We go a further step in this direction, introducing polynomial…
In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the…
We consider singular perturbed eigenvalue problem for Laplace operator in a cylinder with frequent and nonperiodic alternation of boundary conditions imposed on narrow strips lying in the lateral surface. The width of strips depends on a…
We consider optimal design of PDE-based Bayesian linear inverse problems with infinite-dimensional parameters. We focus on the A-optimal design criterion, defined as the average posterior variance and quantified by the trace of the…
A reduction of the transmission eigenvalue problem for multiplicative sign-definite perturbations of elliptic operators with constant coefficients to an eigenvalue problem for a non-selfadjoint compact operator is given. Sufficient…
In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the $n\times n$ matrix polynomial of arbitrary degree $k$. Given a set of $m$ eigenpairs ($1 \leqslant m \leqslant kn$), this problem…