Related papers: Inverse linear problems on Hilbert space and their…
Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…
Tools of the intrinsic analysis on manifolds, helpful in solving the invariant inverse problem of the calculus of variations are being presented comprising a combined approach which consists in the simultaneous imposition of symmetry…
We analyze backward step control globalization for finding zeros of G\^ateaux-differentiable functions that map from a Banach space to a Hilbert space. The results include global convergence to a distinctive solution characterized by…
Hilbert volume is an invariant of real projective geometry. Polygons inscribed in polygons are considered for the real projective plane. The correspondence between Fock-Goncharov and Cartesian coordinates is examined. Degeneration and…
The symmetry-resolved Krylov complexity is a useful tool in studying chaotic properties of systems that are endowed with symmetries. We investigate the conditions under which an invariant operator would have the symmetry-resolved Krylov…
In this text I present a couple of new principles and thereon based iterative methods for numerical solution of sequences of systems of linear equations with fixed system matrix and changing right-hand-sides. The use of the new methods is…
A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions $1, 2, \ldots$ grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus…
This work gives an expository account of certain applications of microlocal analysis in three geometric inverse problems. We will discuss the geodesic X-ray transform inverse problem, the Gelfand problem for the wave equation on a…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
Low-rank Krylov methods are one of the few options available in the literature to address the numerical solution of large-scale general linear matrix equations. These routines amount to well-known Krylov schemes that have been equipped with…
Iterative solvers for large-scale linear systems such as Krylov subspace methods can diverge when the linear system is ill-conditioned, thus significantly reducing the applicability of these iterative methods in practice for…
This papers aims at revisiting Minkowski space-time with a modified outlook and making it more consistent (III.8). The paper scrutinizes the special case of relativistic hypothesis (STR). The paper tries to solve the problems faced by…
We provide an overview of recent progress in statistical inverse problems with random experimental design, covering both linear and nonlinear inverse problems. Different regularization schemes have been studied to produce robust and stable…
We consider linear ill-conditioned operator equations in a Hilbert space setting. Motivated by the aggregation method, we consider approximate solutions constructed from linear combinations of Tikhonov regularization, which amounts to…
The fractional inverse $M^{-\gamma}$ (real $\gamma >0$) of a matrix $M$ is expanded in a series of Gegenbauer polynomials. If the spectrum of $M$ is confined to an ellipse not including the origin, convergence is exponential, with the same…
The Bayesian approach to inverse problems provides a practical way to solve ill-posed problems by augmenting the observation model with prior information. Due to the measure-theoretic underpinnings, the approach has raised theoretical…
Randomized iterative methods, such as the randomized Kaczmarz method, have gained significant attention for solving large-scale linear systems due to their simplicity and efficiency. Meanwhile, Krylov subspace methods have emerged as a…
We consider a Krylov subspace approximation method for the symmetric differential Riccati equation $\dot{X} = AX + XA^T + Q - XSX$, $X(0)=X_0$. The method we consider is based on projecting the large scale equation onto a Krylov subspace…
We provide convergence rates for Krylov subspace solutions to the trust-region and cubic-regularized (nonconvex) quadratic problems. Such solutions may be efficiently computed by the Lanczos method and have long been used in practice. We…
We consider the dynamic problems for the discrete systems with discrete time associated with finite and semi-infinite Jacobi matrices. The result of the paper is a procedure of association of special Hilbert spaces of functions, namely de…